VLISP A Verified Implementation of Scheme : A Special Issue of Lisp and Symbolic Computation, An International Journal Vol. 8, Nos. 1 & 2 March 1995

Joshua D. Guttman

ISBN 10: 0792395662 / ISBN 13: 9780792395669

Published by Springer, Berlin, Springer US, Springer, 1995

About this Item

Neuware - The VLISP project showed how to produce a comprehensively verified implemen tation for a programming language, namely Scheme [4, 15). Some of the major elements in this verification were: - The proof was based on the Clinger-Rees denotational semantics of Scheme given in [15). Our goal was to produce a 'warts-and-all' verification of a real language. With very few exceptions, we constrained ourselves to use the se mantic specification as published. The verification was intended to be rigorous, but. not. complet.ely formal, much in the style of ordinary mathematical discourse. Our goal was to verify the algorithms and data types used in the implementat.ion, not their embodiment. in code. See Section 2 for a more complete discussion ofthese issues. Our decision to be faithful to the published semantic specification led to the most difficult portions ofthe proofs; these are discussed in [13, Section 2.3-2.4). - Our implementation was based on the Scheme48 implementation of Kelsey and Rees [17). This implementation t.ranslates Scheme into an intermediate-level 'byte code' language, which is interpreted by a virtual machine. The virtual machine is written in a subset of Scheme called PreScheme. The implementationissufficient.ly complete and efficient to allow it to bootstrap itself. We believe that this is the first. verified language implementation with these properties.

Seller Inventory # 9780792395669

Bibliographic Details

• Title: VLISP A Verified Implementation of Scheme : A Special Issue of Lisp and Symbolic Computation, An International Journal Vol. 8, Nos. 1 & 2 March 1995
• Publisher: Springer, Berlin, Springer US, Springer
• Publication Date: 1995
• Language: English
• ISBN 10: 0792395662
• ISBN 13: 9780792395669
• Binding: Buch
• Condition: Neu
• Dimensions: 254W x 178H x 12D millimeters 254 millimeters width by 178 millimeters height by 12 millimeters depth
• Weight: 1220 grams

About this title

Synopsis

The VLISP project showed how to produce a comprehensively verified implemen­ tation for a programming language, namely Scheme [4, 15). Some of the major elements in this verification were: • The proof was based on the Clinger-Rees denotational semantics of Scheme given in [15). Our goal was to produce a "warts-and-all" verification of a real language. With very few exceptions, we constrained ourselves to use the se­ mantic specification as published. The verification was intended to be rigorous, but. not. complet.ely formal, much in the style of ordinary mathematical discourse. Our goal was to verify the algorithms and data types used in the implementat.ion, not their embodiment. in code. See Section 2 for a more complete discussion ofthese issues. Our decision to be faithful to the published semantic specification led to the most difficult portions ofthe proofs; these are discussed in [13, Section 2.3-2.4). • Our implementation was based on the Scheme48 implementation of Kelsey and Rees [17). This implementation t.ranslates Scheme into an intermediate-level "byte code" language, which is interpreted by a virtual machine. The virtual machine is written in a subset of Scheme called PreScheme. The implementationissufficient.ly complete and efficient to allow it to bootstrap itself. We believe that this is the first. verified language implementation with these properties.

Synopsis

The VLISP project undertook to provide a rigorous verification of a programming language. The project began at the MITRE Corporation in late 1989 under the company's technology program. The work was supervised by the Rome Laboratory of the US Air Force. Northeastern University became involved a year later. The aim was to show realism and comprehensiveness. Realism is revealed in the choice of a widely used programming language, SCHEME, and the choice of a flexible and reasonably efficient implementation strategy. Comprehensiveness is revealed in the broad range of steps undertaken in verification, leading from the abstract syntax of a high-level programming language, equipped with a continuation style, denotational semantics, down to an abstract assembly language equipped with a concrete operational semantics. The editors of VLISP have extracted reusable conclusions from the work at two, quite different levels. First, general approaches to the organization of the work have been found which are beneficial and which can be recommended. They help to make formal methods more pragmatically effective.

Second, there are four main verification techniques that are applied in the proof process. This relatively small collection of techniques, none of them particularly arcane, allow a large verification to be undertaken. The identification of such reusable parts bodes well for the increased use of formal methods in compiler construction.