Automatic lighthouse generation for directed state space search

Previous researchers have suggested the use of "lighthouses" to act as guides in directed state space search. The drawback of using lighthouses is that the user has to manually, derive them, through a potentially laborious examination of the design. Additionally specifying a large number of lighthouses results in wasted effort during the search. We present approaches to automatically generate high-quality lighthouses for hard-to-cover targets.

[1]  Prabhakar Goel,et al.  An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits , 1981, IEEE Transactions on Computers.

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

[3]  Masahiro Fujita,et al.  Bug identification of a real chip design by symbolic model checking , 1994, Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC.

[4]  Joao Marques-Silva,et al.  GRASP-A new search algorithm for satisfiability , 1996, Proceedings of International Conference on Computer Aided Design.

[5]  Adnan Aziz,et al.  Enhancing simulation with BDDs and ATPG , 1999, DAC '99.