Automated Correctness Proofs of Machine Code Programs for a Commercial Microprocessor (1991)
Cached
Download Links
- [ftp.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 31 - 2 self |
BibTeX
@MISC{Boyer91automatedcorrectness,
author = {Robert S. Boyer and Yuan Yu},
title = {Automated Correctness Proofs of Machine Code Programs for a Commercial Microprocessor},
year = {1991}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We have formally specified a substantial subset of the MC68020, a widely used microprocessor built by Motorola, within the mathematical logic of the automated reasoning system Nqthm, i.e., the Boyer-Moore Theorem Prover [4]. Using this MC68020 specification, we have mechanically checked the correctness of MC68020 machine code programs for Euclid's GCD, Hoare's Quick Sort, binary search, and other well-known algorithms. The machine code for these examples was generated using the Gnu C and the Verdix Ada compilers. We have developed an extensive library of proven lemmas to facilitate automated reasoning about machine code programs. We describe a two stage methodology we use to do our machine code proofs.
