Finding Minimal Unsatisfiable Cores of Declarative Specifications
Finding Minimal Unsatisfiable Cores of Declarative Specifications
复制标题
寻找声明性规范的最小不可满足核心
DOI：
--
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
D. Jackson
中科院分区：
文献类型：
--
作者：
Emina Torlak;F. Chang;D. Jackson
声明性的规格表现出各种问题，例如无意间过度约束的公理和不限制的猜想，这些问题很难诊断出模型检查和单独证明的定理。回收核心提取的新覆盖范围分析，该分析指出了声明性规范的不可信的核心。它基于分辨率引擎产生的分辨率反驳证明，例如SAT求解器和分辨率定理掠夺。描述了提取算法并证明正确的是通用规范语言，并具有定期转换对分辨率引擎的输入逻辑。它已针对合金语言实施，并根据各种规格进行了评估，并有令人鼓舞的结果。
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.