Transformations of denotational semantics in semantics directed compiler generation
SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Toward compiler implementation correctness proofs
ACM Transactions on Programming Languages and Systems (TOPLAS)
The correctness of an optimized code generation
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Implementation of the typed call-by-value λ-calculus using a stack of regions
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The design and implementation of a certifying compiler
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Within ARM's reach: compilation of left-linear rewrite systems via minimal rewrite systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Initial Algebra Semantics and Continuous Algebras
Journal of the ACM (JACM)
Properties of a Notation for Combining Functions
Journal of the ACM (JACM)
Translation validation for an optimizing compiler
PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Deriving Target Code as a Representation of Continuation Semantics
ACM Transactions on Programming Languages and Systems (TOPLAS)
Control Flow Aspects of Semantics-Directed Compiling
ACM Transactions on Programming Languages and Systems (TOPLAS)
SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
Semantics-directed machine architecture
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Semantics and correctness of a query language translation: (preliminary version)
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Generating Model Checkers from Algebraic Specifications
Formal Methods in System Design
Specification languages in algebraic compilers
Theoretical Computer Science - Special issue: Algebraic methodology and software technology
Compilation and Synthesis for Real-Time Embedded Controllers
Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel)
From Specifications to Code in CASL
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
An Overview of Compositional Translations
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Automatic Validation of Code-Improving Transformations
LCTES '00 Proceedings of the ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems
Automatically proving the correctness of compiler optimizations
PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
The scheme 311 compiler an exercise in denotational semantics
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Control flow aspects of semantics directed compiling (Summary)
SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
Programming languages considered as abstract data types
ACM '80 Proceedings of the ACM 1980 annual conference
The Early Search for Tractable Ways of Reasoning about Programs
IEEE Annals of the History of Computing
Validation of code-improving transformations for embeded systems
Proceedings of the 2003 ACM symposium on Applied computing
Compiler verification: a bibliography
ACM SIGSOFT Software Engineering Notes
The design and implementation of a certifying compiler
ACM SIGPLAN Notices - Best of PLDI 1979-1999
Automatic validation of code-improving transformations on low-level program representations
Science of Computer Programming - Special issue on program transformation
Formal validation of pattern matching code
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Cobalt: A Language for Writing Provably-Sound Compiler Optimizations
Electronic Notes in Theoretical Computer Science (ENTCS)
Proving a compiler correct: A simple approach
Journal of Computer and System Sciences
| Hi-index | 0.00 |
The purpose of this paper is to advise an approach (and to support that advice by discussion of an example) towards achieving a goal first announced by John McCarthy: that compilers for higher-level programming languages should be made completely trustworthy by proving their correctness. The author believes that the compiler-correctness problem can be made much less general and better-structured than the unrestricted program-correctness problem; to do so will of course entail restricting what a compiler may be.