DMCA
Validity Checking for Combinations of Theories with Equality (1996)
Cached
Download Links
- [agamemnon.Stanford.EDU]
- [www.cs.nyu.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 162 - 29 self |
BibTeX
@INPROCEEDINGS{Barrett96validitychecking,
author = {Clark Barrett and David Dill and Jeremy Levitt},
title = {Validity Checking for Combinations of Theories with Equality},
booktitle = {},
year = {1996},
pages = {187--201},
publisher = {Springer-Verlag}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
. An essential component in many verification methods is a fast decision procedure for validating logical expressions. This paper presents the algorithm used in the Stanford Validity Checker (SVC) which has been used to aid several realistic hardware verification efforts. The logic for this decision procedure includes Boolean and uninterpreted functions and linear arithmetic. We have also successfully incorporated other interpreted functions, such as array operations and linear inequalities. The primary techniques which allow a complete and efficient implementation are expression sharing, heuristic rewriting, and congruence closure with interpreted functions. We discuss these techniques and present the results of initial experiments in which SVC is used as a decision procedure in PVS, resulting in dramatic speed-ups. 1 Introduction Decision procedures are emerging as a central component of formal verification systems. Such a procedure can be included as a component of a general-purpos...
Keyphrases
validity checking decision procedure interpreted function efficient implementation linear inequality stanford validity checker initial experiment fast decision procedure uninterpreted function heuristic rewriting array operation several realistic hardware verification effort congruence closure formal verification system essential component many verification method dramatic speed-ups introduction decision procedure primary technique expression sharing central component logical expression
