A verified code generator for a subset of gypsy

作者: J. Strother Moore , William David Young , Robert S. Boyer

DOI:

关键词:

摘要: This report describes the specification and mechanical proof of a code generator for subset Gypsy 2.05 called Micro-Gypsy. Micro-Gypsy is high-level language containing many control structures, simple data types arrays, predefined user-defined procedure definitions including recursive definitions. The formally specified by recognizer interpreter written as functions in Boyer-Moore logic. target Piton assembly verified J Moore to be correctly implemented on FM8502 hardware. semantics another A function maps state program structures into an initial state. We prove that arbitrary legal Piton. By this we mean execution resulting semantically equivalent (under mapping exhibit) result executing with interpreter. An interesting fact our implementation pass parameters efficiently reference even though use value-result semantic definition. are not aware any previous passing implements semantics. In define Piton, describe translation process, explain correctness theorem proved.

参考文章(43)
Raymond Aubin, Mechanizing structural induction The University of Edinburgh. ,(1976)
J. Strother Moore, Robert S. Boyer, William Richard Bevier, A verified operating system kernel The University of Texas at Austin. ,(1987)
James Allan Painter, Semantic correctness of a compiler for an algol-like language University Microfilms. ,(1967)
R. S. Boyer, J. S. Moore, Integrating decision procedures into heuristic theorem provers: a case study of linear arithmetic Machine intelligence. pp. 83- 124 ,(1988)
Donald S. Lynn, Interactive Compiler Proving Using Hoare Proof Rules Defense Technical Information Center. ,(1978) , 10.21236/ADA052911
Clement Leo Mcgowan, Correctness results for lambda calculus interpreters Correctness results for lambda calculus interpreters. pp. 162- 162 ,(1971)
Larry Calvin Ragland, A verified program-verifier. The University of Texas at Austin. ,(1973)