Proving correctness of compiler optimizations by temporal logic

Proving correctness of compiler optimizations by temporal logic (2002)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by David Lacey , Neil D. Jones

Citations:

48 - 4 self

BibTeX

@INPROCEEDINGS{Lacey02provingcorrectness,
    author = {David Lacey and Neil D. Jones},
    title = {Proving correctness of compiler optimizations by temporal logic},
    booktitle = {},
    year = {2002},
    pages = {283--294},
    publisher = {ACM Press}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

1635	Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints - Cousot, Cousot - 1977
1085	Automatic verification of finite-state concurrent systems using temporal logic specifications - Clarke, Emerson, et al. - 1986
1016	Proof-carrying code - Necula - 1997
843	Advanced Compiler Design and Implementation - Muchnick - 1997
458	Principles of program analysis - Nielson, Nielson, et al. - 1999
274	Flow Analysis of Computer Programs - Hecht - 1977
216	The formal semantics of programming languages - Winskel - 1993
137	Abstract interpretation: a unied lattice model for static analysis of programs by construction or approximation of xpoints - Cousot, Cousot - 1977
115	Abstract interpretation of declarative languages - Abramsky, Hankin - 1987
111	Optimal code motion: Theory and practice - Knoop, Rüthing, et al. - 1994
84	Semantic foundations of program analysis - Cousot - 1981
79	Abstract interpretation: a semantics-based tool for program analysis - Jones, Nielson - 1994
78	Theory of programming language and semantics - Milne, Starchey - 1976
77	Data flow analysis is model checking of abstract interpretations - Schmidt - 1998
72	Selective and lightweight closure conversion - WAND, STECKLER - 1994
67	Automatic veri of concurrent systems using temporal logic speci State/Event-based Software Model Checking 19 - Clarke, Emerson, et al. - 1986
66	Program Flow Analysis: Theory and Applications - Muchnick, Jones - 1981
55	Program analysis as model checking of abstract interpretations - Schmidt, Steffen - 1998
46	On the relation of programs and computations to models of temporal logic - Wolper - 1987
40	Computation tree logic CTL and path quantifiers in the monadic theory of the binary tree - Hafer, Thomas
37	Efficient Code Certification - Kozen - 1998
33	Imperative program transformation by rewriting - Lacey, Moor - 2001
33	A denotational framework for data flow analysis - Nielson - 1982
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
20	Once and for all - Kupferman, Pnueli - 1995
14	The fixpoint analysis machine - Steffen, Classen, et al. - 1995
8	Correctness of classical compiler optimizations using CTL - Frederiksen - 2002
7	Using model checking in a parallelizing compiler. Parallel processing letters - Rus, Wyk - 1998
4	Semantic Foundations of Data Flow Analysis - Nielson - 1981
1	Stepwise Development of a Denotational Stack Semantics - Havelund - 1984
1	Semantique: Semantic-Based Program Manipulation Techniques - Jones - 1989
1	Schloss Ringberg Seminar: Model Checking and Program Analysis. Workshop - Podelski, Steen, et al. - 2000
1	Imperative Program Transformation by Rewriting. Compiler Construction - Lacey, Moor - 2001