The Veriied Compilation of Vista Programs

We describe the formal machine-checked veriication of a simple compiler speciication using the HOL theorem proving system. The language and microprocessor considered are a subset of the structured assembly language Vista, and the VIPER microprocessor, respectively. Our work is directly applicable to a family of languages and compilers. We discuss how the correctness theorem and veriied compiler t into a wider context of ensuring that object code is correct. We show how the compiler correctness result can be formally combined with a proof system for application programs. We have implemented a tool that executes the veriied compiler speciication using formal proof. We also suggest a way that a dependable implementation might be obtained.