Skip to main content
Springer Nature Link
Log in

Automatic Verification of a Model Checker by Reflection

  • Conference paper
Practical Aspects of Declarative Languages (PADL 2006)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3819))

Included in the following conference series:

Abstract

Intuitively, reflection is the feature that can represent and reason meta-level entities at the object level. In this paper, we use a reflective language to implement a local model checker and analyze the implementation. The implementation is greatly simplified by reflection. Further, we show the feature can be applied to verify the concise implementation rather easily. The simplicity of our approach suggests that reflection may be useful in the implementation and verification of other explicit-state model checking algorithms.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Basin, D., Clavel, M., Meseguer, J.: Rewriting logic as a metalogical framework. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol. 1974, pp. 55–80. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  2. Basin, D., Clavel, M., Meseguer, J.: Reflective metalogical frameworks. ACM Transactions on Computational Logic 5, 528–576 (2004)

    Article  MathSciNet  Google Scholar 

  3. Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (1999)

    Google Scholar 

  4. Clavel, M.: Reflection in general logics, rewriting logic, and Maude. In: Kirchner, C., Kirchner, H. (eds.) Proceedings Second International Workshop on Rewriting Logic and its Applications. Electronic Notes in Theoretical Computer Science, vol. 15, pp. 317–328. Elsevier Science Publishers, Amsterdam (1998)

    Google Scholar 

  5. Clavel, M.: The ITP Tool - An Inductive Theorem Prover Tool for Maude Membership Equational Specifications (2004)

    Google Scholar 

  6. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C.: Maude 2.0 Manuel, version 1st edn (2003)

    Google Scholar 

  7. Clavel, M., Martí-Oliet, N., Palomino, M.: Formalizing and proving semantic relations between specifications by reflection. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol. 3116, pp. 72–86. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Clavel, M., Meseguer, J.: Reflection and strategies in rewriting logic. In: Meseguer, J. (ed.) Proceedings First International Workshop on Rewriting Logic and its Applications. Electronic Notes in Theoretical Computer Science, vol. 4, pp. 125–147. Elsevier Science Publishers, Amsterdam (1996)

    Google Scholar 

  9. Cleaveland, R.: Tableau-based model checking in the propositional mu-calculus. Acta Informatica 27, 725–747 (1989)

    MathSciNet  Google Scholar 

  10. Eker, S., Meseguer, J., Sridharanarayanan, A.: The Maude LTL model checker. In: Proceedings of the Fourth International Workshop on Rewriting Logic. Electronic Notes in Theoretical Computer Science, vol. 71. Elsevier Science Publishers, Amsterdam (2002)

    Google Scholar 

  11. Holzmann, G.: The model checker SPIN. IEEE Transaction on Software Engineering 23, 279–295 (1997)

    Article  Google Scholar 

  12. Kozen, D.: Results on the propositional μ-calculus. Theoretical Computer Science 27, 333–354 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  13. Manolios, P.: Mu-Calculus Model-Checking, pp. 93–111. Kluwer Academic Publishers, Dordrecht (2000)

    Google Scholar 

  14. Martí-Oliet, N., Meseguer, J.: Rewriting logic: roadmap and bibliography. Theoretical Computer Science 285, 121–154 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  15. Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96, 73–155 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  16. Meseguer, J.: Rewriting logic as a semantic framework for concurrency: A progress report. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 331–372. Springer, Heidelberg (1996)

    Google Scholar 

  17. van de Pol, J., Zantema, H.: Binary decision diagrams by shared rewriting. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 609–618. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  18. Silberschatz, A., Galvin, P.B., Gagne, G.: Operating System Concepts, 7th edn. John Wiley & Sons, Inc., Chichester (2004)

    Google Scholar 

  19. Sprenger, C.: A verified model checker for the modal μ-calculus in coq. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 167–183. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  20. Stirling, C., Walker, D.: Local model checking in the modal mu-calculus. In: Díaz, J., Orejas, F. (eds.) Proceedings Int. Joint Conf. on Theory and Practice of Software Development. LNCS, vol. 351, pp. 369–383. Springer, Berlin (1989)

    Google Scholar 

  21. Wang, B.Y.: μ-calculus model checking in maude. In: Martí-Oliet, N. (ed.) 5th International Workshop on Rewriting Logic and its Applications. Electronic Notes in Theoretical Computer Science, vol. 117, pp. 135–152. Elsevier Science Publishers, Amsterdam (2004)

    Google Scholar 

  22. Wang, B.Y.: Automatic verification of a model checker in rewriting logic. Technical Report TR-IIS-05-009, Institute of Information Science, Academia Sinica (2005), http://www.iis.sinica.edu.tw/LIB/TechReport/tr2005/tr05009.pdf

  23. Wang, B.Y., Meseguer, J., Gunter, C.A.: Specification and formal analysis of a PLAN algorithm in Maude. In: Hsiung, P.A. (ed.) Proceedings International Workshop on Distributed System Validation and Verification, pp. 49–56 (2000)

    Google Scholar 

  24. Winskel, G.: A note on model checking the modal nu-calculus. Theoretical Computer Science 83, 157–167 (1991)

    Article  MATH  Google Scholar 

  25. Zantema, H., van de Pol, J.: A rewriting approach to binary decision diagrams. Journal of Logic and Algebraic Programming 49, 61–86 (2001)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Science, Academia Sinica, 128 Sec 2 Academia Rd, Taipei, 115, Taiwan

    Bow-Yaw Wang

Authors
  1. Bow-Yaw Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Brown University, Box 1910, RI 02912, Providence,  

    Pascal Van Hentenryck

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, BY. (2005). Automatic Verification of a Model Checker by Reflection. In: Van Hentenryck, P. (eds) Practical Aspects of Declarative Languages. PADL 2006. Lecture Notes in Computer Science, vol 3819. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11603023_4

Download citation

  • DOI: https://doi.org/10.1007/11603023_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30947-5

  • Online ISBN: 978-3-540-31685-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics