A Succinct and Efficient Implementation of a 2^32 BDD Package

Guanfeng Lv, Yao Chen, Yachao Feng, Qingliang Chen, Kaile Su
{"title":"A Succinct and Efficient Implementation of a 2^32 BDD Package","authors":"Guanfeng Lv, Yao Chen, Yachao Feng, Qingliang Chen, Kaile Su","doi":"10.1109/TASE.2012.22","DOIUrl":null,"url":null,"abstract":"As a data structure for representing and manipulating Boolean functions, BDDs (Binary Decision Diagrams) are commonly used in many fields such as model-checking, system verification and so on. For saving space and improving operation speed, all the existing packages limit the number of variables to 216. However, such a limitation also restrains its applicability. In this paper, we present TiniBDD, an efficient implementation of a 232 BDD package incorporating sub-allocation of memory and lightweight Garbage Collection as well as a new operator named as Satisfiable Assignment Operator. Compared with the well-known CUDD which is one of the best 216 BDD packages that can be attained publicly, the experiments show TiniBDD has comparable performance.","PeriodicalId":417979,"journal":{"name":"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering","volume":"536 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TASE.2012.22","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

As a data structure for representing and manipulating Boolean functions, BDDs (Binary Decision Diagrams) are commonly used in many fields such as model-checking, system verification and so on. For saving space and improving operation speed, all the existing packages limit the number of variables to 216. However, such a limitation also restrains its applicability. In this paper, we present TiniBDD, an efficient implementation of a 232 BDD package incorporating sub-allocation of memory and lightweight Garbage Collection as well as a new operator named as Satisfiable Assignment Operator. Compared with the well-known CUDD which is one of the best 216 BDD packages that can be attained publicly, the experiments show TiniBDD has comparable performance.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
2^32 BDD封装的简洁高效实现
二进制决策图(Binary Decision Diagrams, bdd)作为一种表示和操作布尔函数的数据结构,广泛应用于模型检查、系统验证等领域。为了节省空间和提高运行速度,所有现有的包都将变量的数量限制在216个。然而,这种局限性也限制了其适用性。在本文中,我们提出了TiniBDD,一个232 BDD包的有效实现,包含内存子分配和轻量级垃圾收集以及一个名为可满足赋值操作符的新操作符。实验结果表明,TiniBDD与目前已知的216个最佳BDD包之一CUDD具有相当的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Executing Model Checking Counterexamples in Simulink The Observer Pattern Applied to Actor Systems: A TLA/TLC-based Implementation Analysis A Succinct and Efficient Implementation of a 2^32 BDD Package File Parsing Vulnerability Detection with Symbolic Execution A Logic for Accumulated-Weight Reasoning on Multiweighted Modal Automata
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1