一种用于有效模型检查的自动SAT编码验证方法

2010 International Conference on Microelectronics Pub Date : 2010-12-01 DOI:10.1109/ICM.2010.5696177

Khaza Anuarul Hoque, O. Mohamed, Sa'ed Abed, M. Boukadoum

{"title":"一种用于有效模型检查的自动SAT编码验证方法","authors":"Khaza Anuarul Hoque, O. Mohamed, Sa'ed Abed, M. Boukadoum","doi":"10.1109/ICM.2010.5696177","DOIUrl":null,"url":null,"abstract":"In this paper, we introduce an automated conversion-verification methodology to convert a Directed Formula (DF) into a Conjunctive Normal Form (CNF) formula that can be fed to a SAT solver. In addition, the formal verification of this conversion is conducted within the HOL theorem prover. Finally, we conduct experimental results with different-sized formulas to show the effectiveness of our methodology.","PeriodicalId":215859,"journal":{"name":"2010 International Conference on Microelectronics","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An automated SAT encoding-verification approach for efficient model checking\",\"authors\":\"Khaza Anuarul Hoque, O. Mohamed, Sa'ed Abed, M. Boukadoum\",\"doi\":\"10.1109/ICM.2010.5696177\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we introduce an automated conversion-verification methodology to convert a Directed Formula (DF) into a Conjunctive Normal Form (CNF) formula that can be fed to a SAT solver. In addition, the formal verification of this conversion is conducted within the HOL theorem prover. Finally, we conduct experimental results with different-sized formulas to show the effectiveness of our methodology.\",\"PeriodicalId\":215859,\"journal\":{\"name\":\"2010 International Conference on Microelectronics\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Microelectronics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICM.2010.5696177\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Microelectronics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICM.2010.5696177","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

在本文中，我们介绍了一种自动转换验证方法，将有向公式(DF)转换为可馈送到SAT求解器的合取范式(CNF)公式。此外，这种转换的形式化验证是在HOL定理证明器中进行的。最后，我们用不同大小的公式进行了实验结果，以证明我们的方法的有效性。

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

查看原文本刊更多论文

An automated SAT encoding-verification approach for efficient model checking

In this paper, we introduce an automated conversion-verification methodology to convert a Directed Formula (DF) into a Conjunctive Normal Form (CNF) formula that can be fed to a SAT solver. In addition, the formal verification of this conversion is conducted within the HOL theorem prover. Finally, we conduct experimental results with different-sized formulas to show the effectiveness of our methodology.

求助全文

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

来源期刊

2010 International Conference on Microelectronics

自引率

0.00%

发文量