Predictive Reachability Using a Sample-Based Approach

BDD based reachability methods suffer from lack of robustness in performance, whereby it is difficult to estimate which one should be adopted for a given problem. We present a novel approach that examines a few short samples of the computation leading to an automatic, robust and modular way of reconciling the various methods for reachability. Our approach is able to intelligently integrate diverse reachability techniques such that each method can possibly get enhanced in efficiency. The method is in many cases orders of magnitude more efficient and it finishes all the invariant checking properties in VIS-Verilog benchmarks.

[1]  Kavita Ravi,et al.  Symbolic guided search for CTL model checking , 2000, Proceedings 37th Design Automation Conference.

[2]  Joseph Sifakis,et al.  Automatic Verification Methods for Finite State Systems , 1989, Lecture Notes in Computer Science.

[3]  Sharon Barner,et al.  Searching for Counter-Examples Adaptively , 2003, IWFM.

[4]  Christian Stangier,et al.  Invariant Checking Combining Forward and Backward Traversal , 2004, FMCAD.

[5]  In-Ho Moon,et al.  To split or to conjoin: the question in image computation , 2000, DAC.

[6]  Christian Stangier,et al.  Improved Symbolic Verification Using Partitioning Techniques , 2003, CHARME.

[7]  George J. Milne,et al.  Correct Hardware Design and Verification Methods , 2003, Lecture Notes in Computer Science.

[8]  Helmut Veith,et al.  Nonlinear quantification scheduling in image computation , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[9]  Gianpiero Cabodi,et al.  Mixing Forward and Backward Traversals in Guided-Prioritized BDD-Based Verification , 2002, CAV.

[10]  Gianpiero Cabodi,et al.  Symbolic exploration of large circuits with enhanced forward/backward traversals , 1994, EURO-DAC '94.

[11]  Chao Wang,et al.  The compositional far side of image computation , 2003, ICCAD-2003. International Conference on Computer Aided Design (IEEE Cat. No.03CH37486).

[12]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[13]  Kenneth L. McMillan,et al.  Symbolic model checking , 1992 .

[14]  R. Brayton,et al.  Reachability analysis using partitioned-ROBDDs , 1997, ICCAD 1997.

[15]  Olivier Coudert,et al.  Verification of Synchronous Sequential Machines Based on Symbolic Execution , 1989, Automatic Verification Methods for Finite State Systems.

[16]  Ganesh Gopalakrishnan,et al.  Formal Methods in Computer-Aided Design , 2002, Lecture Notes in Computer Science.

[17]  Christian Stangier,et al.  A Partitioning Methodology for BDD-Based Verification , 2004, FMCAD.

[18]  David L. Dill,et al.  Verification by approximate forward and backward reachability , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).

[19]  Fabio Somenzi,et al.  Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reachable States , 2004, FMCAD.