Correctness of a compiler for a Lisp subset

Authors:
Ralph L. London
Affiliations:
Stanford University and University of Wisconsin
Venue:
Proceedings of ACM conference on Proving assertions about programs
Year:
1972

Citing 2
Cited 7

Implementation and applications of Scott's logic for computable functions

Proceedings of ACM conference on Proving assertions about programs
Correctness of two compilers for a Lisp subset

Correctness of two compilers for a Lisp subset

An experiment in high level language microprogramming and verification

Communications of the ACM
Considerations for future programming language standards activities

Communications of the ACM
The current state of proving programs correct

ACM '72 Proceedings of the ACM annual conference - Volume 1
Structured programming, programming teaching and the language Pascal

ACM SIGPLAN Notices
A summary of progress toward proving program correctness

AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
Proving a compiler correct: A simple approach

Journal of Computer and System Sciences
Survey: A survey of state vectors

Computer Science Review

Quantified Score

Hi-index	0.03

Visualization

Abstract

Excerpts of a proof of correctness of a running Lisp compiler for the PDP-10 computer are given. Included are the rationale for presenting this proof and a discussion of an actual extension of the proof to another compiler.