Fast illegal state identification for improving SAT-based induction

Proceedings - Design Automation Conference

Volumn , Issue , 2006, Pages 241-246

  Vimjam, Vishnu C ^a   Hsiao, Michael S ^a  

^a State University   (United States)

Author keywords

ATPG; Induction; Learning; SAT

Indexed keywords

COST REDUCTION; FLIP FLOP CIRCUITS; INDUCTANCE; SIGNAL ANALYSIS;

ASSIGNMENT LOOPING; ATPG; ILLEGAL STATES; SAT-BASED INDUCTION RUNS; UNACHIEVABILITY THEORY;

SEQUENTIAL CIRCUITS;

EID: 34547140905     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1146909.1146972     Document Type: Conference Paper

References (23)

1. E. M. Clarke, O. Grumberg and D. A. Peled, "Model Cheeking". The MIT Press, 2000.
2. K. McMillan, "Symbolic Model Checking: An Approach to the State Explosion Problem". Kluwer Academic Publishers, 1993.
3. A. Biere, A. Cimatti, E. Clarke and Y. Zhu, "Symbolic Model Checking without BDDs". Proc of Conf. on TACAS, 1999.
4. D. Deharbe and A. M. Moreira, "Using Induction and BDDs to Model Check Invariants". Proc of Conf. on CHARME, 1997.
5. C. A. J. van Eijk, "Sequential Equivalence Checking without State-Space Traversal". Proc of DATE, 1998.
6. M. Sheeran, S. Singh and G. Stalmarck, "Checking Safety Properties using Induction and a SAT Solver". Proc of Conf. on FMCAD, Nov 2000.
7. P. Bjesse and K. Claessen, "SAT-based Verification without State-Space Traversal". Proc of Conf. on FMCAD, 2000.
8. R. Armoni, L. Fix, R. Fraer, S. Huddleston, N. Piterman and M. Y. Vardi, "SAT-based Induction for Temporal Safety Properties". Proc of BMC, 2004.
9. L. de Moura, H. Rueß and M. Sorea, "Bounded Model Checking and Induction: From Refutation to Verification". Proc. of Conf. on CAV, 2003.
10. O. Strichman, "Accelerating Bounded Model Checking of Safety Properties", In Formal Methods in System Design, vol 24, pp. 5-24, Jan 2004.
11. N. Een and N. Sorensson, "Temporal Induction by Incremental SAT Solving". Proc of BMC, July 2003.
12. L. Zhang, M. R. Prasad and M. S. Hsiao, "Incremental Deductive & Inductive Reasoning for SAT-based Bounded Model Checking". Proc of ICCAD, pp. 502-509, 2004.
13. P. Goel, "An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits". IEEE Trans. on Comp., vol. C-30, pp. 215-222, March 1981.
14. S. Sheng and M. S. Hsiao, "Efficient Preimage Computation Using a Novel Success-Driven ATPG". Proc of DATE, pp. 822-827, 2003.
15. H. Goldstein and E. L. Thigpen, "Scoap: Sandia Controllability/ Observability analysis program". Proc of DAC, 1980.
16. In-Ho Moon, G. Hatchel and F. Somenzi, "Border-block Triangular Form and Conjunction Schedule in Image Computation". Proc of Conf. on FMCAD, Nov 2000.
17. R. Arora and M. S. Hsiao, "Enhancing SAT-based Bounded Model Checking using Sequential Logic Implications". Proc of VLSI Design Conf, pp. 784-787, Jan 2004.
18. J. Zhao, M. Rudnick and J. Patel, "Static Logic Implication with Application to Fast Redundancy Identification". Proc of VTS Symp., 1997.
19. M. Davis and H. Putnam, "A Computing Procedure for Quantification Theory". ACM Journal, vol 7, pp.201-215, 1960.
20. S. Subbarayan and D.K. Pradhan, "NiVER: Non-Increasing Variable Elimination Resolution for preprocessing SAT instances". Proc of Conf. on SAT, May 2004.
21. E. Goldberg and Y. Novikov, "BerkMin: a Fast and Robust SAT-Solver". Proc. of DATE, pp. 142-149, 2002.
22. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang and S. Malik, "Chaff: Engineering an Efficient SAT-Solver". Proc of DAC, 2001.
23. Website: http://www.princeton.edu/chaff/zchaff.html