ACM Home Page
Please provide us with feedback. Feedback
SATORI - A Fast Sequential SAT Engine for Circuits
Full text PdfPdf (163 KB)
Source International Conference on Computer Aided Design archive
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design table of contents
Page: 320  
Year of Publication: 2003
ISBN ~ ISSN:1092-3152 , 1-58113-762-1
Authors
M. K. Iyer  University of California - Santa Barbara
G. Parthasarathy  University of California - Santa Barbara
K.-T. Cheng  University of California - Santa Barbara
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 20,   Citation Count: 12
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: 10.1109/ICCAD.2003.122

ABSTRACT

We describe the design and implementation of SATORI - a fast sequentialjustification engine based on state-of-the-art SAT and ATPG techniques.We present several novel techniques that propel SATORI to ademonstrable 10x improvement over a commercial engine. Traditionalsequential justification based on ATPG or, on a bounded model of thesequential circuit using SAT, has diverging strengths and weaknesses. Inthis paper, we contrast these techniques and describe how their strengthsare combined in SATORI. We use conflict-based learning in each time-frameand illegal state learning across time-frames. This enables bothcombinational and sequential back-jumping. We experimentally analyzethe main features of SATORI by comparing SATORI's performanceagainst a state-of-the-art SAT solver - ZCHAFF using a boundedmodel, and a commercial sequential ATPG engine performing justification.Additional results are presented for SATORI versus the commercialATPG engine and VIS on ISCAS ý89 and ITC'99 benchmark circuitsfor an application to assertion checking.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
[3] M. Abramovici, M. A. Breuer, and A. D. Friedman. Digital Systems Testing and Testable Design. CS Press, 1st ed., 1990.
4
 
5
 
6
 
7
8
 
9
 
10
 
11
 
12
13
 
14
 
15
[15] P. Tafertshofer, A. Ganz, and K. Antreich. IGRAINE - An Implication-Graph based Engine for Fast Implication, Justification and Propagation. IEEE Trans. on Computer-Aided Design, 19(8):907-927, August 2000.
 
16

CITED BY  12

Collaborative Colleagues:
M. K. Iyer: colleagues
G. Parthasarathy: colleagues
K.-T. Cheng: colleagues