Skip to main content
SpringerLink
Log in

Monodic ASMs and Temporal Verification

  • Conference paper
Abstract State Machines 2004. Advances in Theory and Practice (ASM 2004)

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

Included in the following conference series:

Abstract

In this paper, we pursue the goal of automatic deductive verification for certain classes of ASM. In particular, we base our work on a translation of general ASMs to full first-order temporal logic. While such a logic is, in general, not finitely axiomatisable, recent work has identified a fragment, termed the monodic fragment, that is finitely axiomatisable and many of its subfragments are decidable. Thus, in this paper, we define a class of monodic ASMs whose semantics in terms of temporal logic fits within the monodic fragment. This, together with recent work on clausal resolution methods for monodic fragments, allows us to carry out temporal verification of monodic ASMs. The approach is illustrated by the deductive verification of FloodSet algorithm for Consensus problem, and Synapse N+1 cache coherence protocol; both are specified by monodic ASMs.

The authors acknowledge partial support from EPSRC (through grants GR/M46631 and GR/R45376) for the work reported in this paper.

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
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. Abstract State Machines: A Formal Method for Specification and Verification, http://www.eecs.umich.edu/gasm/

  2. Blass, A., Gurevich, Y.: Abstract State Machines Capture Parallel Algorithms. ACM Transactions on Computational Logic 4(4) (October 2003)

    Google Scholar 

  3. Börger, E.: High Level System Design and Analysis using Abstract State Machines. In: Hutter, D., Traverso, P. (eds.) FM-Trends 1998. LNCS, vol. 1641, pp. 1–43. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  4. Brotherston, J., Degtyarev, A., Fisher, M., Lisitsa, A.: Implementing Invariant Search via Temporal Resolution. In: Baaz, M., Voronkov, A. (eds.) LPAR 2002. LNCS (LNAI), vol. 2514, Springer, Heidelberg (2002)

    Chapter  Google Scholar 

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

    Google Scholar 

  6. Degtyarev, A., Fisher, M.: Towards First-Order Temporal Resolution. In: Baader, F., Brewka, G., Eiter, T. (eds.) KI 2001. LNCS (LNAI), vol. 2174, pp. 18–32. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Degtyarev, A., Fisher, M., Konev, B.: Monodic temporal resolution. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, Springer, Heidelberg (2003)

    Google Scholar 

  8. Degtyarev, A., Fisher, M., Lisitsa, A.: Equality and Monodic First-Order Temporal Logic. Studia Logica (72), 147–156 (2002)

    Google Scholar 

  9. Del Castillo, G., Winter, K.: Model Checking Support for the ASM High-Level Language. In: Schwartzbach, M.I., Graf, S. (eds.) TACAS 2000. LNCS, vol. 1785, pp. 331–346. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  10. Delzanno, G.: Constraint-based verification in Parametrized Cache Coherence Protocols. To appear in Formal Methods in System Design

    Google Scholar 

  11. Emerson, E.A.: Temporal and Modal Logic. In: Handbook of Theoretical Computer Science, pp. 996–1072. Elsevier, Amsterdam (1990)

    Google Scholar 

  12. Fisher, M., Dixon, C., Peim, M.: Clausal Temporal Resolution. ACM Transactions on. Computational Logic 2(1), 12–56 (2001)

    Article  MathSciNet  Google Scholar 

  13. Fisher, M., Lisitsa, A.: Deductive Verification of Cache Coherence Protocols. In: Proceedings of the 3rd Workshop on Automated Verification of Critical Systems AVoCS 2003, Southampton, UK, April 2003, pp. 177–186 (2003)

    Google Scholar 

  14. Fisher, M., Lisitsa, A.: Temporal Verification of Monodic Abstract State Machines Technical Report ULCS-03-011, University of Liverpool Department of Computer Science (April 2003), available at http://www.csc.liv.ac.uk/research/techreports

  15. Gargantini, A., Riccobene, E.: Encoding Abstract State Machines in PVS. In: Gurevich, Y., Kutter, P.W., Odersky, M., Thiele, L. (eds.) ASM 2000. LNCS, vol. 1912, pp. 303–322. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  16. Gurevich, Y.: Evolving Algebras 1993: Lipari Guide. In: Specification and Validation Methods, pp. 9–36. Oxford University Press, Oxford (1995)

    Google Scholar 

  17. Gurevich, Y.: Sequential Abstract State Machines Capture Sequential Algorithms. ACM Transactions on Computational Logic 1(1), 77–111 (2000)

    Article  MathSciNet  Google Scholar 

  18. Gurevich, Y.: Logician in the land of OS: Abstract State Machines at Microsoft. In: Proc. 16th Annual IEEE Symposium on Logic in Computer Science (LICS), pp. 129–136. IEEE Computer Society, Los Alamitos (2001)

    Chapter  Google Scholar 

  19. Glässer, U., Gurevich, Y., Veanes, M.: Universal Plug and Play Models. Technical Report MSR-TR-2001-59, Microsoft Research (June 2001)

    Google Scholar 

  20. Gurevich, Y., Schulte, W., Veanes, M.: Toward Industrial Strength Abstract State Machines. Technical Report MSR-TR-2001-98, Microsoft Research (October 2001)

    Google Scholar 

  21. Handy, J.: The Cache memory Book. Academic Press, London (1993)

    MATH  Google Scholar 

  22. Hodkinson, I.: Monodic Packed Fragment with Equality is Decidable. Studia Logica (72), 185–197 (2002)

    Google Scholar 

  23. Hodkinson, I., Wolter, F., Zakharyashev, M.: Decidable Fragments of First-Order Temporal Logics. Annals of Pure and Applied Logic (2000)

    Google Scholar 

  24. Hustadt, U., Konev, B.: TRP 2.0: A Temporal Resolution Prover. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 274–278. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  25. Hustadt, U., Schmidt, R.A.: Formulae which Highlight Differences between Temporal Logic and Dynamic Logic Provers. In: Issues in the Design and Experimental Evaluation of Systems for Modal and Temporal Logics, Technical Report DII 14/01, pp. 68–76. Dipartimento di Ingegneria dell’Informazione, Unversitá degli Studi di Siena (2001)

    Google Scholar 

  26. Hustadt, U., Schmidt, R.A.: Scientific Benchmarking with Temporal Logic Decision Procedures. In: Proc. KR 2002, pp. 533–544. Morgan Kaufmann, San Francisco (2002)

    Google Scholar 

  27. Huth, M., Ryan, M.: Logic in Computer Science. Cambridge University Press, Cambridge (2000)

    MATH  Google Scholar 

  28. Konev, B., Degtyarev, A., Dixon, C., Fisher, M., Hustadt, U.: Towards the Implementation of First-Order Temporal Resolution: the Expanding Domain Case. In: Proceedings of TIMEICTL 2003, Cairns, Queensland, Australia, July 2003, IEEE CS Press, Los Alamitos (2003)

    Google Scholar 

  29. Lynch, N.: Distributed Algorithms. Morgan Kaufmann Publishers, San Mateo (1996)

    MATH  Google Scholar 

  30. Manna, Z., The STeP group: Step: Deductive–algorithmic verification of reactive and realtime systems. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, Springer, Heidelberg (1996)

    Google Scholar 

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

    Google Scholar 

  32. Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, New York (1995)

    Google Scholar 

  33. Nowack, A.: Deciding the Verification Problem for Abstract State Machines. In: Börger, E., Gargantini, A., Riccobene, E. (eds.) ASM 2003. LNCS, vol. 2589, pp. 341–371. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  34. Reiter, R.: The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression. In: AI and Mathematical Theory of Computation: Papers in Honor of John McCarthy, pp. 359–380. Academic Press, London (1991)

    Google Scholar 

  35. Richardson, J., Smaill, A., Green, I.: System description: Proof planning in higher-order logic with λclam. In: Kirchner, C., Kirchner, H. (eds.) CADE 1998. LNCS (LNAI), vol. 1421, pp. 129–131. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  36. Schellhorn, G., Ahrendt, W.: Reasoning about Abstract State Machines: The WAM Case Study. Journal of Universal Computer Science 3(4), 377–413 (1997)

    MATH  MathSciNet  Google Scholar 

  37. Sistla, P., Clarke, E.M.: Complexity of Propositional Linear Temporal Logics. ACM Journal 32(3), 733–749 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  38. Spielmann, M.: Model Checking Abstract StateMachines and Beyond. In: Gurevich, Y., Kutter, P.W., Odersky, M., Thiele, L. (eds.) ASM 2000. LNCS, vol. 1912, pp. 323–340. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  39. Winter, K.: Towards a Methodology for Model Checking ASM: Lessons Learned from the FLASH Case Study. In: Gurevich, Y., Kutter, P.W., Odersky, M., Thiele, L. (eds.) ASM 2000. LNCS, vol. 1912, pp. 341–360. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  40. Wooldridge, M.: Reasoning about Rational Agents. MIT Press, Cambridge (2000)

    MATH  Google Scholar 

  41. Wolter, F., Zakharyaschev, M.: Axiomatizing the Monodic Fragment of First-Order Temporal Logic. Annals of Pure and Applied logic 118, 133–145 (2002)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Liverpool, Liverpool, L69 7ZF, UK

    Michael Fisher & Alexei Lisitsa

Authors
  1. Michael Fisher
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexei Lisitsa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Martin-Luther-Universität Halle-Wittenberg, 06099, Halle/Saale, Germany

    Wolf Zimmermann

  2. Institute of Computer Science and Applied Mathematics, Christian-Albrechts-University of Kiel, Olshausenstr. 40, 24098, Kiel, Germany

    Bernhard Thalheim

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fisher, M., Lisitsa, A. (2004). Monodic ASMs and Temporal Verification. In: Zimmermann, W., Thalheim, B. (eds) Abstract State Machines 2004. Advances in Theory and Practice. ASM 2004. Lecture Notes in Computer Science, vol 3052. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24773-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24773-9_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22094-7

  • Online ISBN: 978-3-540-24773-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation