Entry Chambers:1990:ITA 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{Chambers:1990:ITA,
  author =       "Craig Chambers and David Ungar",
  title =        "Iterative type analysis and extended message
                 splitting: Optimizing dynamically-typed object-oriented
                 programs",
  journal =      j-SIGPLAN,
  volume =       "25",
  number =       "6",
  pages =        "150--164",
  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/p150-chambers/",
  abstract =     "Object-oriented languages have suffered from poor
                 performance caused by frequent and slow
                 dynamically-bound procedure calls. The best way to
                 speed up a procedure call is to compile it out, but
                 dynamic binding of object-oriented procedure calls
                 without static receiver type information precludes
                 inlining. Iterative type analysis and extended message
                 splitting are new compilation techniques that extract
                 much of the necessary type information and make it
                 possible to hoist run-time type tests out of loops. Our
                 system compiles code on-the-fly that is customized to
                 the actual data types used by a running program. The
                 compiler constructs a control flow graph annotated with
                 type information by simultaneously performing type
                 analysis and inlining.",
  acknowledgement = ack-nhfb,
  affiliation =  "Stanford Univ",
  affiliationaddress = "Stanford, 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 =     "algorithms; Computer Operating Systems; Computer
                 Programming --- Object Oriented Programming; languages;
                 Object-Oriented Languages; Optimizing Compilers;
                 performance; Program Compilers",
  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 F.3.3} Theory of Computation, LOGICS AND MEANINGS
                 OF PROGRAMS, Studies of Program Constructs, Type
                 structure. {\bf D.3.2} Software, PROGRAMMING LANGUAGES,
                 Language Classifications. {\bf D.3.3} Software,
                 PROGRAMMING LANGUAGES, Language Constructs and
                 Features, Control structures. {\bf D.3.4} Software,
                 PROGRAMMING LANGUAGES, Processors, Compilers. {\bf
                 F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS
                 AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
                 Problems, Computations on discrete structures. {\bf
                 D.3.4} Software, PROGRAMMING LANGUAGES, Processors,
                 Optimization.",
}

Related entries