J.D. Guttman, J.D. Ramsdel, and V. Swarup. The VLISP verified Scheme system. Lisp and Symbolic Computation, 8(1/2):33--110, March 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... research was done as part of the ESPRIT project SACRES and was supported in part by the Minerva Foundation and an infra structure grant from the Israeli Ministry of Science and Art Preliminary versions of some parts of this paper were published before in [17] 19] and [20] for example, [5, 9, 10, 15, 12, 11, 14, 13]) the formal verification of industrial code generators is generally prohibitive due to their size. Another problem with compiler verification is that the formal verification freezes the design and evolution of the compiler, as each change to the code generators nullifies their previous ....

J.D. Guttman, J.D. Ramsdell, and V. Swarup. The VLISP verified Scheme system. Lisp and Symbolic Computation, 8:33--100, 1995.

....at CLInc [BHY87] on the verified stack we put emphasis on consistent interfaces to higher and lower levels of abstraction, building a tower of abstraction levels from requirements capture down to implementation in hardware. The recent impressive work on VLisp, a verified translator for Scheme, GRS95, GRW95, ORW95] heads for an understanding of Scheme compilation. Their final abstract machine is rather close to actual hardware given the abstractness of the source language Scheme but is still more abstract than commercially available processors. They propose to use an operational style of ....

J. D. Guttman, J. D. Ramsdell and V. Swarup. The VLISP verified scheme system. Lisp and Symbolic Computation, 8 (1995) 33--110.

....the appropriate formal mathematical basis (e.g. fixed point theory) 85] 3.4. 5 Verified Scheme Based on the Clinger Rees denotational semantics of Scheme[86] and the Scheme48 compiler[87] a group at Mitre and Northeastern University have produced a verified compiler for Scheme, called VLISP[88, 89, 90]. The VLISP implementation consists of three elements: 1. a simple compiler from Scheme to an intermediate level byte code language; 2. an interpreter for this byte code language written in a subset of Scheme called PreScheme; and 3. a compiler for PreScheme to the assembly language of the target ....

Joshua D. Guttman, John D. Ramsdell, and Vipin Swarup. The VLISP verified scheme system. LISP and Symbolic Computation, 8:33--110, 1995.

....under computation is probably much older. It was used for program equivalence in [MT91, WO92, ORW95] Sta94] uses a similar notion extended to become a logical relation. Assignment elimination was introduced in the Orbit compiler [KKsR 86] and used in [KH89, CH94] It was omitted from [GSR95] because the authors were unable to prove its correctness [Ram96] 3 An Operationally Based Term Model 3.1 Syntax Values in the model are equivalence classes of terms in an extended calculus that we call the metalanguage. The types in the metalanguage, ranged over by , are potentially ....

J. D. Guttman, V. Swarup, and J. Ramsdell. The VLISP verified scheme system. Lisp and Symbolic Computation, 8(1/2):33--110, 1995.

....here. There is a large literature on proofs of interpreters based on abstract machines, such as Landin s SECD machine [12,22,25] Since no compiled machine code is involved, unloading such abstract machines is easier than unloading an abstract machine based on compiled code. The VLISP project [11], using denotational semantics as a metalanguage, is the most ambitious verification to date of a compiler based abstract machine. Other work on compilers deploys metalanguages such as calculi of explicit substitutions [13] or process calculi [28] Rather than introduce a metalanguage, we prove ....

J.D. Guttman, V. Swarup and J. Ramsdell. The VLISP verified scheme system. Lisp and Symbolic Computation, 8(1/2):33--110, 1995.

....relations for proving the correctness of compilation to low level languages. This set the stage for VLISP, the first large scale compiler verification project that combined denotational and operational semantics approaches to prove the correctness of a compiler from a dialect of Scheme to bytecode [18, 17, 37, 38]. Other researchers have tackled the problem of compiler correctness by exploring techniques to derive compilers directly from the language semantics. The first attempts were to translate denotation semantics directly to terms which are then executed by an abstract machine [1, 30, 40, 49] The ....

Guttman, J. D., Ramsdell, J. D., and Swarup, V. The VLISP verified Scheme system. Lisp and Symbolic Computation, 8 (1995), 33--110.

