Simple Relational Correctness Proofs for Static Analyses and Program Transformations (2004)
Cached
Download Links
by
Nick Benton
| Citations: | 57 - 9 self |
BibTeX
@MISC{Benton04simplerelational,
author = {Nick Benton},
title = {Simple Relational Correctness Proofs for Static Analyses and Program Transformations},
year = {2004}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logical and denotational techniques. The key ingredients are an interpretation of program properties as relations, rather than predicates, and a realization that although many program analyses are traditionally formulated in very intensional terms, the associated transformations are actually enabled by more liberal extensional properties.
