Mining-guided state justification with partitioned navigation tracks

This work introduces a new guidance strategy to justify hard-to-reach target states in sequential circuits, which also applies to reaching corner-case states in design validation. We propose data-mining methods to extract several partition sets of state variables directly from the gate-level netlist of the design, such that they enable the search to reach the target state. The partition sets are used to compute partitioned navigation tracks (PNTs). PNTs capture the behavior of expanded portions of the state space as they relate to a target state of interest, thus providing a more accurate distance metric than traditional abstract guideposts. Moreover, the computation and storage costs of the PNTs are small, making our approach scalable to large circuits. With the proposed PNTs, we also need not refine the abstract models. Experiments showed that we are able to reach many more hard-to-reach states compared to state-of-the-art methods.

[1]  M. Hsiao,et al.  Mining global constraints for improving bounded sequential equivalence checking , 2006, 2006 43rd ACM/IEEE Design Automation Conference.

[2]  Alan M. Frieze,et al.  Min-Wise Independent Permutations , 2000, J. Comput. Syst. Sci..

[3]  Tomasz Imielinski,et al.  Database Mining: A Performance Perspective , 1993, IEEE Trans. Knowl. Data Eng..

[4]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[5]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[6]  David L. Dill,et al.  Validation with guided search of the state space , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[7]  Heikki Mannila,et al.  Principles of Data Mining , 2001, Undergraduate Topics in Computer Science.

[8]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[9]  Piotr Indyk,et al.  Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.

[10]  Heikki Mannila,et al.  Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.

[11]  Edith Cohen,et al.  Finding interesting associations without support pruning , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[12]  Fabio Somenzi,et al.  Guiding simulation with increasingly refined abstract traces , 2006, 2006 43rd ACM/IEEE Design Automation Conference.

[13]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[14]  Michael S. Hsiao,et al.  State variable extraction to reduce problem complexity for ATPG and design validation , 2004 .

[15]  Michael S. Hsiao,et al.  Sequential circuit test generation using dynamic state traversal , 1997, Proceedings European Design and Test Conference. ED & TC 97.