Entry Masticola:1993:NA from sigplan1990.bib

Last update: Thu Apr 12 03:37:15 MDT 2012                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Masticola:1993:NA,
  author =       "Stephen P. Masticola and Barbara G. Ryder",
  title =        "Non-concurrency analysis",
  journal =      j-SIGPLAN,
  volume =       "28",
  number =       "7",
  pages =        "129--138",
  month =        jul,
  year =         "1993",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Thu Dec 14 18:49:37 MST 1995",
  abstract =     "Non-concurrency analysis is a set of techniques for
                 statically identifying pairs (or sets) of statements in
                 a concurrent program which can never happen together.
                 The authors present a framework for non-currency
                 analysis, capable of incorporating previous analysis
                 algorithms and improving upon them. They show general
                 theoretical results which are useful in estimating
                 nonconcurrency, and examples of non-concurrency
                 analysis frameworks for two synchronization primitives:
                 the Ada rendezvous and binary semaphores. Both of these
                 frameworks have a low-order polynomial bound on
                 worst-case solution time. The provide experimental
                 evidence that static non-concurrency analysis of Ada
                 programs can be accomplished in a reasonable time, and
                 is generally quite accurate.",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Comput. Sci., Rutgers Univ., New Brunswick,
                 NJ, USA",
  classification = "C4240P (Parallel programming and algorithm theory);
                 C6110P (Parallel programming)",
  confdate =     "19-22 May 1993",
  conflocation = "San Diego, CA, USA",
  confsponsor =  "ACM",
  keywords =     "Ada programs; Ada rendezvous; Binary semaphores;
                 Concurrent program; Non-currency analysis; Polynomial
                 bound; Synchronization primitives; Worst-case solution
                 time",
  thesaurus =    "Ada; Concurrency control; Parallel programming",
}

Related entries