Advertisement

Directed Test Generation for Multicore Architectures

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

Abstract

Existing directed test generation approaches focus on knowledge forwarding between different bounds to reduce the test generation time. This chapter describes a test generation technique for multicore architectures that exploits the structural similarity within the same bound as well as between different bounds. It enables the reuse of the knowledge learned from one core to the remaining cores in multicore architectures. The experimental results demonstrate that this approach can significantly reduce overall test generation time compared to existing approaches.

References

  1. 1.
    Aloul FA, Markov IL, Sakallah K (2003) Shatter: efficient symmetry-breaking for boolean satisfiability. In: Proceedings of design automation conference, pp 836–839Google Scholar
  2. 2.
    Aloul FA, Markov IL, Sakallah KA (2003) Shatter. University of Michigan. http://www.aloul.net/Tools/shatter/
  3. 3.
    Aloul FA, Ramani A, Markov IL, Sakallah K (2002) Solving difficult SAT instances in the presence of symmetry. In: Proceedings of design automation conference, pp 731–736Google Scholar
  4. 4.
    Bhadra J, Trofimova E, Abadir M (2008) Validating power architecture technology-based mpsocs through executable specifications. IEEE Trans Very Larg Scale Integr Syst 16(4):388–396CrossRefGoogle Scholar
  5. 5.
    Biere A, Cimatti A, Clarke EM, Zhu Y (1999) Symbolic model checking without BDDs. In: Proceedings of international conference on tools and algorithms for construction and analysis of systems, pp 193–207Google Scholar
  6. 6.
    Biere A, Sinz C (2006) Decomposing SAT problems into connected components. J Satisf Boolean Model Comput 2:191–198Google Scholar
  7. 7.
    Cavada R, Cimatti A, Jochim CA, Keighren G, Olivetti E, Pistore M, Roveri M, Tchaltse A (2010) NuSMV. ITC-Irst. http://nusmv.irst.itc.it/
  8. 8.
    Clarke E, Biere A, Raimi R, Zhu Y (2001) Bounded model checking using satisfiability solving. Formal Methods Syst Des 19(1):7–34MATHCrossRefGoogle Scholar
  9. 9.
    Darga PT, Liffiton MH, Sakallah KA, Markov IL (2004) Exploiting structure in symmetry detection for cnf. In: Proceedings of design automation conference, pp 530–534Google Scholar
  10. 10.
    Fu Z, Mahajan Y, Malik S (2001) zChaff. Princeton University. http://www.princeton.edu/chaff/zchaff.html
  11. 11.
    Gargantini A, Heitmeyer C (1999) Using model checking to generate tests from requirements specifications. In: Proceedings of the 7th European software engineering conference held jointly with the 7th ACM SIGSOFT international symposium on foundations of, software engineering, vol 24, pp 146–162Google Scholar
  12. 12.
    Hooker JN (1993) Solving the incremental satisfiability problem. J Log Program 15(1–2):177–186MathSciNetMATHCrossRefGoogle Scholar
  13. 13.
    Kuehlmann A (2004) Dynamic transition relation simplification for bounded property checking. In: Proceedings of IEEE/ACM international conference on computer-aided design, pp 50–57Google Scholar
  14. 14.
    Miller A, Donaldson A, Calder M (2006) Symmetry in temporal logic model checking. ACM Comput Surv 38(3):8CrossRefGoogle Scholar
  15. 15.
    Mishra P, Chen M (2009) Efficient techniques for directed test generation using incremental satisfiability. In: Proceedings of international conference on VLSI design, pp 65–70Google Scholar
  16. 16.
    Mishra P, Dutt N (2004) Graph-based functional test program generation for pipelined processors. In: Proceedings of the conference on design, automation and test in Europe, pp 182–187Google Scholar
  17. 17.
    Moskewicz MW, Madigan CF, Zhao Y, Zhang L, Malik S (2001) Chaff: engineering an efficient SAT solver. In: Proceedings of design automation conference, pp 530–535Google Scholar
  18. 18.
    Qin X, Mishra P (2011) Efficient directed test generation for validation of multicore architectures. In: Proceedings of international symposium on quality electronic design, pp 276–283Google Scholar
  19. 19.
    Strichman O (2004) Accelerating bounded model checking of safety properties. Formal Methods Syst Des 24(1):5–24MATHCrossRefGoogle Scholar
  20. 20.
    Tang D, Malik S, Gupta A, Ip CN (2005) Symmetry reduction in SAT-based model checking. In: Proceedings of international conference on computer aided verfication, pp 125–138Google Scholar
  21. 21.
    Whittemore J, Kim J, Sakallah K (2001) SATIRE: a new incremental satisfiability engine. In: Proceedings of design automation conference, pp 542–545Google Scholar

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