by Ilya Shlyakhter, Robert Seater, Daniel Jackson, Manu Sridharan, Mana Taghdiri
In 18th IEEE International Conference on Automated Software Engineering
http://sdg.lcs.mit.edu/pubs/2003/ucore.ps
Add To MetaCart
Abstract:
Declarative models, in which conjunction and negation are freely used, are susceptible to unintentional overconstraint. Core extraction is a new analysis that mitigates this problem in the context of a checker based on reduction to SAT. It exploits a recently developed facility of SAT solvers that provides an "unsatisfiable core " of an unsatisfiable set of clauses, often much smaller than the clause set as a whole. The unsatisfiable core is mapped back into the syntax of the original model, showing the user fragments of the model found to be irrelevant. This information can be a great help in discovering and localizing overconstraint, and in some cases pinpoints it immediately. The construction of the mapping is given for a generalized modelling language, along with a justification of the soundness of the claim that the marked portions of the model are irrelevant. Experiences in applying core extraction to a variety of existing models are discussed. 1.
Citations
|
927
|
The model checker SPIN
– Holzmann
- 1997
|
|
592
|
Systematic Software Development Using VDM
– Jones
- 1986
|
|
278
|
Planning as satisfiability
– Kautz, Selman
- 1992
|
|
205
|
Protocol verification as a hardware design aid
– Dill, Drexler, et al.
- 1992
|
|
184
|
Iolus: A framework for scalable secure multicasting
– Mittra
- 1997
|
|
174
|
Symbolic model checking using SAT procedures instead of BDDs
– Biere, Cimatti, et al.
- 1999
|
|
121
|
BerkMin: A fast and robust SAT-Solver
– Goldberg, E, et al.
|
|
107
|
NuSMV: a new Symbolic Model Verifier
– Cimatti, Clarke, et al.
- 1999
|
|
82
|
M.: “The Z Notation: A Reference
– Spivey
- 1992
|
|
73
|
Automating first-order relational logic
– Jackson
- 2000
|
|
67
|
A micromodularity mechanism
– Jackson, Shlyakhter, et al.
- 2001
|
|
48
|
Validating SAT Solvers Using an Independent Resolution-Based Checker: Practical Implementations and Other Applications
– Zhang, Malik
- 2003
|
|
33
|
Vacuity detection in temporal model checking
– Kupferman, Vardi
|
|
26
|
Exploring the design of an intentional naming scheme with an automatic constraint analyzer
– Khurshid, Jackson
- 2000
|
|
19
|
Coverage metrics for temporal logic model checking
– Chockler, Kupferman, et al.
- 2001
|
|
18
|
Efficient Detection of Vacuity in Temporal Model Checking
– Beer, Ben-David, et al.
- 2001
|
|
17
|
Verification of proofs of unsatisfiability for CNF formulas
– Goldberg, Novikov
- 2003
|
|
12
|
Enhanced vacuity detection in linear temporal logic
– Vardi, Armoni, et al.
- 2003
|
|
9
|
Exploiting subformula sharing in automatic analysis of quantified formulas
– Shlyakhter, Sridharan, et al.
- 2003
|
|
7
|
Lightweight modelling and automatic analysis of multicast key management schemes
– Taghdiri
- 2002
|
|
2
|
Standard for a High Performance Serial Bus, Standard 1394-1995
– IEEE
- 1996
|
