Monotonicity Inference for Higher-Order Formulas
Monotonicity Inference for Higher-Order Formulas
复制标题
高阶公式的单调性推断
DOI:
10.1007/s10817-011-9234-1
复制
发表时间:
2011
期刊:
影响因子:
--
通讯作者:
Alexander Krauss
中科院分区:
文献类型:
--
作者:
Jasmin Christian Blanchette;Alexander Krauss
Formulas are often monotonic in the sense that satisfiability for a given domain of discourse entails satisfiability for all larger domains. Monotonicity is undecidable in general, but we devised three calculi that infer it in many cases for higher-order logic. The third calculus has been implemented in Isabelle’s model finder Nitpick, where it is used both to prune the search space and to soundly interpret infinite types with finite sets, leading to dramatic speed and precision improvements.
登录
查看更多内容
DOI:
--
发表时间:
2005
期刊:
ESEC/FSE-13
影响因子:
--
作者:
Viktor Kunčak;D. Jackson
通讯作者:
D. Jackson
影响因子:
2
作者:
T. Nipkow
通讯作者:
T. Nipkow
DOI:
10.1007/978-3-642-22438-6_17
发表时间:
2011
期刊:
ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005.
影响因子:
--
作者:
Koen Claessen;A. Lillieström;Nicholas Smallbone
通讯作者:
Nicholas Smallbone
DOI:
--
发表时间:
2001
期刊:
ESEC/FSE-9
影响因子:
--
作者:
D. Jackson;I. Shlyakhter;Manu Sridharan
通讯作者:
Manu Sridharan
DOI:
--
发表时间:
2005
期刊:
International Workshop Automated Verification Critical Systems
影响因子:
--
作者:
L. Momtahan
通讯作者:
L. Momtahan