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...

Full description

Saved in:
Bibliographic Details
Published in:International Conference on Computer Aided Design: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design; 09-13 Nov. 2003 p. 416
Main Authors: Gupta, Aarti, Ganai, Malay, Yang, Zijiang, Ashar, Pranav
Format: Conference Proceeding
Language:English
Published: Washington, DC, USA IEEE Computer Society 09.11.2003
Series:ACM Conferences
Subjects:
Theory of computation > Logic
Theory of computation > Logic > Type theory
Theory of computation > Randomness, geometry and discrete structures
ISBN:9781581137620, 1581137621
ISSN:1092-3152
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:9781581137620
1581137621
ISSN:1092-3152
DOI:10.5555/996070.1009924