Advertisement

What’s in Common between Test, Model Checking, and Decision Procedures?

  • Ken L. McMillan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5825)

Abstract

The interaction of proof search and counterexample search is at the heart of recent methods in decision procedures model checking. In this talk, we’ll consider the relation between these methods and test.

Keywords

Model Check Decision Procedure Satisfying Assignment Abstract Domain Symbolic Model Check 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. IOS Press, Amsterdam (2009)zbMATHGoogle Scholar
  2. 2.
    Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement for symbolic model checking. J. ACM 50(5), 752–794 (2003)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Godefroid, P., Klarlund, N., Sen, K.: DART: directed automated random testing. In: PLDI 2005, pp. 213–223. ACM, New York (2005)CrossRefGoogle Scholar
  4. 4.
    McMillan, K.L.: An interpolating theorem prover. Theor. Comput. Sci. 345(1), 101–121 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    McMillan, K.L.: Lazy abstraction with interpolants. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 123–136. Springer, Heidelberg (2006)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Ken L. McMillan
    • 1
  1. 1.Cadence Research Labs 

Personalised recommendations