Static analysis of gated data dependence graphs

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

Volumn 3148, Issue , 2004, Pages 197-211

  Hymans, Charles ^a   Upton, Eben ^b  

^a ECOLE POLYTECHNIQUE   (France)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

RECONFIGURABLE HARDWARE; SEMANTICS;

ABSTRACT INTERPRETATIONS; CONVENTIONAL TECHNIQUES; DATA DEPENDENCE GRAPHS; INTERMEDIATE REPRESENTATIONS;

STATIC ANALYSIS;

EID: 35048816981     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (10)

1. R. Bagnara, P. M. Hill, E. Ricci, and E. Zaffanella. Possibly not closed convex polyhedra and the parma polyhedra library. In Proceedings of the 9th Static Analysis Symposium, pages 213-229, 2002.
2. R. Bagnara, P. M. Hill, E. Ricci, and E. Zaffanella. Precise widening operators for convex polyhedra. In Proceedings of the 10th Static Analysis Symposium, pages 337-354, 2003.
3. R. A. Ballance, A. B. Maccabe, and K. J. Ottenstein. The program dependence web: A representation supporting control-, data-, and demand-driven interpretation of imperative languages. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 257-271, 1990.
4. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the 4th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 238-252, 1977.
5. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Conference Record of the 5th Annual ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, pages 84-97, 1978.
6. N. Johnson and A. Mycroft. Combined code motion and register allocation using the value state dependence graph. In Proceedings of Compiler Construction, Lecture Notes in Computer Science, 2003.
7. S. C. Kleene. Introduction to Metamathematics. North-Holland, 1952.
8. D. J. Kuck, R. H. Kuhn, B. Leasure, D. A. Padua, and M. Wolfe. Dependence graphs and compiler optimizations. In Conference Record of the 8th ACM Symposium on Principles of Programming Languages, pages 207-218, 1981.
9. P. Tu and D. A. Padua. Efficient building and placing of gating functions. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 47-55, 1995.
10. D. Weise, R. F. Crew, M. Ernst, and B. Steensgaard. Value dependence graphs: Representation without taxation. In Proceedings of the 21th ACM Symposium on Principles of Programming Languages, pages 297-310, 1994.