Skip to main content
SpringerLink
Log in
Book cover

Workshop/School/Symposium of the REX Project (Research and Education in Concurrent Systems)

REX 1989: Stepwise Refinement of Distributed Systems Models, Formalisms, Correctness pp 94–129Cite as

MetateM: A framework for programming in temporal logic

  • Technical Contributions
  • Conference paper
  • First Online:

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

Abstract

In this paper we further develop the methodology of temporal logic as an executable imperative language, presented by Moszkowski [Mos86] and Gabbay [Gab87, Gab89] and present a concrete framework, called MetateM for executing (modal and) temporal logics. Our approach is illustrated by the development of an execution mechanism for a propositional temporal logic and for a restricted first order temporal logic.

Work supported partially by Alvey under grants PRJ/SE/054 and IKBS/170 and by ESPRIT under Basic Research Action 3096 (SPEC).

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abadi. Temporal-Logic Theorem Proving. PhD thesis, Department of Computer Science, Stanford University, March 1987.

    Google Scholar 

  2. M. Abadi. The Power of Temporal Proofs. In Proc. Symp. on Logic in Computer Science, pages 123–130, Ithaca, June 1987.

    Google Scholar 

  3. M. Abadi and Z. Manna. Non-clausal Temporal Deduction. Lecture Notes in Computer Science, 193:1–15, June 1985.

    Google Scholar 

  4. M. Abadi and Z. Manna. A Timely Resolution. In Proc. Symp. on Logic in Computer Science, pages 176–186, Boston, June 1986.

    Google Scholar 

  5. M. Baudinet. Temporal Logic Programming is Complete and Expressive. In Proceedings of ACM Symposium on Principles of Programming Languages, Austin, Texas, January 1989.

    Google Scholar 

  6. N. D. Belnap. A Useful Four-Valued Logic. In J. M. Dunn and G. Epstein, editors, Modern Uses of Multiple-Values Logic, pages 5–37. D. Reidel Publishing Company, 1977.

    Google Scholar 

  7. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244–263, January 1986.

    Article  Google Scholar 

  8. M. D. Fisher. Implementing a Prototype metatem Interpreter. Temple Group Report, Department of Computer Science, University of Manchester, November 1988.

    Google Scholar 

  9. D. Gabbay. Modal and Temporal Logic Programming. In A. Galton, editor, Temporal Logics and their Applications. Academic Press, London, December 1987.

    Google Scholar 

  10. D. Gabbay. Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems. In B. Banieqbal, H. Barringer, and A. Pnueli, editors, Proceedings of Colloquium on Temporal Logic in Specification, Altrincham, 1987, pages 402–450. Springer-Verlag, 1989. LNCS Volume 398.

    Google Scholar 

  11. G. D. Gough. Decision procedures for Temporal Logic. Master's thesis, Department of Computer Science, University of Manchester, October 1984.

    Google Scholar 

  12. R. Hale. Temporal Logic Programming. In A. Galton, editor, Temporal Logics and their Applications, chapter 3, pages 91–119. Academic Press, London, December 1987.

    Google Scholar 

  13. T. Hattori, R. Nakajima, N. Niide, and K. Takenaka. RACCO: A Modal-Logic Programming Language for Writing Models of Real-time Process-Control Systems. Technical report, Research Institute for Mathematical Sciences, Kyoto University, November 1986.

    Google Scholar 

  14. O. Lichtenstein and A. Pnueli. Checking that Finite State Concurrent Programs Satisfy their Linear Specification. In Proceedings of the Twelfth ACM Symposium on the Principles of Programming Languages, pages 97–107, New Orleans, Louisiana, January 1985.

    Google Scholar 

  15. B. Moszkowski and Z. Manna. Reasoning in Interval Temporal Logic. In AMC/NSF/ONR Workshop on Logics of Programs, pages 371–383, Berlin, 1984. Volume 164, LNCS, Springer-Verlag.

    Google Scholar 

  16. B. Moszkowski. Resoning about Digital Circuits. PhD thesis, Department of Computer Science, Stanford University, July 1983.

    Google Scholar 

  17. B. Moszkowski. Executing Temporal Logic Programs. Cambridge University Press, Cambridge, England, 1986.

    Google Scholar 

  18. Z. Manna and P. Wolper. Synthesis of Communicating Processes from Temporal Logic Specifications. ACM Transactions on Programming Languages and Systems, 6(1):68–93, January 1984.

    Article  Google Scholar 

  19. A. Pnueli and R. Rosner. On the Synthesis of a Reactive Module. In Proceedings of the 16th ACM Symposium on the Principles of Programming Languages, pages 179–190, 1989.

    Google Scholar 

  20. A. Pnueli and R. Rosner. On the Synthesis of an Asynchronous Reactive Module. In Proceedings of the 16th International Colloquium on Automata, Languages and Programs, 1989.

    Google Scholar 

  21. T. Sakuragawa. Temporal Prolog. Technical report, Research Institute for Mathematical Sciences, Kyoto University, 1986. to appear in Computer Software.

    Google Scholar 

  22. M.Y. Vardi and P. Wolper. Automata-Theoretic Techniques for Modal Logics of Programs. Journal of Computer and System Science, 32(2): 182–21, April 1986.

    Google Scholar 

  23. Pierre Wolper. The Tableau Method for Temporal Logic: An overview. Logique et Analyse, 110–111:119–136, June–Sept 1985.

    Google Scholar 

  24. Tang Zhisong. Toward a Unified Logic Basis for Programming Languages. In R. E. A. Mason, editor, Information Processing 83, pages 425–429, Amsterdam, 1983. IFIP, Elsevier Science Publishers B.V. (North Holland).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Manchester, Oxford Road, M13 9PL, Manchester, UK

    Howard Barringer, Michael Fisher & Graham Gough

  2. Department of Computing, Imperial College of Science, Technology and Medicine, 180 Queen's Gate, SW7 2BZ, London, UK

    Dov Gabbay & Richard Owens

Authors
  1. Howard Barringer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Fisher
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dov Gabbay
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Graham Gough
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Richard Owens
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. W. de Bakker W. -P. de Roever G. Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barringer, H., Fisher, M., Gabbay, D., Gough, G., Owens, R. (1990). MetateM: A framework for programming in temporal logic. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds) Stepwise Refinement of Distributed Systems Models, Formalisms, Correctness. REX 1989. Lecture Notes in Computer Science, vol 430. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52559-9_62

Download citation

  • DOI: https://doi.org/10.1007/3-540-52559-9_62

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52559-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation