Proving correctness of compiler optimizations by temporal logic

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

Volumn , Issue , 2002, Pages 283-294

  Lacey, David ^a   Jones, Neil D ^b   Van Wyk, Eric ^a   Frederiksen, Carl Christian ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; DATA FLOW ANALYSIS; FORMAL LOGIC; OPTIMIZATION; PROGRAM TRANSLATORS; SEMANTICS;

DEAD CODE ELIMINATION; PROGRAM MANIPULATION; PROGRAM TRANSFORMATIONS; TEMPORAL LOGIC;

PROGRAM COMPILERS;

EID: 0036038554     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/503272.503299     Document Type: Conference Paper

References (34)

1. Automatic verification of finite-state concurrent systems using temporal logic specifications
2. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fix-points
3. Semantic foundations of program analysis
4. Computational tree logic CTL* and path quantifiers in the monadic theory of the binary tree
5. Semantique: Semantic-based program manipulation techniques
6. Abstract interpretation: A semantics-based tool for program analysis
7. Optimal code motion: Theory and practice
8. Certification of compiler optimizations using Kleene algebra with tests
9. Once and for all
10. Imperative program transformation by rewriting
11. Proof-carrying code
12. A denotational framework for data flow analysis
13. A temporal logic for reasoning about partially ordered computations
14. Using model checking in a parallelizing compiler
15. Data-flow analysis is model checking of abstract interpretations
16. Program analysis as model checking of abstract interpretations
17. Lightweight closure conversion
18. The fixpoint analysis machine
19. On the relation of programs and computations to models of temporal logic