Iterative Abstraction using SAT-based BMC with Proof Analysis
Resolution-based proof analysis techniques have been proposedrecently to identify a sufficient set of reasons for unsatisfiabilityderived by a CNF-based SAT solver. We have adapted thesetechniques to work with a hybrid SAT solver. We use the proofanalysis technique with SAT-based BMC, in order to ge...
Uloženo v:
| Vydáno v: | International Conference on Computer Aided Design: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design; 09-13 Nov. 2003 s. 416 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
Washington, DC, USA
IEEE Computer Society
09.11.2003
|
| Edice: | ACM Conferences |
| Témata: | |
| ISBN: | 9781581137620, 1581137621 |
| ISSN: | 1092-3152 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | Resolution-based proof analysis techniques have been proposedrecently to identify a sufficient set of reasons for unsatisfiabilityderived by a CNF-based SAT solver. We have adapted thesetechniques to work with a hybrid SAT solver. We use the proofanalysis technique with SAT-based BMC, in order to generateuseful abstract models. Our abstraction procedure is usediteratively in a top-down framework, starting from the concretedesign, where we apply BMC on increasingly more abstractmodels. We apply various SAT-based and BDD-basedverification methods on these abstract models, in order to obtainproofs of correctness, or to perform deeper searches forcounterexamples. We demonstrate the effectiveness of ourprototype implementation on several large industry designs. |
|---|---|
| Bibliografie: | SourceType-Conference Papers & Proceedings-1 ObjectType-Conference Paper-1 content type line 25 |
| ISBN: | 9781581137620 1581137621 |
| ISSN: | 1092-3152 |
| DOI: | 10.5555/996070.1009924 |