This work has been supported by the Hungarian National Foundation for Scientific Research Grant No 1810.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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, Full version of this is: The power of temporal proofs, preprint of Digital Systems Research Center, 1988.
M.Abadi, Temporal logic was incomplete only temporarily, Preprint (1989).
M.Abadi and Z.Manna, A timely resolution, First Annual Symposium on Logic in Computer Science (1986), 176–189.
H.Andréka, K.Balogh, K.Lábadi, I.Németi, P.Tóth, Plans to improve our program verifier program (in Hungarian), Working Paper, NIM IGÜSZI, Dept. of Software Techniques, Budapest (1974).
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.
H.Andréka, I.Németi, and I.Sain, Temporal logics of programs with “binary” modalities, Extended abstract (1989).
J.Barwise (ed), Handbook of Mathematical Logic, North-Holland (1977).
B.Biró and I.Sain, Peano Arithmetic for the Time Scale of Nonstandard Models for Logics of Programs, Annals of Pure and Applied Logic, to appear.
L. Csirmaz, Programs and program verification in a general setting, Theoretical Computer Science Vol 16 (1981), 199–210.
D.Gabbay and F.Guenther (eds), Handbook of philosophical logic, D.Reidel Publ. Co. Vol II (1984).
T.Gergely and L.Úry, First order programming theories, SZÁMALK Technical Report Budapest (1989), 232pp.
D.Gabbay, A.Pnueli, S.Shelah, J.Stavi, On the temporal analysis of fairness, Preprint Weizman Institute of Science, Dept. of Applied Math. (1981).
R.Goldblatt, Logics of time and computation, Center for the Study of Language and Information, Lecture Notes Number 7 (1987).
P. Hájek, Some conservativeness results for nonstandard dynamic logic, In: Algebra, combinatorics, and logic in computer science, Proc. Conf. Győr Hungary 1983 (eds: J.Demetrovics, G.Katona, A.Salomaa), Colloq. Math. Soc. J. Bolyai Vol 42, North-Holland (1986), 443–449.
D.Harel, First order dynamic logic, Springer Lecture Notes in Computer Science Vol 68 (1979).
L.Henkin, J.D.Monk, and A.Tarski, Cylindric Algebras Part II, North-Holland (1985).
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.
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.
Z.Manna and A. Pnueli, A hierarchy of temporal properties, preprint (1986).
Z. Manna and R. Waldinger, Is “sometime” sometimes better than “always”?, Comm. ACM Vol 21 (1978), 159–172.
R.Parikh, A decidability result for second order process logic, IEEE Symposium on Foundation of Computer Science (1978), 177–183.
A.Pnueli, Specification and development of reactive systems, Information Processing (IFIP'86), H.-J. Kugler (ed.) North-Holland Vol 86 (1986), 845–858.
I. Sain, There are general rules for specifying semantics: Observations on Abstract Model Theory, CL and CL (Computational Linguistics and Computer Languages) Vol XIII (1979), 195–250.
I. Sain, Structured Nonstandard Dynamic Logic, Zeitschrift für Math. Logic u. Grundlagen der Math. Heft 3, Band 30 (1984), 481–497.
I. Sain, Nonstandard Logics of Programs, Dissertation, Hungarian Academy od Sciences, Budapest (in Hungarian) (1986).
I. Sain, Total correctness in nonstandard logics of programs, Theoretical Computer Science Vol 50 (1987), 285–321.
I.Sain, Elementary proof for some semantic characterizations of nondeterministic Floyd-Hoare logic, Notre Dame Journal of Formal Logic, to appear (1989).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andréka, H., Németi, I., Sain, I. (1989). On the strength of temporal proofs. In: Kreczmar, A., Mirkowska, G. (eds) Mathematical Foundations of Computer Science 1989. MFCS 1989. Lecture Notes in Computer Science, vol 379. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51486-4_61
Download citation
DOI: https://doi.org/10.1007/3-540-51486-4_61
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51486-2
Online ISBN: 978-3-540-48176-8
eBook Packages: Springer Book Archive