Skip to main content
SpringerLink
Log in
Book cover

International Meeting of Young Computer Scientists

IMYCS 1990: Aspects and Prospects of Theoretical Computer Science pp 80–92Cite as

Past proves more invariance properties but not pca's

  • Part II Invited Lectures
  • Conference paper
  • First Online:

  • 124 Accesses

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

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, 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, V. Goranko, I.Németi, and I.Sain, Effective first order temporal logics, In preparation.

    Google Scholar 

  6. 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 

  7. 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 

  8. 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 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  12. 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 

  13. J.Garson, Quantification in modal logic, in: D.Gabbay and F.Guenthner (eds.), Handbook of philosophical logic, D.Reidel Publ. Co. (1984).

    Google Scholar 

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

    Google Scholar 

  15. V.Goranko, Letter to I.Németi, July 9, 1990.

    Google Scholar 

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

    Google Scholar 

  17. 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 

  18. 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 

  19. 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 

  20. 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 

  21. 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 

  22. 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 

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

    Google Scholar 

  24. 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 

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

    Google Scholar 

  26. I.Sain, Results on the glory of the past, Proc. Mathematical Foundations of Computer Science'90, Springer Lecture Notes in 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

Jürgen Dassow Jozef Kelemen

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sain, I. (1990). Past proves more invariance properties but not pca's. In: Dassow, J., Kelemen, J. (eds) Aspects and Prospects of Theoretical Computer Science. IMYCS 1990. Lecture Notes in Computer Science, vol 464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53414-8_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-53414-8_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53414-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation