Loading...
Please wait, while we are loading the content...
Similar Documents
Towards Rigorous Compiler Implementation Verification (1997)
| Content Provider | CiteSeerX |
|---|---|
| Author | Goerigk, Wolfgang |
| Description | This paper sketches our approach to rigorously prove the correctness of a compiler executable down to its binary machine code implementation. We will emphasize the central role of partial program correctness and its preservation, which capture the intuitive correctness requirements for transformational programs and in particular for compilers on realistic machines. Vertical and horizontal compositionality of Lsimulation (preservation of partial correctness) allows for combining small proof modules to finally complete the entire proof. Although often left out of sight, implementation verification is definitely necessary, not only but also for compiler programs. Modularization makes a rigorous compiler correctness proof also for the final compiler executable possible and feasible. 1 Introduction The purpose of this paper is to show that rigorous verification of compilers down to their machine code implementation is possible and feasible. The key ideas are preservation of partial correct... Proc. of the 1997 Workshop on Programming Languages and Fundamentals of Programming |
| File Format | |
| Language | English |
| Publisher | Springer |
| Publisher Date | 1997-01-01 |
| Access Restriction | Open |
| Subject Keyword | Horizontal Compositionality Central Role Partial Program Correctness Entire Proof Compiler Program Towards Rigorous Compiler Implementation Verification Rigorous Verification Final Compiler Partial Correctness Partial Correct Key Idea Realistic Machine Implementation Verification Binary Machine Code Implementation Small Proof Module Rigorous Compiler Correctness Proof Transformational Program Machine Code Implementation Intuitive Correctness Requirement |
| Content Type | Text |
| Resource Type | Article |