2006 Formal Methods in Computer Aided Design 2006
DOI: 10.1109/fmcad.2006.4
|View full text |Cite
|
Sign up to set email alerts
|

Advanced Unbounded Model Checking Based on AIGs, BDD Sweeping, And Quantifier Scheduling

Abstract: In this paper we present a complete method for verifying properties expressed in the temporal logic CTL. In contrast to the majority of verification methods presented in recent years, we support unbounded model checking based on symbolic representations of characteristic functions. Among others, our method is based on an advanced And-Inverter Graph (AIG) implementation, quantifier scheduling, and BDD sweeping. For several examples, our method outperforms BDD based symbolic model checking by orders of magnitude… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
27
0

Year Published

2006
2006
2014
2014

Publication Types

Select...
5
2

Relationship

5
2

Authors

Journals

citations
Cited by 17 publications
(27 citation statements)
references
References 24 publications
0
27
0
Order By: Relevance
“…Sequential equivalence checking has been one of the most challenging tasks in EDA during the last decades [19], [20]. In order to prove functional equivalence of two systems in a worst-case scenario, it is required to generate and compare a complete representation of the state space of both systems, which is known to be exponential with respect to number of memory elements contained in the systems.…”
Section: Verification and Validationmentioning
confidence: 99%
“…Sequential equivalence checking has been one of the most challenging tasks in EDA during the last decades [19], [20]. In order to prove functional equivalence of two systems in a worst-case scenario, it is required to generate and compare a complete representation of the state space of both systems, which is known to be exponential with respect to number of memory elements contained in the systems.…”
Section: Verification and Validationmentioning
confidence: 99%
“…LinAIGs consist of both a boolean and a continuous part. The boolean part of LinAIGs is represented by functionally reduced AndInverter-Graphs (FRAIGs) [17,20], which basically are boolean circuits consisting only of and gates and inverters. In order to represent the continuous part, LinAIGs use a set of boolean constraint variables Q where each linear constraint is encoded by some q l ∈ Q.…”
Section: Model Checking Algorithmmentioning
confidence: 99%
“…As presented in [23] the original AIGSolve would then transform the QBF into an AIG representation and eliminate all quantifiers in a bottom-up fashion by performing cofactoring on AIG cones (similar to the BED-based approach in [1]), compressing the individual results of quantifier elimination by BDD-sweeping [24], functional reduction [20] and DAG-aware rewriting [19] of the AIG structure.…”
Section: Aig-based Solving With Bdd Supportmentioning
confidence: 99%