Skip to main content
SpringerLink
Log in

Results on the glory of the past

  • Communications
  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Computer Science 1990 (MFCS 1990)

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

  • 755 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abadi, The power of temporal proofs, Theoretical Computer Science Vol 64 (1989), 35–84.

    Google Scholar 

  2. M.Abadi, corrections to “The power of temporal proofs”, Theoretical Computer Science (to appear).

    Google Scholar 

  3. M.Abadi, The power of temporal proofs, Proceedings of the Second Annual IEEE Symposium on Logic in Computer Science, Ithaca, NY, USA; (1987), 123–130.

    Google Scholar 

  4. M.Abadi and Z.Manna, A timely resolution, First Annual Symposium on Logic in Computer Science (1986), 176–189.

    Google Scholar 

  5. H. Andréka, I. Németi and I. Sain, Henkin-type semantics for program schemes to turn negative results to positive, In: Fundamentals of Computation Theory'79, ed.: L. Budach (Proc. Conf. Berlin 1979) Akademie Verlag, Berlin Band 2 (1979), 18–24.

    Google Scholar 

  6. H. Andréka, I. Németi and I. Sain, A complete logic for reasoning about programs via nonstandard model theory, Parts I–II, Theoretical Computer Science Vol 17 Nos 2, 3 (1982), 193–212 and 259–278.

    Google Scholar 

  7. H. Andréka, I. Németi, and I. Sain, On the strength of temporal proofs (extended abstract), In: Mathematical Foundations of Computer Science 1989 (eds: A.Kreczmar and G.Mirkowska), Springer Lecture Notes in Comp. Sci. Vol 379 (1989), 135–144.

    Google Scholar 

  8. H.Andréka, I.Németi, and I.Sain, On the strength of temporal proofs, Theoretical Computer Science (an extended abstract of this is [7]) (to appear).

    Google Scholar 

  9. J.Barwise (ed.), Handbook of Mathematical Logic, North-Holland (1977).

    Google Scholar 

  10. D.Gabbay and F.Guenther (eds), Handbook of philosophical logic, D.Reidel Publ. Co. Vol II (1984).

    Google Scholar 

  11. D.Gabbay, A.Pnueli, S.Shelah and J.Stavi, On the temporal analysis of fairness, Preprint Weizman Institute of Science, Dept. of Applied Math. (1981).

    Google Scholar 

  12. R.Goldblatt, Logics of time and computation, Center for the Study of Language and Information, Lecture Notes Number 7 (1987).

    Google Scholar 

  13. V.Goranko, Letter to I.Németi, August 27, 1989.

    Google Scholar 

  14. L.Henkin, J.D.Monk, and A.Tarski, Cylindric Algebras Part II, North-Holland (1985).

    Google Scholar 

  15. F.Kröger, Temporal logic of programs, EATCS Monographs on Theoretical Computer Science (1988).

    Google Scholar 

  16. O. Lichtenstein, A. Pnueli, and L. Zuck, The glory of the past, Proc. Coll Logics of Programs, Brooklyn, USA, Springer Lecture Notes in Comp. Sci. (ed.: R.Parikh) Vol 193 (1985), 196–218.

    Google Scholar 

  17. Z. Manna and A. Pnueli, The modal logic of programs, International Colloquium on Automata, Languages and Programming'79, Graz, Springer Lecture Notes in Computer Science Vol 71 (1979), 385–409.

    Google Scholar 

  18. I. Németi, Nonstandard Dynamic Logic, In: Logics of Programs, Proc. Conf. New York 1981 (ed.: D.Kozen), Springer Lecture Notes in Computer Science Vol 131 (1982), 311–348.

    Google Scholar 

  19. A.Pnueli, Specification and development of reactive systems, Information Processing (IFIP'86), H.-J. Kugler (ed.) North-Holland Vol 86 (1986), 845–858.

    Google Scholar 

  20. I. Sain, There are general rules for specifying semantics: Observations on Abstract Model Theory, CL&CL (Computational Linguistics and Computer Languages) Vol XIII (1979), 195–250.

    Google Scholar 

  21. I. Sain, The reasoning powers of Burstall's (modal logic) and Pnueli's (temporal logic) program verification methods, In: Logics of Programs, Proc. Conf. Brooklyn USA 1985 (Ed.: R.Parikh), Springer Lecture Notes in Computer Science Vol 193 (1985), 302–319.

    Google Scholar 

  22. I. Sain, Nonstandard Logics of Programs, Dissertation, Hungarian Academy of Sciences, Budapest (in Hungarian) (1986).

    Google Scholar 

  23. I.Sain, Comparing and characterizing the power of established program verification methods, In: Many Sorted Logic and its Applications (Ed.: J.Tucker), Proc. Conf. Leeds, Great Britain 1988 (to appear).

    Google Scholar 

  24. I.Sain, Temporal logics need their clocks, Theoretical Computer Science (to appear).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute of the Hungarian Academy of Sciences, Pf. 127, H-1364, Budapest, Hungary

    Ildikó Sain

Authors
  1. Ildikó Sain
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Branislav Rovan

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sain, I. (1990). Results on the glory of the past. In: Rovan, B. (eds) Mathematical Foundations of Computer Science 1990. MFCS 1990. Lecture Notes in Computer Science, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029645

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47185-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation