Entry Masticola:1995:LFM from toplas.bib

Last update: Tue May 1 02:05:46 MDT 2012                Valid HTML 3.2!

Index sections

Top | Symbols | 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:1995:LFM,
  author =       "Stephen P. Masticola and Thomas J. Marlowe and Barbara
                 G. Ryder",
  title =        "Lattice Frameworks for Multisource and Bidirectional
                 Data Flow Problems",
  journal =      j-TOPLAS,
  volume =       "17",
  number =       "5",
  pages =        "777--803",
  month =        sep,
  year =         "1995",
  CODEN =        "ATPSDT",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/toplas.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0164-0925/213989.html",
  abstract =     "{\em Multisource\/} data flow problems involve
                 information which may enter nodes independently through
                 different classes of edges. In some cases, dissimilar
                 meet operations appear to be used for different types
                 of nodes. These problems include {\em bidirectional\/}
                 and {\em flow-sensitive\/} problems as well as many
                 static analyses of concurrent programs with
                 synchronization. {\em K-tuple frameworks}, a type of
                 standard data flow framework, provide a natural
                 encoding for multisource problems using a single meet
                 operator. Previously, the solution of these problems
                 has been described as the fixed point of a set of data
                 flow equations. Using our $k$-tuple representation, we
                 can access the general results of standard data flow
                 frameworks concerning convergence time and solution
                 precision for these problems. We demonstrate this for
                 the bidirectional component of partial redundancy
                 suppression and two problems on the program summary
                 graph. An interesting subclass of $k$-tuple frameworks,
                 the {\em join-of-meets\/} frameworks, is useful for
                 reachability problems, especially those stemming from
                 analyses of explicitly parallel programs. We give
                 results on function space properties for join-of-meets
                 frameworks that indicate precise solutions for most of
                 them will be difficult to obtain.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
  keywords =     "languages",
  subject =      "{\bf F.3.2}: Theory of Computation, LOGICS AND
                 MEANINGS OF PROGRAMS, Semantics of Programming
                 Languages. {\bf D.3.1}: Software, PROGRAMMING
                 LANGUAGES, Formal Definitions and Theory. {\bf D.3.4}:
                 Software, PROGRAMMING LANGUAGES, Processors.",
}

Related entries