ISCAS OpenIR  > 基础软件与系统重点实验室
volume computation for boolean combination of linear arithmetic constraints
Ma Feifei; Liu Sheng; Zhang Jian
2009
Conference Name22nd International Conference on Automated Deduction (CADE-22)
SourceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Conference DateAUG 02-07,
Conference PlaceMontreal, CANADA
Publish PlaceHEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
PublisherAUTOMATED DEDUCTION - CADE-22
ISSN0302-9743
ISBN978-3-642-02958-5
DepartmentMa, Feifei; Liu, Sheng; Zhang, Jian Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100864, Peoples R China.
English AbstractThere 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.
KeywordAutomation Boolean Functions Formal Logic Learning Algorithms Topology
SponsorshipMcGill Univ, Sch Comp Sci, McGill Univ,Fac Sci, Microsoft Res
Content Type会议论文
URIhttp://ir.iscas.ac.cn/handle/311060/8316
Collection基础软件与系统重点实验室
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Ma Feifei]'s Articles
[Liu Sheng]'s Articles
[Zhang Jian]'s Articles
Baidu academic
Similar articles in Baidu academic
[Ma Feifei]'s Articles
[Liu Sheng]'s Articles
[Zhang Jian]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Ma Feifei]'s Articles
[Liu Sheng]'s Articles
[Zhang Jian]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.