中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 计算机科学国家重点实验室  > 会议论文
题名:
volume computation for boolean combination of linear arithmetic constraints
作者: Ma Feifei ; Liu Sheng ; Zhang Jian
会议文集: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
会议名称: 22nd International Conference on Automated Deduction (CADE-22)
会议日期: AUG 02-07,
出版日期: 2009
会议地点: Montreal, CANADA
关键词: Automation ; Boolean functions ; Formal logic ; Learning algorithms ; Topology
出版者: AUTOMATED DEDUCTION - CADE-22
出版地: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
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.
主办者: McGill Univ, Sch Comp Sci, McGill Univ,Fac Sci, Microsoft Res
英文摘要: 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.
内容类型: 会议论文
URI标识: http://ir.iscas.ac.cn/handle/311060/8316
Appears in Collections:计算机科学国家重点实验室 _会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Ma Feifei,Liu Sheng,Zhang Jian. volume computation for boolean combination of linear arithmetic constraints[C]. 见:22nd International Conference on Automated Deduction (CADE-22). Montreal, CANADA. AUG 02-07,.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Ma Feifei]'s Articles
[Liu Sheng]'s Articles
[Zhang Jian]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Ma Feifei]‘s Articles
[Liu Sheng]‘s Articles
[Zhang Jian]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

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

 

 

Valid XHTML 1.0!
Copyright © 2007-2017  中国科学院软件研究所 - Feedback
Powered by CSpace