Skip to main content
SpringerLink
Log in
Book cover

International Symposium of Formal Methods Europe

FME 2003: FME 2003: Formal Methods pp 503–521Cite as

Generating Counterexamples for Multi-valued Model-Checking

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2805))

Abstract

Counterexamples explain why a desired temporal logic property fails to hold, and as such are considered to be the most useful form of output from model-checkers. Multi-valued model-checking, introduced in [4] is an extension of classical model-checking. Instead of classical logic, it operates on elements of a given De Morgan algebra, e.g. the Kleene algebra [14]. Multi-valued model-checking has been used in a number of applications, primarily when reasoning about partial [2] and inconsistent [10] systems. In this paper we show how to generate counterexamples for multi-valued model-checking. We describe the proof system for a multi-valued variant of CTL, discuss how to use it to generate counterexamples. The techniques presented in this paper have been implemented as part of our symbolic multi-valued model-checker χ Chek [3].

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Belnap, N.D.: A Useful Four-Valued Logic. In: Dunn, Epstein (eds.) Modern Uses of Multiple-Valued Logic, pp. 30–56. Reidel, Dordrechtz (1977)

    Google Scholar 

  2. Bruns, G., Godefroid, P.: Temporal Logic Query-Checking. In: Proceedings of 16th Annual IEEE Symposium on Logic in Computer Science (LICS 2001), Boston, MA, USA, June 2001, pp. 409–417. IEEE Computer Society, Los Alamitos (2001)

    Chapter  Google Scholar 

  3. Chechik, M., Devereux, B., Gurfinkel, A.: χChek: A Multi-Valued Model-Checker. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 505–509. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Chechik, M., Easterbrook, S., Petrovykh, V.: Model-Checking Over Multi-Valued Logics. In: Oliveira, J.N., Zave, P. (eds.) FME 2001. LNCS, vol. 2021, pp. 72–98. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. Chechik, M., Gurfinkel, A.: Exploring Counterexamples (June 2003) (in preparation)

    Google Scholar 

  6. Chechik, M., Gurfinkel, A.: TLQSolver: A Temporal Logic Query Checker. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 210–214. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)

    MATH  Google Scholar 

  8. Clarke, E.M., Grumberg, O., McMillan, K.L., Zhao, X.: Efficient Generation of Counterexamples and Witnesses in Symbolic Model Checking. In: Proceedings of 32nd Design Automation Conference (DAC 1995), San Francisco, CA, USA, pp. 427–432 (1995)

    Google Scholar 

  9. Clarke, E.M., Lu, Y., Jha, S., Veith, H.: Tree-Like Counterexamples in Model Checking. In: Proceedings of the Seventeenth Annual IEEE Symposium on Logic in Computer Science (LICS 2002), Copenhagen, Denmark, July 2002, pp. 19–29. IEEE Computer Society, Los Alamitos (2002)

    Chapter  Google Scholar 

  10. Easterbrook, S., Chechik, M.: A Framework for Multi-Valued Reasoning over Inconsistent Viewpoints. In: Proceedings of International Conference on Software Engineering (ICSE 2001), Toronto, Canada, May 2001, pp. 411–420. IEEE Computer Society Press, Los Alamitos (2001)

    Chapter  Google Scholar 

  11. Gurfinkel, A.: Multi-Valued Symbolic Model-Checking: Fairness, Counterexamples, Running Time. Master’s thesis, University of Toronto, Department of Computer Science (October 2002), Available from http://www.cs.toronto.edu/~chechik/pubs/gurfinkelMSThesis.ps

  12. Gurfinkel, A., Chechik, M.: Proof-like Counterexamples. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 160–175. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Kick, A.: Tableaux and Witnesses for the μ-calculus. Technical Report iratr-1995- 44 (1995)

    Google Scholar 

  14. Kleene, S.C.: Introduction to Metamathematics. Van Nostrand, New York (1952)

    MATH  Google Scholar 

  15. Namjoshi, K.: Certifying Model Checkers. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, p. 2. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  16. Owre, S., Shankar, N., Rushby, J.: User Guide for the PVS Specification and Verification System (Draft). Technical report, Computer Science Lab, SRI International, Menlo Park, CA (1993)

    Google Scholar 

  17. Rasiowa, H.: An Algebraic Approach to Non-Classical Logics. Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam (1978)

    Google Scholar 

  18. Sofronie-Stokkermans, V.: Automated Theorem Proving by Resolution for Finitely-Valued Logics Based on Distributive Lattices with Operators. An International Journal of Multiple- Valued Logic 6(3-4), 289–344 (2001)

    MathSciNet  MATH  Google Scholar 

  19. Stevens, P., Stirling, C.: Practical Model-Checking using Games. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 85–101. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  20. Tan, L., Cleaveland, R.: Evidence-Based Model Checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 455–470. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Toronto, M5S 3G4, Toronto, ON, Canada

    Arie Gurfinkel & Marsha Chechik

Authors
  1. Arie Gurfinkel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marsha Chechik
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Communication Engineering, Graduate School of Information Science and Electrical Engineering, Kyushu University, 6-10-1-Hakozaki, Higashi-ku, 812-8581, Fukuoka, Japan

    Keijiro Araki

  2. Istituto di Scienza e Tecnologie dell’Informazione “A. Faedo”, ISTI - CNR, Pisa, Italy

    Stefania Gnesi

  3. Dipartimento di Elettronica e Informazione, Politecnico di Milano, Italy

    Dino Mandrioli

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gurfinkel, A., Chechik, M. (2003). Generating Counterexamples for Multi-valued Model-Checking. In: Araki, K., Gnesi, S., Mandrioli, D. (eds) FME 2003: Formal Methods. FME 2003. Lecture Notes in Computer Science, vol 2805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45236-2_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45236-2_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40828-4

  • Online ISBN: 978-3-540-45236-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation