• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Composing Dataflow Analyses and Transformations (2001)

Cached

  • Download as a PDF

Download Links

  • [ftp.cs.washington.edu]
  • [www.cse.ucsd.edu]
  • [www.cs.ucsd.edu]
  • [cseweb.ucsd.edu]
  • [cs.ucsd.edu]
  • [cseweb.ucsd.edu]
  • [www.eecs.harvard.edu]
  • [www.cse.ucsd.edu]
  • [www.eecg.toronto.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Sorin Lerner , David Grove , Craig Chambers
Citations:35 - 6 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Lerner01composingdataflow,
    author = {Sorin Lerner and David Grove and Craig Chambers},
    title = {Composing Dataflow Analyses and Transformations},
    year = {2001}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Dataflow analyses can have mutually beneficial interactions. Previous e#orts to exploit these interactions have either (1) iteratively performed each individual analysis until no further improvements are discovered or (2) developed "superanalyses " that manually combine conceptually separate analyses. We have devised a new approach that allows analyses to be defined independently while still enabling them to be combined automatically and profitably. Our approach avoids the loss of precision associated with iterating individual analyses and the implementation di#culties of manually writing a super-analysis. The key to our approach is a novel method of implicit communication between the individual components of a super-analysis based on graph transformations. In this paper, we precisely define our approach; we demonstrate that it is sound and it terminates; finally we give experimental results showing that in practice (1) our framework produces results at least as precise as iterating the individual analyses while compiling at least 5 times faster, and (2) our framework achieves the same precision as a manually written super-analysis while incurring a compiletime overhead of less than 20%.

Citations

315 Cousot and Radhia Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints - Patrick - 1977
295 Constant propagation with conditional branches - Wegman, Zadeck - 1991
116 Iterative type analysis and extended message splitting: Optimizing dynamically-typed object-oriented programs - Chambers, Ungar - 1990
110 Automatic construction of sparse data flow evaluation graphs - Choi, Cytron, et al. - 1991
108 Set-based analysis of ML programs - Heintze - 1994
71 A unified treatment of flow analysis in higher-order languages - Jagannathan, Weeks - 1995
67 Combining analyses, combining optimizations - Click, Cooper - 1995
66 Sharlit: A tool for building optimizers - Tjiangan, Hennessy - 1992
65 An approach for exploring code improving transformations - Whitfield, Soffa - 1997
63 Cousot and Radhia Cousot. Systematic design of program analysis frameworks - Patrick - 1979
58 K.: Dependence-based program analysis - Johnson, Pingali - 1993
57 How to analyze large programs efficiently and informatively - Dhamdhere, Rosen, et al. - 1992
45 Generation of Efficient Interprocedural Analyzers with PAG - Alt, Martin - 1995
42 An approach to ordering optimizing transformations - Whitfield, Soffa - 1990
27 Ernst and Bjarne Steensgaard. Value dependence graphs: representation without taxation - Weise, Crew, et al. - 1994
22 A Flexible Architecture for Building Data Flow Analyzers - Dwyer, Clarke - 1996
19 Spare: A development environment for program analysis algorithms - Venkatesh, Fischer - 1992
18 Framework for intra- and interprocedural dataflow analysis - Chambers, Dean, et al. - 1996
14 A practical contextsensitive interprocedural alias analysis framework for C compilers - Hendren, Emami, et al. - 1993
10 A new framework for exhaustive and incremental data flow analysis using DJ graphs - Sreedhar, Gao, et al. - 1996
6 An efficient method of computing static single assignment form - Wegman, Zadeck - 1989
2 A simplifier based on efficient decision algorithms - Nelson, Oppen - 1978
1 Lattice frameworks for multisource and bidirectional data flow problems - Ryder - 1995
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University