Entry Holzle:1992:DOC 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{Holzle:1992:DOC,
  author =       "Urs H{\"o}lzle and Craig Chambers and David Ungar",
  title =        "Debugging optimized code with dynamic deoptimization",
  journal =      j-SIGPLAN,
  volume =       "27",
  number =       "7",
  pages =        "32--43",
  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/p32-holzle/",
  abstract =     "SELF's debugging system provides complete source-level
                 debugging ({\em expected behavior\/}) with globally
                 optimized code. It shields the debugger from
                 optimizations performed by the compiler by dynamically
                 {\em deoptimizing\/} code on demand. Deoptimization
                 only affects the procedure activations that are
                 actively being debugged; all other code runs at full
                 speed. Deoptimization requires the compiler to supply
                 debugging information at discrete {\em interrupt
                 points\/}; the compiler can still perform extensive
                 optimizations between interrupt points without
                 affecting debuggability. At the same time, the
                 inability to interrupt between interrupt points is
                 invisible to the user. Our debugging system also
                 handles {\em programming changes\/} during debugging.
                 Again, the system provides expected behavior: it is
                 possible to change a running program and immediately
                 observe the effects of the change. Dynamic
                 deoptimization transforms old compiled code (which may
                 contain inlined copies of the old version of the
                 changed procedure) into new versions reflecting the
                 current source-level state. To the best of our
                 knowledge, SELF is the first practical system providing
                 full expected behavior with globally optimized code.",
  acknowledgement = ack-nhfb,
  affiliation =  "Stanford Univ",
  affiliationaddress = "Stanford, 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; Dynamic
                 deoptimization; languages; Optimized code debugging;
                 performance; Program debugging",
  meetingaddress = "San Francisco, CA, USA",
  meetingdate =  "Jun 17--19 1992",
  meetingdate2 = "06/17--19/92",
  sponsor =      "ACM",
  subject =      "{\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing
                 and Debugging, Debugging aids. {\bf D.3.4} Software,
                 PROGRAMMING LANGUAGES, Processors, Optimization. {\bf
                 D.3.2} Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Self.",
}

Related entries