B. Levy. An Approach to Compiler Correctness Using Interpretation Between Theories. PhD thesis, Computer Science Laboratory, The Aerospace Corporation, El Segundo, CA, December 1986.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the correctness of fairly intuitive compiler speci cations. In the 80s, it was gured that rather than working with models one should be working with the speci cations or theories of these models [38, 2] and use interpretations between theories as translations schemes or compiler speci cations [25]. This freed researchers from constructing explicit models and homomorphisms in order to prove compiler correctness. The proof obligation that remained was that the equations of the source theory must hold in the target theory. This is a purely proof theoretic approach compared to the model ....

B. Levy. An Approach to Compiler Correctness Using Interpretation Between Theories. PhD thesis, Computer Science Laboratory, The Aerospace Corporation, El Segundo, CA, December 1986.

....1 . This latter sort of re nement is much like a de nition done in reverse. Re nement is a basic technique in computer science for specifying and building computer systems. Theory interpretation is an excellent tool for rigorizing computer system development based on re nement (for examples, see [20, 21, 29, 33, 35]) The interpretation in the next example formalizes the symmetry between left and right multiplication in a monoid. Example 3.2 Let M be the theory consisting of the following three sentences in the rst order language of a binary function constant and an individual constant e: 1. ....

B. H. Levy. An Approach to Compiler Correctness Using Interpretation Between Theories. PhD thesis, University of California, Los Angeles, 1986. Also Technical Report ATR-86(8454)-4, The Aerospace Corporation, El Segundo, California.

....representations of continuation style semantics to construct concrete semantics that are very close to machine language. Rashovsky [Rashovsky 82] also shows how to translate continuations into code. An approach to compiler correctness using interpretation between theories is outlined by Levy [Levy 85] This seems to be simply a variant of the algebraic approach. The most ambitious previous mechanical compiler proof has been the work of Polak [Polak 81] He uses denotational semantics for describing both the source and target language. The source language is a fairly substantial subset of ....

B.H. Levy. An Approach to Compiler Correctness Using Interpretation Between Theories. Technical Report 85(8354)-1, Aerospace Corporation, April, 1985.

....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 compiler. The former proof was done mostly by hand, the latter with machine assistance. Levy [17] gives an approach to proving the correctness of compilers by using interpretations between theories. There have been many proofs of garbage collection algorithms. Topor [29] gives a proof of the Schorr Waite list marking algorithm. Dijkstra et al. 13] gives a proof of an algorithm that allows ....

....a prototype of the implementation that did not have a garbage collector. Work continues on producing a mechanically checked proof for the compiler with a garbage collector added. Technical Report #83 January 6, 1993 49 (MAX WORD SIZE REQS EXPR ALIST PNAMES HEAP SIZE) NUMBERP WORD SIZE) [17] (VALP (CAR (V C T EXPR ALIST) FETCH (LR ANSWER ADDR) P DATA SEGMENT (P (LOGIC P EXPR ALIST PNAMES HEAP SIZE MAX CTRL MAX TEMP WORD SIZE) LOGIC P CLOCK EXPR ALIST PNAMES HEAP SIZE MAX CTRL MAX TEMP WORD SIZE) P DATA SEGMENT (P (LOGIC P EXPR ALIST PNAMES HEAP SIZE MAX CTRL MAX TEMP ....

[Article contains additional citation context not shown here]

B.H. Levy. An approach to compiler correctness using interpretation between theories. Technical Report 85(8354)-1, Aerospace Corporation, April 1985.

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