Entry Wilson:1995:ECP 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{Wilson:1995:ECP,
  author =       "Robert P. Wilson and Monica S. Lam",
  title =        "Efficient context-sensitive pointer analysis for {C}
                 programs",
  journal =      j-SIGPLAN,
  volume =       "30",
  number =       "6",
  pages =        "1--12",
  month =        jun,
  year =         "1995",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Thu May 13 12:37:27 MDT 1999",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html",
  URL =          "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p1-wilson/",
  abstract =     "This paper proposes an efficient technique for
                 context-sensitive pointer analysis that is applicable
                 to real C programs. For efficiency, we summarize the
                 effects of procedures using {\em partial transfer
                 functions\/}. A partial transfer function (PTF)
                 describes the behavior of a procedure assuming that
                 certain alias relationships hold when it is called. We
                 can reuse a PTF in many calling contexts as long as the
                 aliases among the inputs to the procedure are the same.
                 Our empirical results demonstrate that this technique
                 is successful---a single PTF per procedure is usually
                 sufficient to obtain completely context-sensitive
                 results. Because many C programs use features such as
                 type casts and pointer arithmetic to circumvent the
                 high-level type system, our algorithm is based on a
                 low-level representation of memory locations that
                 safely handles all the features of C. We have
                 implemented our algorithm in the SUIF compiler system
                 and we show that it runs efficiently for a set of C
                 benchmarks.",
  acknowledgement = ack-nhfb,
  affiliation =  "Comput. Syst. Lab., Stanford Univ., CA, USA",
  annote =       "Published as part of the Proceedings of PLDI'95.",
  classification = "C6140D (High level languages); C6150C (Compilers,
                 interpreters and other processors)",
  keywords =     "algorithms; Alias relationships; C benchmarks; C
                 programs; Compiler system; Context-sensitive pointer
                 analysis; High-level type system; languages; Memory
                 locations; Partial transfer functions; Pointer
                 arithmetic; Procedure call; SUIF; Type casts",
  subject =      "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language
                 Classifications, C. {\bf D.3.3} Software, PROGRAMMING
                 LANGUAGES, Language Constructs and Features, Data types
                 and structures. {\bf D.3.4} Software, PROGRAMMING
                 LANGUAGES, Processors, Compilers. {\bf D.3.4} Software,
                 PROGRAMMING LANGUAGES, Processors, Optimization.",
  thesaurus =    "C language; Program compilers; Remote procedure
                 calls",
}

Related entries