Skip to main content
SpringerLink
Log in

Combining Theorem Proving and Narrowing for Rewriting-Logic Specifications

  • Conference paper
Tests and Proofs (TAP 2010)

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

Included in the following conference series:

Abstract

We present an approach for verifying dynamic systems specified in rewriting logic, a formal specification language implemented in the Maude system. Our approach is tailored for invariants, i.e., properties that hold on all states reachable from a given class of initial states. The approach consists in encoding invariance properties into inductive properties written in membership equational logic, a sublogic of rewriting logic also implemented in Maude. The invariants can then be verified using an inductive theorem prover available for membership equational logic, possibly in interaction with narrowing-based symbolic analysis tools for rewriting-logic specifications also available in the Maude environment. We show that it is possible, and useful, to automatically test invariants by symbolic analysis before interactively proving them.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

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. Martí-Oliet, N., Meseguer, J.: Rewriting logic: roadmap and bibliography. TCS 285(2), 121–154 (2002)

    Article  MATH  Google Scholar 

  2. Meseguer, J., Rosu, G.: The rewriting logic semantics project. TCS 373(3), 213–237 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  3. Meseguer, J., Thati, P.: Symbolic reachability analysis using narrowing and its application to the verification of cryptographic protocols. Higher-Order and Symbolic Computation 20(1-2), 123–160 (2007)

    Article  MATH  Google Scholar 

  4. Eker, S., Knapp, M., Laderoute, K., Lincoln, P., Meseguer, J., Sönmez, M.K.: Pathway logic: Symbolic analysis of biological signaling. In: Pacific Symposium on Biocomputing, pp. 400–412 (2002)

    Google Scholar 

  5. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C. L. (eds.): All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007)

    MATH  Google Scholar 

  6. Borovanský, P., Kirchner, C., Kirchner, H., Moreau, P.E., Ringeissen, C.: An overview of ELAN. Electr. Notes Theor. Comput. Sci. 15 (1998)

    Google Scholar 

  7. Diaconescu, R., Futatsugi, K.: Logical foundations of CafeOBJ. TCS 285(2), 289–318 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  8. Meseguer, J.: Membership algebra as a logical framework for equational specification. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol. 1376, pp. 18–61. Springer, Heidelberg (1998)

    Google Scholar 

  9. Eker, S., Meseguer, J., Sridharanarayanan, A.: The Maude ltl model checker. Electr. Notes Theor. Comput. Sci. 71 (2002)

    Google Scholar 

  10. Meseguer, J.: The temporal logic of rewriting: A gentle introduction. In: Degano, P., De Nicola, R., Meseguer, J. (eds.) Concurrency, Graphs and Models. LNCS, vol. 5065, pp. 354–382. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. Clavel, M., Durán, F., Eker, S., Escobar, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C. L.: Unification and narrowing in Maude 2.4. In: Treinen, R. (ed.) RTA 2009. LNCS, vol. 5595, pp. 380–390. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  12. Escobar, S., Meseguer, J.: Symbolic model checking of infinite-state systems using narrowing. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 153–168. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  13. Meseguer, J., Palomino, M., Martí-Oliet, N.: Equational abstractions. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 2–16. Springer, Heidelberg (2003)

    Google Scholar 

  14. Clavel, M., Palomino, M., Riesco, A.: Introducing the itp tool: a tutorial. J. Universal Computer Science 12(11), 1618–1650 (2006)

    Google Scholar 

  15. Escobar, S., Meseguer, J., Sasse, R.: Variant narrowing and equational unification. Electr. Notes Theor. Comput. Sci. 238(3), 103–119 (2009)

    Article  Google Scholar 

  16. Bruni, R., Meseguer, J.: Semantic foundations for generalized rewrite theories. TCS 360(1-3), 386–414 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  17. Escobar, S., Meadows, C., Meseguer, J.: A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties. Theor. Comput. Sci. 367(1-2), 162–202 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  18. Rusu, V., Clavel, M.: Vérification d’invariants pour des systèmes spécifiés en logique de réécriture. In: JFLA. Studia Informatica Universalis, vol. 7.2, pp. 317–350 (2009), http://www.irisa.fr/vertecs/Equipe/Rusu/rc09.pdf

  19. Futatsugi, K.: Verifying specifications with proof scores in CafeOBJ. In: ASE, pp. 3–10. IEEE Comp. Soc., Los Alamitos (2006)

    Google Scholar 

  20. Ogata, K., Futatsugi, K.: State machines as inductive types. IEICE Transactions 90-A(12), 2985–2988 (2007)

    Google Scholar 

  21. Kong, W., Seino, T., Futatsugi, K., Ogata, K.: A lightweight integration of theorem proving and model checking for system verification. In: APSEC, pp. 59–66. IEEE Comp. Soc., Los Alamitos (2005)

    Google Scholar 

  22. Ogata, K., Nakano, M., Nakamura, M., Futatsugi, K.: Chocolat/SMV: a translator from CafeOBJ to SMV. In: PDCAT, pp. 416–420. IEEE Comp. Soc., Los Alamitos (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Inria Rennes Bretagne Atlantique, France

    Vlad Rusu

Authors
  1. Vlad Rusu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science, Saarland University, Saarbruecken, Germany

    Gordon Fraser

  2. DIIMM, University of Bergamo, Dalmine, Italy

    Angelo Gargantini

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rusu, V. (2010). Combining Theorem Proving and Narrowing for Rewriting-Logic Specifications. In: Fraser, G., Gargantini, A. (eds) Tests and Proofs. TAP 2010. Lecture Notes in Computer Science, vol 6143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13977-2_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13977-2_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13976-5

  • Online ISBN: 978-3-642-13977-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation