Loading…
A Completely Verified Realistic Bootstrap Compiler
This paper reports on a large verification effort in constructing an initial fully trusted bootstrap compiler executable for a realistic system programming language and real target processor. The construction and verification process comprises three tasks: the verification of the compiling specifica...
Saved in:
Published in: | International journal of foundations of computer science 2003-08, Vol.14 (4), p.659-680 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | This paper reports on a large verification effort in constructing
an initial fully trusted bootstrap compiler executable for a
realistic system programming language and real target processor.
The construction and verification process comprises three tasks: the
verification of the compiling specification (a relation between
abstract source and target programs) with respect to the language
semantics and a realistic correctness criterion. This proof has been
completely mechanized using the PVS verification system and is one
of the largest case-studies in formal verification we are aware of.
Second, the implementation of the specification in the high-level
source language following a transformational approach, and finally,
the implementation and verification of a binary executable written
in the compiler's target language. For the latter task, a realistic
technique has been developed, which is based on rigorous a-posteriori
syntactic code inspection and which guarantees, for the first time,
trusted execution of generated machine programs. The context of this
work is the joint German research effort Verifix aiming at
developing methods for the construction of correct compilers for
realistic source languages and real target processors. |
---|---|
ISSN: | 0129-0541 1793-6373 |
DOI: | 10.1142/S0129054103001947 |