.... using these techniques: a simple functional language [35, 34] a language with while expressions [36] a language obeying stack discipline [38] and core Scheme [12] More recently, this technique has been used for two large proofs: one for a very detailed proof of a complete Scheme system [21], and one for a detailed proof of a compiler for PreScheme, a Scheme like language designed for systems programming [29] There has been some work on compiler correctness for languages with concurrency. The Procos project, using techniques of Hoare, Jifeng, and Bowen, has been developing a ....

J. D. Guttman, V. Swarup, and J. Ramsdell. The VLISP Verified Scheme System. Lisp and Symbolic Computation, 8(1/2), 1995. to appear.

.... language [28, 27] a language with while expressions [29] a language obeying stack discipline and having nonlocal jumps [31] and core Scheme [9] Two largerscale systems have also been proven correct in great detail using these techniques: A complete implementation of Scheme is proven correct in [15], and a compiler for PreScheme, a Scheme like language designed for systems programming, is proven correct in [21] As discussed in [30] the literature contains a great deal of work on the mathematical and algebraic properties of models of concurrent computation, but very little about compiler ....

J. D. Guttman, V. Swarup, and J. Ramsdell. The VLISP verified scheme system. Lisp and Symbolic Computation, 8(1/2), 1995.

....involves an induction hypothesis for each non terminal of the source language. The reasoning involves higher order equational reasoning in a suitable theory plus the use of the induction hypotheses. A number of small to moderate sized compiler correctness proofs have been done in this way [5, 7, 14, 19, 18, 20, 22]. As proofs of congruence and soundness scale up, machine support becomes more and more important. Ideally, one would like all the simple cases to be checked by machine, perhaps leaving a few subtle cases to be done by hand. We have now built a theorem prover capable of proving many such theorems. ....

J. D. Guttman, V. Swarup, and J. Ramsdell. The VLISP Verified Scheme System. Lisp and Symbolic Computation, 8(1/2), 1995. to appear.

.... C(f(j) for all j. This notion of 1 That is, a nite or in nite sequence C of states such that C(0) is an initial state, and for every j where C(j 1) #, there is an operation h such that C(j 1) h(C(j) 6 re nement is closely connected with the storage layout relations used in vlisp [6, 5]. The re nement theorems are divided into safety theorems and liveness theorems. Suppose rst that g is one of the speci ed operations, with parameters xed, and h is the implementation version of that operation. Then the safety condition states that h( i ) # ) abstr(h( i ) g(abstr( i ) ....

Joshua D. Guttman, John D. Ramsdell, and Vipin Swarup. The VLISP veried Scheme system. Lisp and Symbolic Computation, 8(1/2):33-110, 1995.

....with a small amount of additional funding. The specifications and proofs total about 600 pages of technical reports. The final implementation, as used in the bootstrap process, consists of about 10,000 lines of Scheme and 166 lines of C. The techniques used in the proofs are described in detail in [13, 21]. In this paper, we discuss those aspects of the project that go beyond the individual proofs. In Section 2, we discuss the crucial choices that allowed the verification to succeed, and especially the degree of rigor we have aimed for. In Section 3, we discuss the implementation in more detail and ....

....in different portions of the verification. We consider this a lucky outcome, as we think that these techniques can be made routine and applied in a variety of projects. In this section we will summarize the main techniques used in the project. More detailed descriptions are spread out in [13, 21]. They play specific roles in the architecture that we have developed. The VLISP Architecture. The vlisp Scheme and PreScheme implementations share a common structure. Each may be divided into three main sections: 1. A stage of source to source transformations. In the vlisp Scheme implementation ....

[Article contains additional citation context not shown here]

Joshua D. Guttman, Vipin Swarup, and John D. Ramsdell. The VLISP verified Scheme system. Lisp and Symbolic Computation, 8(1/2):???--???, 1995.

No context found.

J.D. Guttman, J.D. Ramsdel, and V. Swarup. The VLISP verified Scheme system. Lisp and Symbolic Computation, 8(1/2):33--110, March 1995.

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