Correctness of Classical Compiler Optimizations using CTL (2001)
by
Carl Christian Frederiksen
| Venue: | In Proc. of Compiler Optimization meets Compiler Verificaiton (COCV) 2002, Electronic Notes in Theoretical Computer Science (ENTCS |
| Citations: | 8 - 1 self |
BibTeX
@INPROCEEDINGS{Frederiksen01correctnessof,
author = {Carl Christian Frederiksen},
title = {Correctness of Classical Compiler Optimizations using CTL},
booktitle = {In Proc. of Compiler Optimization meets Compiler Verificaiton (COCV) 2002, Electronic Notes in Theoretical Computer Science (ENTCS},
year = {2001},
pages = {1--15}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Citations
| 843 | Advanced Compiler Design and Implementation - Muchnick - 1997 |
| 458 | Principles of program analysis - Nielson, Nielson, et al. - 1999 |
| 187 | Logic in Computer Science. Modelling and reasoning about systems - Huth, Ryan - 2000 |
| 111 | Optimal code motion: Theory and practice - Knoop, Rüthing, et al. - 1994 |
| 55 | Program analysis as model checking of abstract interpretations - Schmidt, Steffen - 1998 |
| 48 | Proving correctness of compiler optimizations by temporal logic - Lacey, Jones, et al. |
| 33 | Imperative program transformation by rewriting - Lacey, Moor - 2001 |
| 29 | A temporal logic for reasoning about partially ordered computations - Pinter, Wolper - 1984 |
| 27 | Certification of compiler optimizations using Kleene algebra with tests - Kozen, Patron |
| 10 | Universal regular path queries - Moor, Lacey, et al. - 2003 |
| 9 | Concepts, Algorithms, and Tools for Model Checking (Lecture Notes for Real Time Systems course - Katoen - 1999 |
| 5 | and Oege de Moor. Imperative program transformation by rewriting - Lacey - 2001 |
