Weixin Wu
ABSTRACT
In this paper, we propose a novel technique on mining relationships in a sequential circuit to discover global constraints. In contrast to the traditional learning methods, our mining algorithm can find important relationships among several nodes efficiently. The nodes involved may often span several time-frames, thus improving the deductibility of the problem instance. Experimental results demonstrate that the application of these global constraints to SAT-based bounded sequential equivalence checking can achieve one to two orders of magnitude speedup. In addition, because it is orthogonal to the underlying SAT solver, it can help to enhance the efficacy of typical SAT based verification flows.
- M. H. Schulz, E. Trischler and T. M. Sarfert. SOCRATES: A highly efficient automatic test pattern generation system. IEEE Trans. CAD, vol. 7, no. 1, Jan. 1988, pp. 126--137.Google Scholar
Digital Library
- W. Kunz and D. K. Pradhan. Accelerated dynamic learning for test pattern generation in combinational circuits. IEEE Trans. CAD, vol. 12, no. 5, May 1993, pp. 684--694.Google ScholarDigital Library
- H. Ichihara and K. Kinoshita. On acceleration of logic circuits optimization using implication relations. In Proc. Asian Test Symp., 1997, pp. 222--227. Google ScholarDigital Library
- W. Kunz, D. Stoffel and P. R. Menon. Logic optimization and equivalence checking by implication analysis. IEEE Trans. CAD, Vol. 16 , no. 3, Mar. 1997, pp.266--281. Google ScholarDigital Library
- S. Kajihara, K. K. Saluja and S. M. Reddy. Enhanced 3-valued logic/fault simulation for full scan circuits using implicit logic values. Proc. European Test Symp., 2004, pp. 108--113. Google ScholarDigital Library
- M. E. Amyeen, W. K. Fuch, I. Pomeranz and V. Boppana. Implication and evaluation techniques for proving fault equivalence. Proc. VLSI Test Symp., 1999, pp. 201--207. Google ScholarDigital Library
- W. Kunz, D. Pradhan and S. Reddy. A Novel Framework for Logic Verification in a Synthesis Environment. IEEE Trans. CAD, vol. 15, no. 1, Jan. 1996, pp. 20--32. Google ScholarDigital Library
- M. lyer and M. Abramovici. FIRE: A Fault-independent Combinational Redundancy Identification Algorithm. IEEE Trans. VLSI Systems., vol. 4, no. 2, Jun. 1996, pp. 295--301. Google ScholarDigital Library
- J. K. Zhao, M. Rudnick and J. Patel. Static Logic Implication with Application to Fast Redundancy Identification. Proc. VLSI Test Symp., 1997, pp. 288--293. Google ScholarDigital Library
- M. H. Schulz and E. Auth. Improved deterministic test pattern generation with applications to redundancy identification. IEEE Trans. CAD, vol. 8, no. 7, Jul. 1989, pp. 811--816.Google ScholarDigital Library
- Y. Novikov. Local search for Boolean relations on the basis of unit propagation, Proc. Design, Automation and Test in Europe Conf., 2003, pp. 810--815. Google ScholarDigital Library
- J. Rajski and H. Kox. A Method to Calculate Necessary Assignments in ATPG. Proc. Int'l. Test Conf., 1990, pp. 25--34.Google Scholar
- S.T. Chakradhar and V. D. Agrawal. A transitive closure algorithm for test generation. IEEE Trans. CAD., 1993, pp. 1015 -- 1028.Google ScholarDigital Library
- W. Kunz and D. K. Pradhan. Recursive Learning: A new Implication Technique for Efficient Solutions to CAD problems test, verification, and optimization. IEEE Trans. CAD., 1993, pp.1149--1158.Google Scholar
- J. Zhao, J. A. Newquist and J. Patel. A graph traversal based framework for sequential logic implication with an application to c-cycle redundancy identification. Proc. VLSI Design Conf., 2001, pp. 163--169. Google ScholarDigital Library
- K. Gulrajani and M. S. Hsiao. Multi-node static logic implications for redundancy identification. Proc. Design, Automation, and Test in Europe Conf., 2000, pp. 729--733. Google ScholarDigital Library
- M. Syal, R. Arora and M. S. Hsiao. Extended forward implications and dual recurrence relations to identify sequentially untestable faults. Proc. Int'l Conf. Computer Design, 2005, pp. 453--460. Google ScholarDigital Library
- D. J. Hand, H. Mannila and P. Smyth. Principles of Data Mining. MIT Press, Aug. 2001. Google ScholarDigital Library
- A. Biere, A. Cimatti, E. M. Clarke, M. Fujita and Y. Zhu Symbolic model checking using SAT procedures instead of BDDs. Proc. Design Automation Conf., 1999, pp. 317--320. Google ScholarDigital Library
- A. Kuehlmann. Dynamic Transition Relation Simplification for Bounded Property Checking. Proc. Int. Conf. Computer-Aided Design., 2004, pp. 50--57. Google ScholarDigital Library
- M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang and S. Malik. Chaff: Engineering an efficient SAT solver. Proc. Design Automation Conf., 2001, pp. 530--535. Google ScholarDigital Library
- E. Goldberg and Y. Novikov. BerkMin: A fast and robust Sat Solver. Proc. European Design and Test Conf., 2002, pp. 142--149. Google ScholarDigital Library
- F. Lu, L. C. Wang and K. T. Cheng. A circuit SAT solver with signal correlation guided learning. Proc. European Design and Test Conf., 2003, pp. 892--897. Google ScholarDigital Library
- R. Agrawal, T. Imielinski and A. Swami. Mining association rules between sets of items in large databases. Proc. Conf. Management of Data, 1993, pp. 207--216. Google ScholarDigital Library
- R. Agrawal, T. Imielinski and A. Swami. Database mining: A performance perspective. IEEE Trans. Knowledge and Data Engineering, vol. 5, No. 6, 1993, pp. 914--925. Google ScholarDigital Library
Index Terms
- Mining global constraints for improving bounded sequential equivalence checking
Recommendations
Mining Global Constraints With Domain Knowledge for Improving Bounded Sequential Equivalence Checking
We present a novel technique on mining relationships in a sequential circuit to discover global constraints. We utilize domain knowledge to prune the search space for our mining process, via which the mined relations may often span several time frames, ...
Improving SAT using 2SAT
Propositional satisfiability (SAT) is a fundamental problem of immense practical importance. While SAT is NP-complete when clauses can contain 3 literals or more, the problem can be solved in linear time when the given formula contains only binary ...
Improving SAT using 2SAT
ACSC '02: Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4Propositional satisfiability (SAT) is a fundamental problem of immense practical importance. While SAT is NP-complete when clauses can contain 3 literals or more, the problem can be solved in linear time when the given formula contains only binary ...
Comments