Entry Dhamdhere:1992:HAL 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{Dhamdhere:1992:HAL,
  author =       "Dhananjay M. Dhamdhere and Barry K. Rosen and F.
                 Kenneth Zadeck",
  title =        "How to analyze large programs efficiently and
                 informatively",
  journal =      j-SIGPLAN,
  volume =       "27",
  number =       "7",
  pages =        "212--223",
  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/p212-dhamdhere/",
  abstract =     "Elimination of partial redundancies is a powerful
                 optimization that has been implemented in at least
                 three important production compilers and has inspired
                 several similar optimizations. The global data flow
                 analysis that supports this family of optimizations
                 includes some bidirectional problems. (A bidirectional
                 problem is one in which the global information at each
                 basic block depends on both control flow predecessors
                 and control flow successors.) This paper contributes
                 two ways to simplify and expedite the analysis,
                 especially for large programs. For each global data
                 flow question, we examine only the places in the
                 program where the question might have an answer
                 different from a trivial default answer. In a large
                 program, we may examine only a small fraction of the
                 places conventional algorithms would examine. We reduce
                 the relevant bidirectional problems to simpler
                 unidirectional problems. These bidirectional problems
                 can be solved by applying a quick correction to a
                 unidirectional approximation.",
  acknowledgement = ack-nhfb,
  affiliation =  "Indian Inst of Technology",
  affiliationaddress = "Bombay, India",
  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; Elimination of
                 partial redundancies; Global data flow analysis;
                 Production compilers; Program compilers; theory",
  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 F.3.3} Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies
                 of Program Constructs. {\bf D.3.3} Software,
                 PROGRAMMING LANGUAGES, Language Constructs and
                 Features, Control structures.",
}

Related entries