Automated proofs of object code for a widely used microprocessor (1996) [69 citations — 3 self]
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@ARTICLE{Boyer96automatedproofs,author = {Robert S. Boyer and Yuan Yu},
title = {Automated proofs of object code for a widely used microprocessor},
journal = {Journal of the ACM},
year = {1996},
volume = {43},
pages = {166--192}
}
Years of Citing Articles
Abstract:
Abstract. We have formally described a substantial subset of the MC68020, a widely used microprocessor built by Motorola, within the mathematical logic of the automated reasoning system Nqthm, a.k.a. the Boyer-Moore Theorem Prover [6]. Using this formal description, we have mechanically checked the correctness of MC68020 object code programs for binary search, Hoare's Quick Sort, twenty-one functions from the Berkeley Unix C string library, and other well-known algorithms. The object code for these examples was generated using the Gnu C, the Verdix Ada, and the Gnu Common Lisp compilers. We have mechanized a mathematical theory to facilitate automated reasoning about object code programs. We describe a two stage methodology we use to do our proofs. Key words. Automated reasoning, Boyer-Moore logic, Nqthm, formal methods, machine code, program verification, C, Ada, Common Lisp. 1
