Finding Minimal Unsatisfiable Cores of Declarative Specifications [chapter]

Emina Torlak, Felix Sheng-Ho Chang, Daniel Jackson
Lecture Notes in Computer Science  
Declarative specifications exhibit a variety of problems, such as inadvertently overconstrained axioms and underconstrained conjectures, that are hard to diagnose with model checking and theorem proving alone. Recycling core extraction is a new coverage analysis that pinpoints an irreducible unsatisfiable core of a declarative specification. It is based on resolution refutation proofs generated by resolution engines, such as SAT solvers and resolution theorem provers. The extraction algorithm
more » ... raction algorithm is described, and proved correct, for a generalized specification language with a regular translation to the input logic of a resolution engine. It has been implemented for the Alloy language and evaluated on a variety of specifications, with promising results.
doi:10.1007/978-3-540-68237-0_23 dblp:conf/fm/TorlakCJ08 fatcat:sd2ygoavjfcg3oixynvdepe7gq