Entry Steckler:1997:LCC 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{Steckler:1997:LCC,
  author =       "Paul A. Steckler and Mitchell Wand",
  title =        "Lightweight Closure Conversion",
  journal =      j-TOPLAS,
  volume =       "19",
  number =       "1",
  pages =        "48--86",
  month =        jan,
  year =         "1997",
  CODEN =        "ATPSDT",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibdate =      "Wed Mar 12 08:06:48 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/toplas.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/toplas/1997-19-1/p48-steckler/",
  abstract =     "We consider the problem of lightweight closure
                 conversion, in which multiple procedure call protocols
                 may coexist in the same code. A lightweight closure
                 omits bindings for some of the free variables of the
                 procedure that is represents. Flow analysis is used to
                 match the protocol expected by each procedure and the
                 protocol used at its possible call sites. We formulate
                 the flow analysis as a deductive system that generates
                 a labeled transition system and a set of constraints.
                 We show that any solution to the constraints justifies
                 the resulting transformation. Some of the techniques
                 used are similar to those of abstract interpretation,
                 but others appear to be novel.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
  keywords =     "algorithms; languages; theory",
  subject =      "{\bf F.3.2}: Theory of Computation, LOGICS AND
                 MEANINGS OF PROGRAMS, Semantics of Programming
                 Languages, Operational semantics. {\bf D.3.3}:
                 Software, PROGRAMMING LANGUAGES, Language Constructs
                 and Features, Procedures, functions, and subroutines.
                 {\bf D.3.4}: Software, PROGRAMMING LANGUAGES,
                 Processors, Compilers. {\bf D.3.4}: Software,
                 PROGRAMMING LANGUAGES, Processors, Optimization. {\bf
                 F.3.1}: Theory of Computation, LOGICS AND MEANINGS OF
                 PROGRAMS, Specifying and Verifying and Reasoning about
                 Programs, Assertions. {\bf F.3.1}: Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS,
                 Specifying and Verifying and Reasoning about Programs,
                 Pre- and post-conditions.",
}

Related entries