volume computation for boolean combination of linear arithmetic     constraints

	volume computation for boolean combination of linear arithmetic constraints
	Ma Feifei; Liu Sheng; Zhang Jian
	2009
会议名称	22nd International Conference on Automated Deduction (CADE-22)
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
会议日期	AUG 02-07,
会议地点	Montreal, CANADA
出版地	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者	AUTOMATED DEDUCTION - CADE-22
ISSN	0302-9743
ISBN	978-3-642-02958-5
部门归属	Ma, Feifei; Liu, Sheng; Zhang, Jian Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100864, Peoples R China.
摘要	There are many works on the satisfiability problem for various logics and constraint languages, such as SAT and Satisfiability Modulo Theories (SMT). On the other hand, the counting version of decision problems is also quite important in automated reasoning. In this paper, we study a counting version of SMT, i.e., how to compute the volume of the solution space, given a set of Boolean combinations of linear constraints. The problem generalizes the model counting problem and the volume computation problem for convex polytopes. It has potential applications to program analysis and verification, as well as approximate reasoning, yet it has received little attention. We first give a straightforward method, and then propose an improved algorithm. We also describe two ways of incorporating theory-level lemma learning technique into the algorithm. They have been implemented, and some experimental results are given. Through an example program, we show that our tool can be used to compute how often a given program path is executed.
关键词	Automation Boolean Functions Formal Logic Learning Algorithms Topology
主办者	McGill Univ, Sch Comp Sci, McGill Univ,Fac Sci, Microsoft Res
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/8316
专题	基础软件与系统重点实验室
推荐引用方式 GB/T 7714	Ma Feifei,Liu Sheng,Zhang Jian. volume computation for boolean combination of linear arithmetic constraints[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:AUTOMATED DEDUCTION - CADE-22,2009.