ICCAD-2003. International Conference on Computer Aided Design (IEEE Cat. No.03CH37486)
DOI: 10.1109/iccad.2003.1257811
|View full text |Cite
|
Sign up to set email alerts
|

Iterative abstraction using SAT-based BMC with proof analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
63
0

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 47 publications
(63 citation statements)
references
References 27 publications
0
63
0
Order By: Relevance
“…In abstraction refinement of model checking [2,3,4,5], the abstract model grows larger after refinement, which potentially prohibits the success of model checking for an enormous state space. The abstraction for next iteration is constructed by identification of an unsatisfiable core to rule out its spurious counterexamples.…”
Section: Introductionmentioning
confidence: 99%
“…In abstraction refinement of model checking [2,3,4,5], the abstract model grows larger after refinement, which potentially prohibits the success of model checking for an enormous state space. The abstraction for next iteration is constructed by identification of an unsatisfiable core to rule out its spurious counterexamples.…”
Section: Introductionmentioning
confidence: 99%
“…An abstract model is then generated for depth i by converting those latches in the given design that are not in the set LR i to pseudo-primary inputs. Due to the sufficiency property of U_Core, the resulting abstract model is guaranteed to preserve correctness of the property up to depth i [9,10]. Depending on locality of the property, the set LR i can be significantly smaller than the total latches in the given design.…”
Section: Proof-based Abstraction (Pba)mentioning
confidence: 99%
“…This procedure simply retraces the resolution-based proof tree used by the SAT solver and identifies a subset formula that is sufficient for unsatisfiability [9,20]. One can then use either a gate-based abstraction [9] or a latch-based abstraction [10] technique to obtain an abstract model from the U_Core. Here we show a latch-based abstraction technique in line 11, to obtain a set of latch reasons LR i at depth i.…”
Section: Proof-based Abstraction (Pba)mentioning
confidence: 99%
See 2 more Smart Citations