Abstract conflict driven learning
Abstract conflict driven learning
复制标题
抽象冲突驱动学习
DOI:
10.1145/2429069.2429087
复制
发表时间:
2013
期刊:
影响因子:
--
通讯作者:
D'Silva V
中科院分区:
文献类型:
--
作者:
D'Silva V
Modern satisfiability solvers implement an algorithm, called Conflict Driven Clause Learning, which combines search for a model with analysis of conflicts. We show that this algorithm can be generalised to solve the lattice-theoretic problem of determining if an additive transformer on a Boolean lattice is always bottom. Our generalised procedure combines overapproximations of greatest fixed points with underapproximation of least fixed points to obtain more precise results than computing fixed points in isolation. We generalise implication graphs used in satisfiability solvers to derive underapproximate transformers from overapproximate ones. Our generalisation provides a new method for static analysers that operate over non-distributive lattices to reason about properties that require disjunction.
登录
查看更多内容
DOI:
10.1145/1275497.1275501
发表时间:
2007-08
期刊:
ACM Trans. Program. Lang. Syst.
影响因子:
--
作者:
Xavier Rival;Laurent Mauborgne
通讯作者:
Xavier Rival;Laurent Mauborgne
DOI:
--
发表时间:
1998
期刊:
Formal Methods Syst. Des.
影响因子:
--
作者:
T. Henzinger;O. Kupferman;S. Qadeer
通讯作者:
S. Qadeer
影响因子:
1
作者:
Bahareh Badban;J. Pol;O. Tveretina;H. Zantema
通讯作者:
H. Zantema
DOI:
10.1007/978-3-642-33125-1_23
发表时间:
2012
期刊:
Artif. Intell.
影响因子:
--
作者:
Aditya V. Thakur;T. Reps
通讯作者:
T. Reps
DOI:
--
发表时间:
2010
期刊:
International Conference on Formal Modeling and Analysis of Timed Systems
影响因子:
--
作者:
Scott Cotton
通讯作者:
Scott Cotton