SAT求解器中位向量上所有不同约束的一致性检验

2008 Formal Methods in Computer-Aided Design Pub Date : 2008-11-17 DOI:10.1109/FMCAD.2008.ECP.32

Armin Biere, Robert Brummayer

{"title":"SAT求解器中位向量上所有不同约束的一致性检验","authors":"Armin Biere, Robert Brummayer","doi":"10.1109/FMCAD.2008.ECP.32","DOIUrl":null,"url":null,"abstract":"This paper shows how all different constraints (ADCs) over bit-vectors can be handled within a SAT solver. It also contains encouraging experimental results in applying this technique to encode simple path constraints in bounded model checking. Finally, we present a new compact encoding of equalities and inequalities over bit-vectors in CNF.","PeriodicalId":399042,"journal":{"name":"2008 Formal Methods in Computer-Aided Design","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":"{\"title\":\"Consistency Checking of All Different Constraints over Bit-Vectors within a SAT Solver\",\"authors\":\"Armin Biere, Robert Brummayer\",\"doi\":\"10.1109/FMCAD.2008.ECP.32\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper shows how all different constraints (ADCs) over bit-vectors can be handled within a SAT solver. It also contains encouraging experimental results in applying this technique to encode simple path constraints in bounded model checking. Finally, we present a new compact encoding of equalities and inequalities over bit-vectors in CNF.\",\"PeriodicalId\":399042,\"journal\":{\"name\":\"2008 Formal Methods in Computer-Aided Design\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-11-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"28\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Formal Methods in Computer-Aided Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FMCAD.2008.ECP.32\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Formal Methods in Computer-Aided Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FMCAD.2008.ECP.32","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 28

摘要

本文展示了如何在SAT求解器中处理位向量上的所有不同约束(adc)。它还包含了将该技术应用于有界模型检查中对简单路径约束进行编码的令人鼓舞的实验结果。最后，我们提出了一种新的压缩CNF中位向量上的等式和不等式的编码方法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Consistency Checking of All Different Constraints over Bit-Vectors within a SAT Solver

This paper shows how all different constraints (ADCs) over bit-vectors can be handled within a SAT solver. It also contains encouraging experimental results in applying this technique to encode simple path constraints in bounded model checking. Finally, we present a new compact encoding of equalities and inequalities over bit-vectors in CNF.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2008 Formal Methods in Computer-Aided Design

自引率

0.00%

发文量