Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic (1999)
Cached
Download Links
- [www.cs.cmu.edu]
- [www.ece.cmu.edu]
- [www.ece.cmu.edu]
- [www.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | ACM Transactions on Computational Logic |
| Citations: | 80 - 24 self |
BibTeX
@ARTICLE{Bryant99processorverification,
author = {Randal E. Bryant and Steven German and Miroslav N. Velev},
title = {Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic},
journal = {ACM Transactions on Computational Logic},
year = {1999},
volume = {2},
pages = {37--53}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The logic of equality with uninterpreted functions (EUF) provides a means of abstracting the manipulation of data by a processor when verifying the correctness of its control logic. By reducing formulas in this logic to propositional formulas, we can apply Boolean methods such as Ordered Binary Decision Diagrams (BDDs) and Boolean satisfiability checkers to perform the verification. We can exploit characteristics of the formulas describing the verification conditions to greatly simplify the propositional formulas generated. We identify a class of terms we call "p-terms" for which equality comparisons can only be used in monotonically positive formulas. By applying suitable abstractions to the hardware model, we can express the functionality of data values and instruction addresses flowing through an instruction pipeline with p-terms. A decision procedure can exploit the restricted uses of p-terms by considering only "maximally diverse" interpretations of the associated function symbols...
