Jan Olaf Blech, Sabine Glesner  Home/Search
Context
Related
| info.unikarlsruhe...snerATPS2004.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: info.unikarlsruhe.de/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Optimizations in compilers are the most error-prone phases in the compilation process. Since correct compilers are a vital precondition for software correctness, it is necessary to prove their correctness. We develop a formal semantics for static single assignment (SSA) intermediate representations and prove formally within the Isabelle /HOL theorem prover that a relatively simple form of code generation preserves the semantics of the transformed programs in SSA form. This formal... (Update)
Active bibliography (related documents): More All
0.5: A Shading Language on Graphics Hardware: The PixelFlow Shading .. - Olano, Lastra (1998) (Correct)
0.5: Concept Assignment as a Debugging Technique for Code Generators - Singer (2005) (Correct)
0.1: Verified Bytecode Verification and Type-Certifying Compilation - Klein, Strecker (2003) (Correct)
Similar documents based on text: More All
0.4: Electronic Notes in Theoretical Computer Science 82 No. 2 (2003) - Url Http Www (2003) (Correct)
0.4: Classifying and Formally Verifying Integer Constant Folding - Glesner, Blech (2003) (Correct)
0.3: Structural Simulation Proofs based on ASMs even for.. - Glesner, Zimmermann (Correct)
BibTeX entry: (Update)
@misc{ blech-formal,
author = "Jan Olaf Blech and Sabine Glesner",
title = "A Formal Correctness Proof for Code Generation from SSA Form in Isabelle/HOL",
url = "citeseer.ist.psu.edu/blech04formal.html" }
Citations (may not include all citations):566 Proof-Carrying Code - Necula - 1997
415 Efficiently Computing Static Single Assignment Form and the .. - Cytron, Ferrante et al. - 1991
69 IsabelleHOL Proof Assistant Higher Order Logic (context) - Paulson, HOL et al. - 2002
69 Evolving Algebras 1993: Lipari Guide - Gurevich - 1995
41 Translation Validation for an Optimizing Compiler - Necula - 2000
29 A Mechanically Verified Language Implementation - Moore - 1989
19 Sparse Functional Stores for Imperative Programs - Steensgaard - 1995
12 Theoretical Computer Science (context) - Klein, Nipkow - 2003
9 Formal verification of a Java compiler in Isabelle - Strecker - 2002
7 Compiler Correctness and Implementation Verification: The Ve.. - Goerigk, Dold et al. - 1996
2 Compiler Design and Implementation (context) - Muchnick - 1997
2 Using Program Checking to Ensure the Correctness of Compiler.. (context) - Glesner - 2003
1 Eine formale Semantik f ur SSA Zwischensprachen IsabelleHOL (context) - Eine, ur et al. - 2004
1 Theorem Proving in Higher Order Logics (context) - Nipkow - 1998
1 An ASM Semantics for SSA Intermediate Representations (context) - Glesner - 2004
1 Tools and Algorithms for the Construction and Analysis of Sy.. (context) - Pnueli, Siegel et al. - 1998
1 A Completely Verified Realistic Bootstrap Compiler (context) - Dold, von Henke et al. - 2003
1 Cambridge University Press (context) - Nipkow, Rewriting et al. - 1998
Documents on the same site (http://www.info.uni-karlsruhe.de/papers/): More
Verifying Compilers and ASMs or ASMs for uniform description .. - Goos, Zimmermann (2000) (Correct)
libFIRM: A Library for Compiler Optimization Research.. - Lindenmaier (2002) (Correct)
Lazy XML Processing - Noga, Schott, Löwe (2002) (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