4 search results - page 1 / 1 » Xs are for Trajectory Evaluation, Booleans are for Theorem P... |
CHARME
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. This paper describes a semantic connection between the symbolic trajectory evaluation model-checking algorithm and relational verification in higher-order logic. We prov...
DAC
1998
ACM
14 years 5 months ago
1998
ACM
We describe the verification of the IM: a large, complex (12,000 gates and 1100 latches) circuit that detects and marks the boundaries between Intel architecture (IA-32) instructi...
TPHOL
1999
IEEE
13 years 9 months ago
1999
IEEE
Combining theorem proving and model checking o ers the tantalizing possibility of e ciently reasoning about large circuits at high levels of abstraction. We have constructed a syst...
DAC
2003
ACM
14 years 5 months ago
2003
ACM
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...