{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:27Z","timestamp":1725456747610},"publisher-location":"Berlin\/Heidelberg","reference-count":24,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029645","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:33:46Z","timestamp":1133415226000},"page":"478-484","source":"Crossref","is-referenced-by-count":0,"title":["Results on the glory of the past"],"prefix":"10.1007","author":[{"given":"Ildik\u00f3","family":"Sain","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"54_CR1","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0304-3975(89)90138-2","volume":"64","author":"M. Abadi","year":"1989","unstructured":"M. Abadi, The power of temporal proofs, Theoretical Computer Science Vol 64 (1989), 35\u201384.","journal-title":"Theoretical Computer Science"},{"key":"54_CR2","unstructured":"M.Abadi, corrections to \u201cThe power of temporal proofs\u201d, Theoretical Computer Science (to appear)."},{"key":"54_CR3","unstructured":"M.Abadi, The power of temporal proofs, Proceedings of the Second Annual IEEE Symposium on Logic in Computer Science, Ithaca, NY, USA; (1987), 123\u2013130."},{"key":"54_CR4","unstructured":"M.Abadi and Z.Manna, A timely resolution, First Annual Symposium on Logic in Computer Science (1986), 176\u2013189."},{"key":"54_CR5","first-page":"18","volume-title":"Fundamentals of Computation Theory'79","author":"H. Andr\u00e9ka","year":"1979","unstructured":"H. Andr\u00e9ka, I. N\u00e9meti 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\u201324."},{"issue":"23","key":"54_CR6","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0304-3975(82)90004-4","volume":"17","author":"H. Andr\u00e9ka","year":"1982","unstructured":"H. Andr\u00e9ka, I. N\u00e9meti and I. Sain, A complete logic for reasoning about programs via nonstandard model theory, Parts I\u2013II, Theoretical Computer Science Vol 17 Nos 2, 3 (1982), 193\u2013212 and 259\u2013278.","journal-title":"Theoretical Computer Science"},{"key":"54_CR7","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/3-540-51486-4_61","volume":"379","author":"H. Andr\u00e9ka","year":"1989","unstructured":"H. Andr\u00e9ka, I. N\u00e9meti, 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\u2013144.","journal-title":"Springer Lecture Notes in Comp. Sci."},{"key":"54_CR8","unstructured":"H.Andr\u00e9ka, I.N\u00e9meti, and I.Sain, On the strength of temporal proofs, Theoretical Computer Science (an extended abstract of this is [7]) (to appear)."},{"key":"54_CR9","unstructured":"J.Barwise (ed.), Handbook of Mathematical Logic, North-Holland (1977)."},{"key":"54_CR10","doi-asserted-by":"crossref","unstructured":"D.Gabbay and F.Guenther (eds), Handbook of philosophical logic, D.Reidel Publ. Co. Vol II (1984).","DOI":"10.1007\/978-94-009-6259-0"},{"key":"54_CR11","doi-asserted-by":"crossref","unstructured":"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).","DOI":"10.1145\/567446.567462"},{"key":"54_CR12","unstructured":"R.Goldblatt, Logics of time and computation, Center for the Study of Language and Information, Lecture Notes Number 7 (1987)."},{"key":"54_CR13","unstructured":"V.Goranko, Letter to I.N\u00e9meti, August 27, 1989."},{"key":"54_CR14","unstructured":"L.Henkin, J.D.Monk, and A.Tarski, Cylindric Algebras Part II, North-Holland (1985)."},{"key":"54_CR15","doi-asserted-by":"crossref","unstructured":"F.Kr\u00f6ger, Temporal logic of programs, EATCS Monographs on Theoretical Computer Science (1988).","DOI":"10.1007\/978-3-642-71549-5"},{"key":"54_CR16","doi-asserted-by":"crossref","unstructured":"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\u2013218.","DOI":"10.1007\/3-540-15648-8_16"},{"key":"54_CR17","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/3-540-09510-1_31","volume":"71","author":"Z. Manna","year":"1979","unstructured":"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\u2013409.","journal-title":"Graz, Springer Lecture Notes in Computer Science"},{"key":"54_CR18","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BFb0025789","volume":"131","author":"I. N\u00e9meti","year":"1982","unstructured":"I. N\u00e9meti, 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\u2013348.","journal-title":"Springer Lecture Notes in Computer Science"},{"key":"54_CR19","unstructured":"A.Pnueli, Specification and development of reactive systems, Information Processing (IFIP'86), H.-J. Kugler (ed.) North-Holland Vol 86 (1986), 845\u2013858."},{"key":"54_CR20","first-page":"195","volume":"XIII","author":"I. Sain","year":"1979","unstructured":"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\u2013250.","journal-title":"Computational Linguistics and Computer Languages"},{"key":"54_CR21","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/3-540-15648-8_24","volume":"193","author":"I. Sain","year":"1985","unstructured":"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\u2013319.","journal-title":"Springer Lecture Notes in Computer Science"},{"key":"54_CR22","volume-title":"Nonstandard Logics of Programs","author":"I. Sain","year":"1986","unstructured":"I. Sain, Nonstandard Logics of Programs, Dissertation, Hungarian Academy of Sciences, Budapest (in Hungarian) (1986)."},{"key":"54_CR23","unstructured":"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)."},{"key":"54_CR24","doi-asserted-by":"crossref","unstructured":"I.Sain, Temporal logics need their clocks, Theoretical Computer Science (to appear).","DOI":"10.1016\/0304-3975(92)90067-P"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029645","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:15:32Z","timestamp":1586592932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029645"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/bfb0029645","relation":{},"subject":[]}}