Property Clustering and Learning Techniques

  • Mingsong Chen
  • Xiaoke Qin
  • Heon-Mo Koo
  • Prabhat Mishra


In most current model checking based test generation approaches, property checking involves only one property at a time, and the checking of different properties are totally independent. This could be extremely time-consuming, since complex designs generally have a large set of properties that needs to be checked. This chapter presents a framework that can efficiently reduce the overall test generation time by exploiting the similarity among different properties. It presents various clustering strategies that can cluster similar properties together to enable learning sharing. In addition, this chapter investigates the conflict clause based learning that can be reused across properties to drastically reduce the overall test generation time.


  1. 1.
    Mishra P, Chen M (2009) Efficient techniques for directed test generation using incremental satisfiability. In: Proceedings of international conference of VLSI design, pp 65–70Google Scholar
  2. 2.
    Chen M, Mishra P (2010) Functional test generation using efficient property clustering and learning techniques. IEEE Trans Comput Aided Des Integr Circuits Syst (TCAD) 29(3):396–404Google Scholar
  3. 3.
    Bryant R (1986) Graph-based algorithms for Boolean function manipulation. IEEE Trans Comput 35(8):677–691Google Scholar
  4. 4.
    Amla N, Du X, Kuehlmann A, Kurshan R, McMillan K (2005) SATIRE: an analysis of SAT-based model checking techniques in an industrial environment. In: Proceedings of conference on correct hardware design and verification methods (CHARME), pp 254–268Google Scholar
  5. 5.
    Moskewicz MW, Madigan CF, Zhao Y, Zhang L (2001) Chaff: engineering an efficient SAT solver. In: Proceedings of the 38th design automation conference (DAC), pp 530–535Google Scholar
  6. 6.
    Jin H, Somenzi F (2004) An incremental algorithm to check satisfiability for bounded model checking. In: Proceedings of BMC, pp 51–65Google Scholar
  7. 7.
    Whittemore J, Kim J, Sakallah K (2001) SATIRE: a new incremental satisfiability engine. In: Proceedings of design automation conference (DAC), pp 542–545Google Scholar
  8. 8.
    Zhang L, Prasad M, Hsiao M (2004) SATIRE: incremental deductive and inductive reasoning for SAT-based bounded model checking. In: Proceedings of international conference on computer-aided design (ICCAD), pp 502–509Google Scholar
  9. 9.
    Strichman O (2001) Pruning techniques for the SAT-based bounded model checking problem. In: Proceedings of correct hardware design and verification methods (CHARME), pp 58–70Google Scholar
  10. 10.
    Kim J, Whittemore J, Marques-Silva J, Sakallah K (2000) On solving stack-based incremental satisfiability problems. In: Proceedings of international conference on computer design (ICCD), pp 379–382Google Scholar
  11. 11.
    Benedetti M, Bernardini S (2004) Incremental compilation-to-SAT procedures. In: Proceedings of international conference on theory and applications of satisfiability testing (SAT), , pp 46–58Google Scholar
  12. 12.
    Hooker J (1993) Solving the incremental satisfiability problem. J Logic Program 15(12):177–186Google Scholar
  13. 13.
    Chandrasekar K, Hsiao MS (2005) Integration of learning techniques into incremental satisfiability for efficient path-delay fault test generation. In: Proceedings of design automation and test in Europe (DATE), pp 1002–1007Google Scholar
  14. 14.
    Marques-Silva J, Sakallah K (1999) Grasp: a search algorithm for propositional satisfiability. IEEE Trans Comput (TC) 48(5):506–521Google Scholar
  15. 15.
    Davis M, Logemann G, Loveland D (1962) A machine program for theorem-proving. Commun ACM 5(7):394–397Google Scholar
  16. 16.
    Davis M, Putnam H (1960) A computing procedure for quantification theory. J ACM 7(3):201–215Google Scholar
  17. 17.
    Zhang L, Madigan CF, Moskewicz MH, Malik S (2001) Efficient conflict driven learning in a boolean satisfiability solver. In: Proceedings of international conference on computer-aided design (ICCAD), pp 279–285Google Scholar
  18. 18.
    Princeton University (2007) zChaff.
  19. 19.
    FBK-irst and CMU (2006) NuSMV.

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Mingsong Chen
    • 1
  • Xiaoke Qin
    • 2
  • Heon-Mo Koo
    • 3
  • Prabhat Mishra
    • 2
  1. 1.Software Engineering InstituteEast China Normal UniversityShanghaiPeople’s Republic of China
  2. 2.Department of Computer and Information Science and EngineeringUniversity of FloridaGainsvilleUSA
  3. 3.Intel corporationSantaUSA

Personalised recommendations