Please use this identifier to cite or link to this item:
Authors: Birtwistle, G.
Simpson, Todd
Graham, Brian
Keywords: Computer Science
Issue Date: 1-Feb-1992
Abstract: A totally verified system consists of a meaning preserving compiler and hardware which correctly interprets the resulting machine code. This paper describes work in progress towards this goal using MiniSML, a small functional language, and the SECD machine. A functional language is used to ease software proofs, and the SECD machine was chosen as it was the best documented machine when we began this work. This paper outlines a (hand) proof of the correctness of a translator from MiniSML to SECD machine code and a mechanized HOL proof of the hardware which realizes the abstract SECD machine. To achieve a totally verified system, further work is required to mechanize the translator proof and tie it directly to the machine proof, and to recognize the constraints of the machine (i.e., memory capacity) at the software level.
Appears in Collections:Birtwistle, Graham

Files in This Item:
File Description SizeFormat 
1992-466-4.pdf3.39 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.