Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1984: Mathematical Foundations of Computer Science 1984 pp 301–311Cite as

The power of the future perfect in program logics

  • Communications
  • Conference paper
  • First Online:

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

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. K. Abrahamson, ‘Modal logic of concurrent nondeterministic programs’ LNCS Vol. 70, pp. 21–33 (1979).

    Google Scholar 

  2. M. Ben-Ari, Z. Manna, A. Pnueli, ‘The temporal logic of branching time', pp. 164–176, POPL (1981).

    Google Scholar 

  3. S. Brookes, W. Rounds, ‘Behaviour equivalence relations induced by programming logics', LNCS Vol. 154, pp. 97–108 (1983).

    Google Scholar 

  4. R.A. Bull, ‘An approach to tense logic', pp. 282–300, Theoria (1970).

    Google Scholar 

  5. E.M. Clarke, E.A. Emerson, A.P. Sistla, ‘Automatic verification of finite state concurrent systems using temporal logic specifications: a practical approach', pp. 107–126, POPL Proc. (1983).

    Google Scholar 

  6. G. Costa, C. Stirling, ‘A fair calculus of communicating systems', LNCS Vol. 158, pp. 94–105 (1983).

    Google Scholar 

  7. E.A. Emerson, J.Y. Halpern, 'sometimes and not never revisited: on branching versus linear time', pp. 127–140, POPL Proceedings (1983).

    Google Scholar 

  8. D. Gabbay, A. Pnueli, S. Shelah, J. Stavi, ‘On the temporal analysis of fairness', pp. 163–173, POPL Proceedings (1980).

    Google Scholar 

  9. M. Hennessy, ‘Axiomatizing finite delay operators', Technical Report CSR-124-82, Dept. of Computer Science, Edinburgh (1982). To appear in Acta Informatica.

    Google Scholar 

  10. M. Hennessy, ‘Modelling finite delay operators', Technical Report CSR-153-83, Dept. of Computer Science, Edinburgh (1983).

    Google Scholar 

  11. D. Harel, D. Kozen, R. Parikh, ‘Process logic: expressiveness, decidability, completeness', JCSS, pp. 144–170 (1982).

    Google Scholar 

  12. M. Hennessy, R. Milner, ‘On observing nondeterminism and concurrency', LNCS Vol. 85, pp. 299–309 (1980).

    Google Scholar 

  13. M. Hennessy, R. Milner, ‘Algebraic laws for Nondeterminism and Concurrency, Technical Report CSR-133-83, Dept. of Computer Science, Edinburgh (1983).

    Google Scholar 

  14. H. Kamp, Tense logic and the theory of linear order Ph.D. thesis, UCLA (1968).

    Google Scholar 

  15. H. Kamp, ‘Formal properties of now', pp. 227–273, Theoria (1971).

    Google Scholar 

  16. R. Keller, ‘A fundamental theorem of asynchronous parallel computation’ in Parallel Processing ed. T.Y. Feng, Springer (1975).

    Google Scholar 

  17. R. Koymans, J. Vytopil, W. de Roever, ‘Real time programming and asynchronous message passing', Technical Report RUU-CS-83-9, Rijksuniversiteit, Utrecht (1983).

    Google Scholar 

  18. L. Lamport, ‘"Sometime" is sometimes "Not Never"', POPL Proc., pp. 174–185 (1980).

    Google Scholar 

  19. D. Lehmann, A. Pnueli, J. Stavi, ‘Impartiality, justic and fairness: the ethics of concurrent termination', LNCS Vol. 115, pp. 264–277 (1981).

    Google Scholar 

  20. R. Milner, A calculus of communicating systems, LNCS Vol. 92 (1980).

    Google Scholar 

  21. R. Milner, ‘A modal characterisation of observable machinebehaviour’ LNCS Vol. 112, pp. 25–34 (1981).

    Google Scholar 

  22. R. Milner ‘Calculi for synchrony and asynchrony', TCS, pp. 267–310 (1983).

    Google Scholar 

  23. R. Milner, ‘A finite delay operator in synchronous CCS', Technical Report CSR-116-82, Dept. of Computer Science, Edinburgh (1982).

    Google Scholar 

  24. E. Moore, ‘Gedanken-experiments on sequential machines', Automata Studies, edited by C.E. Shannon and J. McCarthy, Princeton University Press, pp. 129–153 (1956).

    Google Scholar 

  25. Z. Manna, A. Pnueli, ‘How to cook a temporal proof system for your pet language', POPL Proceedings, pp. 141–154 (1983).

    Google Scholar 

  26. S. Owicki, L. Lamport, ‘Proving liveness properties of concurrent programs', ACM Transactions on Programming Languages and Systems, pp. 455–495 (1982).

    Google Scholar 

  27. D. Park, ‘Concurrency and automata on infinite sequences', LNCS Vol. 104 (1981).

    Google Scholar 

  28. D. Park, ‘A predicate transformer for weak iteration', in Proceedings 6th IBM Symposium on Mathematical Foundations of Computer Science, Hakone, Japan (1981).

    Google Scholar 

  29. G. Plotkin, ‘A structural approach to operational semantics', Lecture Notes, Aarhus University (1981).

    Google Scholar 

  30. A. Pnueli, ‘The temporal semantics of concurrent programs’ LNCS Vol. 70, pp. 1–20 (1979).

    Google Scholar 

  31. A. Prior Past, Present and Future, Oxford (1967).

    Google Scholar 

  32. J.P. Queille, J. Sifakis, ‘Fairness and related properties in transition systems', Technical Report RR292, IMAG (1982).

    Google Scholar 

  33. J. Sifakis, ‘A unified approach for studying the properties of transition systems', TCS pp. 227–258 (1982).

    Google Scholar 

  34. J. Sifakis, ‘Property presserving homomorphisms of transition systems', Technical Report, IMAG (1982).

    Google Scholar 

  35. C. Stirling, ‘A proof theoretic characterization of observational equivalence'. Proc. of FCT-TCS Bangalore (1983).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Edinburgh, EH9 3JZ, Edinburgh, Scotland

    M. Hennessy & C. Stirling

Authors
  1. M. Hennessy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. Stirling
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. P. Chytil V. Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hennessy, M., Stirling, C. (1984). The power of the future perfect in program logics. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030311

Download citation

  • DOI: https://doi.org/10.1007/BFb0030311

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13372-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation