Finding Minimal Unsatisfiable Cores of Declarative Specifications

  • Authors:
  • Emina Torlak;Felix Sheng-Ho Chang;Daniel Jackson

  • Affiliations:
  • MIT Computer Science and Artificial Intelligence Laboratory,;MIT Computer Science and Artificial Intelligence Laboratory,;MIT Computer Science and Artificial Intelligence Laboratory,

  • Venue:
  • FM '08 Proceedings of the 15th international symposium on Formal Methods
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 extractionis 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 is described, and proved correct, for a generalized specification language with a regulartranslation 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.