L. M. Chirica and D. F. Martin. An approach to compiler correctness. ACM SIGPLAN Notices, 10(6):96-103, June 1975.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....realistic programs such as the compiler itself or the Linux kernel. We believe that the price of such an infrastructure is small considering the qualitative increase in the ability to isolate compilation errors during compiler testing and maintenance. 1 Introduction Despite a large body of work [CM75, MP67, Mor73, Moo89, You89, WO92] in the area of compiler veri cation we are still far from being able to prove automatically that a given optimizing compiler always produces target programs that are semantically equivalent to their source versions. But if we cannot prove that a compiler is ....

L. M. Chirica and D. F. Martin. An approach to compiler correctness. ACM SIGPLAN Notices, 10(6):96-103, June 1975.

....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 ....

L.M. Chirica and D.F. Martin. An Approach to Compiler Correctness. Proceedings of the International Conference on Reliable Software, April, 1975, pp. 96-103.

....diagram which represent the 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 ....

L.M. Chirica and D.F. Martin. An Approach to Compiler Correctness. In Proceedings of the International Conference on Reliable Software, pages 96-103. April, 1975.

....machine code. The work of Burstall and Landin [BurstallLandin 69] formalizes the semantics algebraically and proves the equivalence of the results of the functions describing the source and target languages. This apparently inspired the similar work of Morris [Morris 72, Morris 73] and Chirica [Chirica 76] Milne and Strachey [MilneStrachey 76] give a hand proof of a compiler for a language of approximately the complexity of Algol 68. Cohn [Cohn 79a, Cohn 79b] proves several components of a compiler using Edinburgh LCF. The intricacies of denotational semantics have been used in a variety of novel ....

L.M. Chirica. An Approach to Compiler Correctness. PhD thesis, University of California at Los Angeles, October, 1976.

....of Lisp. The second version contains more optimizations than the first. Morris [24] uses algebraic semantics to specify and partially prove by hand a simple compiler for an Algol like language. Cohn [11] use Edinburgh LCF to prove the correctness of a simple compiling algorithm. Chirica and Martin [9] use axiomatic semantics to specify and prove a simple compiler. Lynn [19] uses Hoare style axiomatic semantics to specify source and target languages of a slightly modified version of London s compiler. He also uses the same technique to prove a slightly modified version of McCarthy and Painter s ....

.... PNAMES (STRIP CARS ALIST) 1] L PROPER PROGRAMSP PNAMES) 2] ALL LITATOMS (STRIP CARS ALIST) 3] L DATA SEG BODY RESTRICTEDP T EXPR) 4] L RESTRICTEDP PNAMES ALIST) 5] V C T EXPR ALIST) 6] L RESTRICT SUBRPS T EXPR) 7] L RESTRICT SUBRPS PROGS PNAMES) 8] NOT (LESSP HEAP SIZE ;[9] (TOTAL HEAP REQS EXPR ALIST PNAMES HEAP SIZE) NOT (LESSP MAX CTRL (MAX CTRL REQS EXPR ALIST PNAMES) 10] LESSP MAX CTRL (EXP 2 WORD SIZE) 11] NUMBERP MAX CTRL) 12] NOT (LESSP MAX TEMP (MAX TEMP REQS EXPR ALIST PNAMES) 13] LESSP MAX TEMP (EXP 2 WORD SIZE) 14] NUMBERP ....

[Article contains additional citation context not shown here]

L.M. Chirica and D.F. Martin. An approach to compiler correctness. In Proceedings of the International Conference on Reliable Software, pages 96-- 103, April 1977.

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