Entry Tjiang:1992:STB 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{Tjiang:1992:STB,
  author =       "Steven W. K. Tjiang and John L. Hennessy",
  title =        "{Sharlit} --- a tool for building optimizers",
  journal =      j-SIGPLAN,
  volume =       "27",
  number =       "7",
  pages =        "82--93",
  month =        jul,
  year =         "1992",
  CODEN =        "SINODQ",
  ISBN =         "0-89791-475-9",
  ISBN-13 =      "978-0-89791-475-8",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)",
  ISSN-L =       "0362-1340",
  LCCN =         "QA76.7.S53 1992",
  bibdate =      "Sun Dec 14 09:16:22 MST 2003",
  bibsource =    "Compendex database; http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html",
  URL =          "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p82-tjiang/",
  abstract =     "A complex and time-consuming function of a modern
                 compiler is global optimization. Unlike other functions
                 of a compiler such as parsing and code generation which
                 examine only one statement or one basic block at a
                 time, optimizers are much larger in scope, examining
                 and changing large portions of a program all at once.
                 The larger scope means optimizers must perform many
                 program transformations. Each of these transformations
                 makes its own particular demands on the internal
                 representation of programs; each can interact with and
                 depend on the others in different ways. This makes
                 optimizers large and complex. Despite their complexity,
                 few tools exist to help in building optimizers. This is
                 in stark contrast with other parts of the compiler
                 where years of experience have culminated in tools with
                 which these other parts can be constructed easily. For
                 example, parser generators are used to build
                 front-ends, and peephole optimizers and tree matchers
                 are used to build code generators. This paper presents
                 Sharlit, a tool to support the construction of modular
                 and extensible global optimizers. We will show how
                 Sharlit helps in constructing data-flow analyzers and
                 the transformations that use data-flow analysis
                 information, both are major components of any
                 optimizer. Sharlit is implemented in C++ and uses C++
                 in the same way that YACC uses C. Thus we assume the
                 reader has some familiarity with C++[9].",
  acknowledgement = ack-nhfb,
  affiliation =  "Stanford Univ",
  affiliationaddress = "CA, USA",
  annote =       "Published as part of the Proceedings of PLDI'92.",
  classification = "723.1",
  conference =   "Proceedings of the ACM SIGPLAN '92 Conference on
                 Programming Language Design and Implementation",
  conferenceyear = "1992",
  journalabr =   "SIGPLAN Not",
  keywords =     "algorithms; Computer programming; Data-flow analyzers;
                 design; Global optimizers; Optimization; Program
                 compilers; Sharlit",
  meetingaddress = "San Francisco, CA, USA",
  meetingdate =  "Jun 17--19 1992",
  meetingdate2 = "06/17--19/92",
  sponsor =      "ACM",
  subject =      "{\bf D.3.4} Software, PROGRAMMING LANGUAGES,
                 Processors, Optimization. {\bf D.3.2} Software,
                 PROGRAMMING LANGUAGES, Language Classifications, C++.
                 {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design
                 Tools and Techniques.",
}

Related entries