A Verified Compiler for a Structured Assembly Language (1991)
| Venue: | In proceedings of the 1991 international workshop on the HOL theorem Proving System and its applications. IEEE Computer |
| Citations: | 6 - 2 self |
BibTeX
@INPROCEEDINGS{Curzon91averified,
author = {Paul Curzon and Paul Curzon},
title = {A Verified Compiler for a Structured Assembly Language},
booktitle = {In proceedings of the 1991 international workshop on the HOL theorem Proving System and its applications. IEEE Computer},
year = {1991},
pages = {253--262},
publisher = {Society Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We describe the verification of a compiler for a subset of the Vista language: a structured assembly language for the Viper microprocessor. This proof has been mechanically checked using the HOL system. We consider how the compiler correctness theorem could be used to deduce safety and liveness properties of compiled code from theorems stating that these properties hold of the source code. We also show how secure compilation can be achieved using automated theorem proving techniques. 1 Introduction In this paper, we describe the verification of a compiler for a subset of the Vista language[10]. Our motivation for verifying the compiler is to allow us to infer properties about the code which is actually executed from properties we prove about Vista programs. Previous work on the formal verification of compilers has largely considered the compiler correctness theorem itself to be the ultimate goal. Consequently, little attention has been given to identifying the way in which the correc...
