Constraint-based inter-procedural analysis of parallel programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1782, Issue , 2000, Pages 351-365

  Seidl, Helmut ^a   Steffen, Bernhard ^b  

^a UNIVERSITY OF TRIER   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Bit vector problems; Coincidence theorems; Explicit parallelism; Inter procedural program analysis; Simple constant propagation

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

BIT VECTOR; COINCIDENCE THEOREMS; CONSTANT PROPAGATION; EXPLICIT PARALLELISM; PROGRAM ANALYSIS;

ARTIFICIAL INTELLIGENCE;

EID: 84947290808     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46425-5_23     Document Type: Conference Paper

References (13)

1. Martin Alt and Florian Martin. Generation of Efficient Interprocedural Analyzers with PAG. In Proceedings of 2nd Static Analysis Symposium (SAS), pages 33-50. LNCS 983, Springer Verlag, 1995.
2. Patrick Cousot. Semantic Foundations of Program Analysis. In Steven S. Muchnick and Neil D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 10, pages 303-342. Prentice-Hall, Inc., Englewood Cli_s, New Jersey, 1981.
3. Patrick Cousot and Radhia Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Proceedings of 4th ACM Symposium on Principles of Programming Languages (POPL), pages 238-252. ACM Press, 1977.
4. Patrick Cousot and Radhia Cousot. Static Determination of Dynamic Properties of Recursive Programs. In E.J. Neuhold, editor, Formal Descriptions of Programming Concepts, pages 237-277. North-Holland Publishing Company, 1977.
5. J. Esparza and J. Knoop. An Automata-theoretic Approach to Interprocedural Data-flow Analysis. In FoSSaCS '99, volume 1578 of Lecture Notes in Computer Science (LNCS), pages 14-30. Springer-Verlag, 1999.
6. J. Esparza and A. Podelski. Efficient Algorithms for pre* and post* on Interprocedural Parallel Flow Graphs. In ACM International Conference on Princples of Programming Languages (POPL), 2000. To appear.
7. M.S. Hecht. Flow Analysis of Computer Programs. The Computer Science Library. North-Holland, New York, 1977.
8. J. Knoop and B. Steffen. The Interprocedural Coincidence Theorem. In 4th International Conference on Compiler Construction (CC'92), volume 641 of Lecture Notes in Computer Science (LNCS), pages 125-140. Springer-Verlag, 1992.
9. J. Knoop. Parallel Constant Propagation. In 4th European Conference on Parallel Processing (Euro-Par), volume 1470 of Lecture Notes in Computer Science (LNCS), pages 445-455. Springer-Verlag, 1998.
10. J. Knoop, O. Rüthing, and B. Steffen. Towards a Tool Kit for the Automatic Generation of Interprocedural Data Flow Analyses. Journal of Programming Languages, 4(4):211-246, December 1996. Chapman & Hall, London (UK).
11. J. Knoop, B. Steffen, and J. Vollmer. Parallelism for Free: Efficient and Optimal Bitvector Analyses for Parallel Programs. ACM Transactions on Programming Languages and Systems, 18(3):268-299, 1996.
12. D. Lugiez and P. Schnoebelen. The Regular Viewpoint on PA-Processes. In 9th International Conference on Concurrency (CONCUR), volume 1466 of Lecture Note In Computer Science (LNCS), pages 50-66. Springer-Verlag, 1998.
13. H. Seidl and C. Fecht. Interprocedural Analyses: A Comparison. Journal of Logic Programming (JLP), 43(2):123-156, 2000.