LISP and Symbolic Computation

, Volume 8, Issue 1, pp 5–32

VLISP: A verified implementation of Scheme

  • Joshua D. Guttman
  • John D. Ramsdell
  • Mitchell Wand
Article

DOI: 10.1007/BF01128406

Cite this article as:
Guttman, J.D., Ramsdell, J.D. & Wand, M. Lisp and Symbolic Computation (1995) 8: 5. doi:10.1007/BF01128406

Abstract

The VLISP project showed how to produce a comprehensively verified implementation for a programming language, namely Scheme. This paper introduces two more detailed studies on VLISP [13, 21]. It summarizes the basic techniques that were used repeatedly throughout the effort. It presents scientific conclusions about the applicability of the these techniques as well as engineering conclusions about the crucial choices that allowed the verification to succeed.

Keywords

verified programming languages Scheme compiler 

Copyright information

© Kluwer Academic Publishers 1995

Authors and Affiliations

  • Joshua D. Guttman
    • 1
  • John D. Ramsdell
    • 1
  • Mitchell Wand
    • 2
  1. 1.The MITRE CorporationBedford
  2. 2.College of Computer ScienceNortheastern UniversityBoston