Nick Benton  Home/Search
Context Related
| microsoft.com/~nic...orrectnessfull.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: microsoft.com/~nic...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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... (Update)
Cited by: More
Program Logic and Program Analysis - Honda, Yoshida, Berger (Correct)
Imperative Program Optimization by Partial Evaluation - Debois (2004) (Correct)
Translating Dependency into Parametricity - Stephen Tse Steve (Correct)
Active bibliography (related documents): More All
2.2: Simple Relational Correctness Proofs for Static Analyses and.. - Benton (2004) (Correct)
0.4: Automatically Proving the Correctness of Compiler.. - Lerner, Millstein.. (2003) (Correct)
0.3: Useless-Code Elimination and Program Slicing for the Pi-Calculus - Kobayashi (2003) (Correct)
Similar documents based on text: More All
0.1: Linear Logic, Monads, and the Lambda Calculus - Benton, Wadler (1995) (Correct)
0.1: Unknown - Esik Ing Olfsd (Correct)
0.1: A Typed Logic for Stacks and Jumps: DRAFT - Benton (2004) (Correct)
Related documents from co-citation: More All
3: A sound type system for secure flow analysis - Volpano, Smith et al. - 1996
3: A Core Calculus of Dependency - Abadi, Banerjee et al. - 1999
3: Information flow inference for ML - Pottier, Simonet - 2002
BibTeX entry: (Update)
N. Benton. Simple relational correctness proofs for static analyses and program transformations. In Proc. 31st ACM Symp. on Principles of Programming Languages (POPL), pages 14--25. ACM Press, 2004. http://citeseer.ist.psu.edu/article/benton04simple.html More
@misc{ benton04simple,
author = "N. Benton",
title = "Simple relational correctness proofs for static analyses and program transformations",
text = "N. Benton. Simple relational correctness proofs for static analyses and
program transformations. In Proc. 31st ACM Symp. on Principles of Programming
Languages (POPL), pages 14--25. ACM Press, 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/article/benton04simple.html" }
Citations (may not include all citations):866 Techniques and Tools (context) - Aho, Sethi et al. - 1986
650 An axiomatic basis for computer programming (context) - Hoare - 1969
318 IEEE Transactions on Software Engineering (context) - Weiser - 1984
225 Flow Analysis of Computer Programs (context) - Hecht - 1977
194 The Formal Semantics of Programming Languages (context) - Winskel - 1993
156 A unified approach to global program optimization (context) - Kildall - 1973
152 A sound type system for secure flow analysis - Volpano, Smith et al. - 1996
139 Secure information flow in a multi-threaded imperative langu.. - Smith, Volpano - 1998
121 A core calculus of dependency - Abadi, Banerjee et al. - 1999
69 Relational properties of domains - Pitts - 1996
49 Specifying the correctness of binding-time analysis (context) - Wand - 1993
47 A PER model of secure information flow in sequential program.. - Sabelfeld, Sands - 2001
42 A PER model of polymorphism and recursive types - Abadi, Plotkin - 1990
41 Translation validation for an optimizing compiler - Necula - 2000
37 Formal parametric polymorphism - Abadi, Cardelli et al. - 1993
32 Subtyping with singleton types - Aspinall - 1995
29 Secure information flow and pointer confinement in a Java-li.. - Banerjee, Naumann - 2002
28 Binding time analysis: A new PERspective - Hunt, Sands - 1991
24 Strictness Analysis of Lazy Functional Programs (context) - Benton - 1992
24 Constraint systems for useless variable elimination - Wand, Siveroni - 1999
20 Set constraints for destructive array update optimization - Wand, Clinger - 2001
19 Minimal thunkification - Amtoft - 1993
16 Proving correctness of compiler optimizations by temporal lo.. - Lacey, Jones et al. - 2002
15 Type-based useless variable elimination - Kobayashi - 2000
15 Credible compilation with pointers - Rinard, Marinov - 1999
14 ACM Transactions on Programming Languages and Systems (context) - Nielson, in et al. - 1985
10 Automatic useless-code detection and elimination for hot fun.. (context) - Damiani, Giannini - 2000
8 Certification of compiler optimizations using Kleene algebra.. - Kozen, Patron - 2000
6 Technical Report MIT-LCS-TR (context) - Rinard - 1999
6 ects and transformations (context) - Benton, Kennedy - 1999
6 Automatically proving the correctness of compiler optimizati.. - Lerner, Millstein et al. - 2003
4 ACM Transactions on Programming Languages and Systems (context) - Steckler, Wand et al. - 1997
4 Type specialization for the lambda calculus (context) - Hughes - 1996
4 Useless-code Detection and Elimination for PCF with Algebrai.. (context) - Damiani - 1999
3 VOC: A methodology for the translation validation for optimi.. - Zuck, Pnueli et al. - 2003
3 Verification of the Schorr-Waite graph marking algorithm by .. (context) - Yang - 2003
Documents on the same site (http://research.microsoft.com/~nick/publications.htm): More
Pattern Transfer: bridging the gap between theory and practice - Benton (Correct)
Modern Concurrency Abstractions for C - Benton, Cardelli, Fournet (2002) (Correct)
Embedded Interpreters - Benton (2005) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC