Entry Kessler:1990:FBD 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{Kessler:1990:FBD,
  author =       "Peter B. Kessler",
  title =        "Fast breakpoints. Design and implementation",
  journal =      j-SIGPLAN,
  volume =       "25",
  number =       "6",
  pages =        "78--84",
  month =        jun,
  year =         "1990",
  CODEN =        "SINODQ",
  ISBN =         "0-89791-364-7",
  ISBN-13 =      "978-0-89791-364-5",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Sun Dec 14 09:15:53 MST 2003",
  bibsource =    "Compendex database; http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html",
  URL =          "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p78-kessler/",
  abstract =     "We have designed and implemented a fast breakpoint
                 facility. Breakpoints are usually thought of as a
                 feature of an interactive debugger, in which case the
                 breakpoints need not be particularly fast. In our
                 environment breakpoints are often used for
                 non-interactive information gathering; for example,
                 procedure call count and statement execution count
                 profiling. When used non-interactively, breakpoints
                 should be as fast as possible, so as to perturb the
                 execution of the program as little as possible. Even in
                 interactive debuggers, a conditional breakpoint
                 facility would benefit from breakpoints that could
                 transfer to the evaluation of the condition rapidly,
                 and continue expeditiously if the condition were not
                 satisfied. Such conditional breakpoints could be used
                 to check assertions, etc. Program advising could also
                 make use of fast breakpoints. Examples of advising
                 include tracing, timing, and even animation, all of
                 which should be part of an advanced programming
                 environment.",
  acknowledgement = ack-nhfb,
  affiliation =  "Xerox PARC",
  affiliationaddress = "Palo Alto, CA, USA",
  annote =       "Published as part of the Proceedings of PLDI'90.",
  classification = "722; 723",
  conference =   "Proceedings of the ACM SIGPLAN '90 Conference on
                 Programming Language Design and Implementation",
  conferenceyear = "1990",
  journalabr =   "SIGPLAN Not",
  keywords =     "Computer Operating Systems; Computer Programming ---
                 Program Debugging; design; languages; performance;
                 Program Breakpoints; Program Processors; reliability",
  meetingaddress = "White Plains, NY, USA",
  meetingdate =  "Jun 20--22 1990",
  meetingdate2 = "06/20--22/90",
  sponsor =      "Assoc for Computing Machinery, Special Interest Group
                 on Programming Languages",
  subject =      "{\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing
                 and Debugging, Debugging aids. {\bf D.3.2} Software,
                 PROGRAMMING LANGUAGES, Language Classifications, Cedar.
                 {\bf D.2.3} Software, SOFTWARE ENGINEERING, Coding
                 Tools and Techniques. {\bf D.3.3} Software, PROGRAMMING
                 LANGUAGES, Language Constructs and Features,
                 Procedures, functions, and subroutines.",
}

Related entries