Interpolation and SAT-Based Model Checking

Interpolation and SAT-Based Model Checking

We consider a fully SAT-based method of unbounded symbolic model checking based on computing Craig interpolants. In benchmark studies using a set of large industrial circuit verification instances, this method is greatly more efficient than BDD-based symbolic model checking, and compares favorably t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: McMillan, K. L.
Format: Buchkapitel
Sprache:eng
Schlagworte:
Applied sciences
Boolean Formula
Bound Model Check
Computer science
control theory
systems
Conjunctive Normal Form
Exact sciences and technology
Logical, boolean and switching functions
Model Check
Symbolic Model Check
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider a fully SAT-based method of unbounded symbolic model checking based on computing Craig interpolants. In benchmark studies using a set of large industrial circuit verification instances, this method is greatly more efficient than BDD-based symbolic model checking, and compares favorably to some recent SAT-based model checking methods on positive instances.
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-45069-6_1