D.S. Lynn. Interactive Compiler Proving Using Hoare Proof Rules. Tech. Rept. ISI/RR-78-70, Information Sciences Institute, January, 1978. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Mechanically Verified Code Generator - Young (1989) (27 citations) (Correct)
....to be the proof of McCarthy and Painter [18] of a simple expression compiler. Various extensions to this work have been reported [6, 19, 7, 1, 4] Other interpreter equivalence proofs of direct relevance to ours are reported in [13, 21, 2] Several compiler proofs have used axiomatic semantics [8, 16] and much work has been directed toward specifying and proving compilers using denotational semantics [20, 9] The most notable previous mechanical compiler proof is by Polak [23] Polak uses denotational semantics to describe both the source and target languages. His work is less rigorous than ....
D.S. Lynn. Interactive Compiler Proving Using Hoare Proof Rules. Tech. Rept. ISI/RR-78-70, Information Sciences Institute, January, 1978.
A Verified Code Generator For A Subset Of Gypsy - Young (1988) (14 citations) (Correct)
....source and target language semantics are characterized with axiomatic (Hoare style) semantics or by denotational algebraic semantics. Several attempts have been made to use axiomatic semantics as a basis for compiler proofs. Notable are the work of Chirica and Martin [ChiricaMartin 75] and Lynn [Lynn 78] Chirica and Martin use a Hoare style semantics for a simple language with expressions, assignments, and loops. Lynn considers the proof of a compiler for a subset of Lisp including user defined functions and uses Hoare style axioms to specify the semantics of the source and target languages. ....
.... the following used mechanical proof support: the proofs by Milner and Weyhrauch [MilnerWeyhrauch 72] Cartwright [Cartwright 76] Aubin [Aubin 76] and Boyer and Moore [Boyer 79] of 195 McCarthy Painter style expression compilers; proofs or partial proofs of compilers by Newey [Newey 75] Lynn [Lynn 78] Cohn [Cohn 79a, Cohn 79b] Polak [Polak 81] and Moore [Moore 88] proofs of microprocessors by Hunt [Hunt 85] and Cohn [Cohn 87] and the proof of an operating system kernel by Bevier [Bevier 87] 9.2 Comments and Summary The work described in this dissertation has several components. 1. We ....
D.S. Lynn. Interactive Compiler Proving Using Hoare Proof Rules. Technical Report ISI/RR-78-70, Information Sciences Institute, January, 1978.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC