An approach to compiler correctness

Authors:
Laurian M. Chirica;David F. Martin
Affiliations:
Computer Science Department, University of California, Los Angeles;Computer Science Department, University of California, Los Angeles
Venue:
Proceedings of the international conference on Reliable software
Year:
1975

Citing 5
Cited 2

Syntax-Directed Transduction

Journal of the ACM (JACM)
An axiomatic basis for computer programming

Communications of the ACM
EULER: a generalization of ALGOL and it formal definition: Part 1

Communications of the ACM
Second-order mathematical theory of computation

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Correctness of two compilers for a Lisp subset

Correctness of two compilers for a Lisp subset

Verified compilation in micro-Gypsy

TAV3 Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verification
Translation validation for an optimizing compiler

PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is a preliminary report on an experiment in applying Floyd's method of inductive assertions to the compiler correctness problem. Practical postfix translators are considered, and the semantics of source and object languages are characterized by Floyd verification conditions. Compiler correctness proofs are partitioned into two parts. The first part deals with proofs of the syntactic and translational phase of compilation, and generates semantic equivalence theorems which are proved in the second part. These techniques are illustrated by a small example.