Entry Gupta:1990:FLA 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{Gupta:1990:FLA,
  author =       "Rajiv Gupta",
  title =        "A fresh look at optimizing array bound checking",
  journal =      j-SIGPLAN,
  volume =       "25",
  number =       "6",
  pages =        "272--282",
  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 =      "Thu May 13 12:37:27 MDT 1999",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html",
  URL =          "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p272-gupta/",
  abstract =     "This paper describes techniques for optimizing range
                 checks performed to detect array bound violations. In
                 addition to the elimination of range checks, the
                 optimizations discussed in this paper also reduce the
                 overhead due to range checks that cannot be eliminated
                 by compile-time analysis. The optimizations reduce the
                 program execution time and the object code size through
                 elimination of redundant checks, propagation of checks
                 out of loops, and combination of multiple checks into a
                 single check. A minimal control flow graph (MCFG) is
                 constructed using which the minimal amount of data flow
                 information required for range check optimizations is
                 computed. The range check optimizations are performed
                 using the MCFG rather the CFG for the entire program.
                 This allows the global range check optimizations to be
                 performed efficiently since the MCFG is significantly
                 smaller than the CFG.",
  acknowledgement = ack-nhfb,
  affiliation =  "Philips Lab",
  affiliationaddress = "Briarcliff Manor, NY, USA",
  annote =       "Published as part of the Proceedings of PLDI'90.",
  classification = "723",
  conference =   "Proceedings of the ACM SIGPLAN '90 Conference on
                 Programming Language Design and Implementation",
  conferenceyear = "1990",
  journalabr =   "SIGPLAN Not",
  keywords =     "algorithms; Arrays; Computer Operating Systems; Data
                 Processing --- Data Structures; experimentation;
                 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 D.3.4} Software, PROGRAMMING LANGUAGES,
                 Processors, Optimization. {\bf F.2.2} Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Computations on discrete structures. {\bf G.2.2}
                 Mathematics of Computing, DISCRETE MATHEMATICS, Graph
                 Theory, Graph algorithms. {\bf F.3.3} Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies
                 of Program Constructs. {\bf D.2.2} Software, SOFTWARE
                 ENGINEERING, Design Tools and Techniques.",
}

Related entries