Skip to main content

Towards a Verification Logic for Rewriting Logic

  • Conference paper
Recent Trends in Algebraic Development Techniques (WADT 1999)

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

Included in the following conference series:

Abstract

This paper is an initial step in the development of a logic for verifying properties of programs in rewriting logic. Rewriting logic is primarily a logic of change, in which deduction corresponds directly to computation, and not a logic to talk about change in a more indirect and global manner, such as the different modal and temporal logics that can be found in the literature.

We start by defining a modal action logic (VLRL) in which rewrite rules are captured as actions. The main novelty of this logic is a topological modality associated with state constructors that allows us to reason about the structure of states, stating that the current state can be decomposed into regions satisfying certain properties. Then, on top of the modal logic, we define a temporal logic for reasoning about properties of the computations generated from rewrite theories, and demonstrate its potential by means of two simple examples.

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

Access this chapter

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
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bouhoula, A., Jouannaud, J.-P., Meseguer, J.: Specification and proof in membership equational logic. In: Bidoit, M., Dauchet, M. (eds.) CAAP 1997, FASE 1997, and TAPSOFT 1997. LNCS, vol. 1214, pp. 67–92. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  2. Clavel, M., Duran, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Quesada, J.F.: Maude: Specification and programming in rewriting logic, Computer Science Laboratory, SRI International (January 1999) (revised August 1999), http://maude.csl.sri.com

  3. Clavel, M., Duran, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Quesada, J.F.: A Maude Tutorial, Computer Science Laboratory, SRI International (March 2000), http://maude.csl.sri.com

  4. Denker, G.: From rewrite theories to temporal logic theories. In: [8]

    Google Scholar 

  5. Fiadeiro, J., Maibaum, T.: Temporal reasoning over deontic specifications. Journal of Logic and Computation 1(3), 357–395 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  6. Fiadeiro, J., Maibaum, T.: Categorical semantics of parallel program design. Science of Computer Programming 28(2–3), 111–138 (1997)

    Article  MATH  Google Scholar 

  7. Goldblatt, R.: Logics of Time and Computation, CSLI Lecture Notes 7, Center for the Study of Language and Information, 2nd edn. (1992)

    Google Scholar 

  8. Kirchner, C., Kirchner, H.: Proc. Second Int. Workshop on Rewriting Logic and its Applications. Electronic Notes in Theoretical Computer Science, Pont-à-Mousson, France, vol. 15. Elsevier Science, Amsterdam (1998)

    Google Scholar 

  9. Lechner, U.: Object-Oriented Specification of Distributed Systems, Ph. D. Dissertation, Universitat Passau, June 23(1997)

    Google Scholar 

  10. Lincoln, P., Martí-Oliet, N., Meseguer, J.: Specification, transformation, and programming of concurrent systems in rewriting logic. In: Blelloch, G.E., et al. (eds.) Specification of Parallel Algorithms, DIMACS Workshop, pp. 309–339. American Mathematical Society (1994)

    Google Scholar 

  11. Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, Heidelberg (1992)

    Google Scholar 

  12. Martí-Oliet, N., Meseguer, J.: Action and change in rewriting logic. In: Pareschi, R., Fronhöfer, B. (eds.) Dynamic Worlds: From the Frame Problem to Knowledge Management, pp. 1–53. Kluwer Academic Publishers, Dordrecht (1999)

    Google Scholar 

  13. Meseguer, J.: Rewriting as a unified model of concurrency. In: Baeten, J.C.M., Klop, J.W. (eds.) Proc. CONCUR 1990. LNCS, vol. 458, pp. 384–400. Springer, Heidelberg (1990)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  15. Meseguer, J.: A logical theory of concurrent objects and its realization in the Maude language. In: Agha, G., Wegner, P., Yonezawa, A. (eds.) Research Directions in Concurrent Object-Oriented Programming, pp. 314–390. The MIT Press, Cambridge (1993)

    Google Scholar 

  16. Meseguer, J.: Research directions in rewriting logic. In: Berger, U., Schwichtenberg, H. (eds.) Computational Logic, NATO Advanced Study Institute, Marktoberdorf, Germany. Springer, Heidelberg (1999)

    Google Scholar 

  17. Meseguer, J.(ed.): Proc. First Int. Workshop on Rewriting Logic and its Applications. Electronic Notes in Theoretical Computer Science, Asilomar, California, vol. 4. Elsevier Science, Amsterdam (1996)

    Google Scholar 

  18. Stirling, C.: Modal and temporal logics. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science, vol. II, pp. 478–563. Oxford University Press, Oxford (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fiadeiro, J.L., Maibaum, T., Martí-Oliet, N., Meseguer, J., Pita, I. (2000). Towards a Verification Logic for Rewriting Logic. In: Bert, D., Choppy, C., Mosses, P.D. (eds) Recent Trends in Algebraic Development Techniques. WADT 1999. Lecture Notes in Computer Science, vol 1827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44616-3_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-44616-3_25

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-44616-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics