Efficient reachability checking using sequential SAT

Reachability checking and preimage computation are fundamental problems in ATPG and formal verification. Traditional sequential search techniques based on ATPG/SAT, or on OBDDS have diverging strengths and weaknesses. Here, we describe how structural analysis and conflict-based learning are combined in order to improve the efficiency of sequential search. We use conflict-based learning and illegal state learning across time-frames. We also address issues in efficiently bounding the search space in a single time-frame and across time-frames. We analyze each of these techniques experimentally and demonstrate the advantages of each technique. We compare performance against a commercial sequential ATPG engine and VIS [RK. Brayton et al., (1996)] on a set of standard benchmarks.

[1]  In-Cheol Park,et al.  SAT-based unbounded symbolic model checking , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[2]  K. Cheng,et al.  SATORI-a fast sequential SAT engine for circuits , 2003, ICCAD-2003. International Conference on Computer Aided Design (IEEE Cat. No.03CH37486).

[3]  Michael S. Hsiao,et al.  Efficient preimage computation using a novel success-driven ATPG , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.

[4]  Alberto Sangiovanni-Vincentelli,et al.  Exact Minimization of Multiple-Valued Functions for PLA Optimization , 2003 .

[5]  Sharad Malik,et al.  Conflict driven learning in a quantified Boolean satisfiability solver , 2002, IEEE/ACM International Conference on Computer Aided Design, 2002. ICCAD 2002..

[6]  Wolfgang Kunz,et al.  SAT and ATPG: Boolean engines for formal hardware verification , 2002, IEEE/ACM International Conference on Computer Aided Design, 2002. ICCAD 2002..

[7]  Kenneth L. McMillan,et al.  Applying SAT Methods in Unbounded Symbolic Model Checking , 2002, CAV.

[8]  Sharad Malik,et al.  Efficient conflict driven learning in a Boolean satisfiability solver , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[9]  Sharad Malik,et al.  Partition-based decision heuristics for image computation using SAT and BDDs , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[10]  M. Moskewicz,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[11]  Joseph Sifakis,et al.  Model checking , 1996, Handbook of Automated Reasoning.

[12]  Armin Biere,et al.  Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking , 2000, CAV.

[13]  Kwang-Ting Cheng,et al.  Current Directions in Automatic Test-Pattern Generation , 1999, Computer.

[14]  Adrian J. Isles,et al.  Reachability analysis using partitioned-ROBDDs , 1997, 1997 Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[15]  Janusz Rajski,et al.  A complexity analysis of sequential ATPG , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[16]  Tiziano Villa,et al.  VIS: A System for Verification and Synthesis , 1996, CAV.

[17]  Michael L. Bushnell,et al.  SEARCH STATE EQUIVALENCE FOR REDUNDANCY IDENTIFICATION AND TEST GENERATION , 1991, 1991, Proceedings. International Test Conference.