Decision Ordering Based Learning Techniques

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


The test generation performance using SAT-based BMC mainly depends on the efficiency of SAT search heuristics which can find satisfying assignments quickly. Since similar properties and SAT instances describe correlated functional scenarios, their significant overlap on the counterexample assignments can be used as learnings for the SAT search. This chapter explores such learnings within a SAT stance and among similar SAT instances. The proposed intra- and inter-property learnings based on decision ordering heuristics and conflict clause forwarding techniques can be used to improve the overall test generation time for a single property as well as a cluster of similar properties.


  1. 1.
    Bryant R (1986) Graph-based algorithms for Boolean function manipulation. IEEE Trans Comput 35(8):677–691Google 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.
    Chen M, Mishra P (2011) Property learning techniques for efficient generation of directed tests. IEEE Trans Comput 60(6):852–864Google Scholar
  4. 4.
    Chen M, Qin X, Mishra P (2010) Efficient decision ordering techniques for SAT-based test generation. In: Proceedings of design, automation, and test in europe (DATE), pp 490–495Google Scholar
  5. 5.
    FBK-irst and CMU (2006) NuSMV.
  6. 6.
    Marques-Silva J, Sakallah K (1999) Grasp: a search algorithm for propositional satisfiability. IEEE Trans Comput (TC) 48(5):506–521Google Scholar
  7. 7.
    Marques-Silva JP, Sakallah KA (1999) The impact of branching heuristics in propositional satisfiability. In: Proceedings of the 9th portuguese conference on artificial intelligence, pp 62–74.Google Scholar
  8. 8.
    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
  9. 9.
    Moskewicz MW, Madigan CF, Zhao Y, Zhang L (2001) Chaff: engineering an efficient SAT solver. In Proceedings of design automation conference (DAC), pp 530–535Google Scholar
  10. 10.
    Shtrichman O (2000) Tuning SAT checkers for bounded model checking. In: Proceedings of the international conference on computer aided verification (CAV), pp 480–494Google Scholar
  11. 11.
    The satisfiability library (2003) SAT benchmark problems.
  12. 12.
    Velev M (2006) Boolean satisfiability (SAT) benchmarks.
  13. 13.
    Wang C, Jin H, Hachtel GD, Somenzi F (2004) Refining the SAT decision ordering for bounded model checking. In: Proceedings of design automation conference (DAC), pp 535–538Google Scholar
  14. 14.

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