Composing dataflow analyses and transformations

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2002, Pages 270-282

  Lerner, Sorin ^a   Grove, David ^b   Chambers, Craig ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE REUSABILITY; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING; PROGRAM COMPILERS; RESPONSE TIME (COMPUTER SYSTEMS);

GRAPH TRANSFORMATIONS; PHASE ORDERING PROBLEM;

DATA FLOW ANALYSIS;

EID: 0036039975     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/503272.503298     Document Type: Conference Paper

References (34)

1. Solving systems of set constraints
2. Generation of efficient interprocedural analyzers with PAG
3. How to uniformly specify program analysis and transformations with graph rewrite systems
4. Graph rewrite systems for program optimization
5. The cecil language: Specification and rationale
6. Frameworks for intra- and interprocedural dataflow analysis
7. Iterative type analysis and extended message splitting: Optimizing dynamically-typed object-oriented programs
8. Automatic construction of sparse data flow evaluation graphs
9. Combining analyses, combining optimizations
10. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints
11. Systematic design of program analysis frameworks
12. An efficient method of computing static single assignment form
13. Vortex: An optimizing compiler for object-oriented languages
14. How to analyze large programs efficiently and informatively
15. A flexible architecture for building data flow analyzers
16. The program dependence graph and its use in optimization
17. Fiat: A framework for interprocedural analysis and transformation
18. Set-based analysis of ml programs
19. A practical context-sensitive interprocedural analysis framework for c compilers
20. A unified treatment of flow analysis in higher-order languages
21. Dependence-based program analysis
22. Composing dataflow analyses and transformations
23. Lattice frameworks for multisource and bidirectional data flow problems
24. A simplifier based on efficient decision algorithms
25. Combining interprocedural pointer analysis and conditional constant propagation
26. A new framework for exhaustive and incremental data flow analysis using DJ graphs
27. Sharlit - A tool for building optimizers
28. SPARE: A development environment for program analysis algorithms
29. Constant propagation with conditional branches
30. Constant propagation with conditional branches
31. Value dependence graphs: Representation without taxation
32. An approach to ordering optimizing transformations
33. An approach for exploring code improving transformations
34. Automatic generation and management of interprocedural program analyses