{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:28Z","timestamp":1725663208056},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540514862"},{"type":"electronic","value":"9783540481768"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51486-4_61","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:59:55Z","timestamp":1330185595000},"page":"135-144","source":"Crossref","is-referenced-by-count":9,"title":["On the strength of temporal proofs"],"prefix":"10.1007","author":[{"given":"Hajnal","family":"Andr\u00e9ka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Istv\u00e1n","family":"N\u00e9meti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ildik\u00f3","family":"Sain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"9_CR1","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, Full version of this is: The power of temporal proofs, preprint of Digital Systems Research Center, 1988."},{"key":"9_CR2","unstructured":"M.Abadi, Temporal logic was incomplete only temporarily, Preprint (1989)."},{"key":"9_CR3","unstructured":"M.Abadi and Z.Manna, A timely resolution, First Annual Symposium on Logic in Computer Science (1986), 176\u2013189."},{"key":"9_CR4","unstructured":"H.Andr\u00e9ka, K.Balogh, K.L\u00e1badi, I.N\u00e9meti, P.T\u00f3th, Plans to improve our program verifier program (in Hungarian), Working Paper, NIM IG\u00dcSZI, Dept. of Software Techniques, Budapest (1974)."},{"issue":"2","key":"9_CR5","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":"9_CR6","unstructured":"H.Andr\u00e9ka, I.N\u00e9meti, and I.Sain, Temporal logics of programs with \u201cbinary\u201d modalities, Extended abstract (1989)."},{"key":"9_CR7","unstructured":"J.Barwise (ed), Handbook of Mathematical Logic, North-Holland (1977)."},{"key":"9_CR8","unstructured":"B.Bir\u00f3 and I.Sain, Peano Arithmetic for the Time Scale of Nonstandard Models for Logics of Programs, Annals of Pure and Applied Logic, to appear."},{"key":"9_CR9","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0304-3975(81)90076-1","volume":"16","author":"L. Csirmaz","year":"1981","unstructured":"L. Csirmaz, Programs and program verification in a general setting, Theoretical Computer Science Vol 16 (1981), 199\u2013210.","journal-title":"Theoretical Computer Science"},{"key":"9_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":"9_CR11","unstructured":"T.Gergely and L.\u00dary, First order programming theories, SZ\u00c1MALK Technical Report Budapest (1989), 232pp."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"D.Gabbay, A.Pnueli, S.Shelah, J.Stavi, On the temporal analysis of fairness, Preprint Weizman Institute of Science, Dept. of Applied Math. (1981).","DOI":"10.1145\/567446.567462"},{"key":"9_CR13","unstructured":"R.Goldblatt, Logics of time and computation, Center for the Study of Language and Information, Lecture Notes Number 7 (1987)."},{"key":"9_CR14","first-page":"443","volume":"42","author":"P. H\u00e1jek","year":"1986","unstructured":"P. H\u00e1jek, Some conservativeness results for nonstandard dynamic logic, In: Algebra, combinatorics, and logic in computer science, Proc. Conf. Gy\u0151r Hungary 1983 (eds: J.Demetrovics, G.Katona, A.Salomaa), Colloq. Math. Soc. J. Bolyai Vol 42, North-Holland (1986), 443\u2013449.","journal-title":"Colloq. Math. Soc. J. Bolyai"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"D.Harel, First order dynamic logic, Springer Lecture Notes in Computer Science Vol 68 (1979).","DOI":"10.1007\/3-540-09237-4"},{"key":"9_CR16","unstructured":"L.Henkin, J.D.Monk, and A.Tarski, Cylindric Algebras Part II, North-Holland (1985)."},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-15648-8_16","volume":"193","author":"O. Lichtenstein","year":"1985","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.","journal-title":"Springer Lecture Notes in Comp. Sci."},{"key":"9_CR18","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":"Springer Lecture Notes in Computer Science"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Z.Manna and A. Pnueli, A hierarchy of temporal properties, preprint (1986).","DOI":"10.1145\/41840.41857"},{"key":"9_CR20","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1145\/359340.359353","volume":"21","author":"Z. Manna","year":"1978","unstructured":"Z. Manna and R. Waldinger, Is \u201csometime\u201d sometimes better than \u201calways\u201d?, Comm. ACM Vol 21 (1978), 159\u2013172.","journal-title":"Comm. ACM"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"R.Parikh, A decidability result for second order process logic, IEEE Symposium on Foundation of Computer Science (1978), 177\u2013183.","DOI":"10.1109\/SFCS.1978.2"},{"key":"9_CR22","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":"9_CR23","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 and CL (Computational Linguistics and Computer Languages) Vol XIII (1979), 195\u2013250.","journal-title":"CL and CL (Computational Linguistics and Computer Languages)"},{"issue":"3","key":"9_CR24","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1002\/malq.19840303102","volume":"30","author":"I. Sain","year":"1984","unstructured":"I. Sain, Structured Nonstandard Dynamic Logic, Zeitschrift f\u00fcr Math. Logic u. Grundlagen der Math. Heft 3, Band 30 (1984), 481\u2013497.","journal-title":"Zeitschrift f\u00fcr Math. Logic u. Grundlagen der Math."},{"key":"9_CR25","volume-title":"Nonstandard Logics of Programs","author":"I. Sain","year":"1986","unstructured":"I. Sain, Nonstandard Logics of Programs, Dissertation, Hungarian Academy od Sciences, Budapest (in Hungarian) (1986)."},{"key":"9_CR26","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0304-3975(87)90118-6","volume":"50","author":"I. Sain","year":"1987","unstructured":"I. Sain, Total correctness in nonstandard logics of programs, Theoretical Computer Science Vol 50 (1987), 285\u2013321.","journal-title":"Theoretical Computer Science"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"I.Sain, Elementary proof for some semantic characterizations of nondeterministic Floyd-Hoare logic, Notre Dame Journal of Formal Logic, to appear (1989).","DOI":"10.1305\/ndjfl\/1093635239"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1989"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51486-4_61.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:21:20Z","timestamp":1605630080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51486-4_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514862","9783540481768"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-51486-4_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}