{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T03:36:59Z","timestamp":1649216219382},"reference-count":59,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8233,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1991]]},"DOI":"10.1016\/0304-3975(91)90386-g","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T17:17:57Z","timestamp":1032283077000},"page":"125-151","source":"Crossref","is-referenced-by-count":7,"title":["On the strength of temporal proofs"],"prefix":"10.1016","volume":"80","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":"78","reference":[{"key":"10.1016\/0304-3975(91)90386-G_BIB1","first-page":"123","article-title":"The power of temporal proofs","author":"Abadi","year":"1987","journal-title":"Proc. 2nd Ann. IEEE Symp. on Logic in Computer Science"},{"key":"10.1016\/0304-3975(91)90386-G_BIB2","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0304-3975(89)90138-2","article-title":"The power of temporal proofs","volume":"64","author":"Abadi","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90386-G_BIB3","series-title":"Dissertation","article-title":"Temporal-logic theorem proving","author":"Abadi","year":"1987"},{"key":"10.1016\/0304-3975(91)90386-G_BIB4","author":"Abadi","year":"1989","journal-title":"Temporal logic was incomplete only temporarily"},{"key":"10.1016\/0304-3975(91)90386-G_BIB5","first-page":"176","article-title":"A timely resolution","author":"Abadi","year":"1986","journal-title":"1st Ann. Symp. on Logic in Computer Science"},{"key":"10.1016\/0304-3975(91)90386-G_BIB6","series-title":"Plans to improve our program verifier program (in Hungarian)","author":"Andr\u00e9ka","year":"1974"},{"key":"10.1016\/0304-3975(91)90386-G_BIB7","unstructured":"H. Andr\u00e9ka, V. Gorenko, I. N\u00e9meti and I. Sain, Effective temporal logics of programs, manuscript in preparation."},{"issue":"3","key":"10.1016\/0304-3975(91)90386-G_BIB8","first-page":"115","article-title":"Completeness of Floyd logic","volume":"7","author":"Andr\u00e9ka","year":"1978","journal-title":"Bull. Section of Logic (Wroc\u0142aw)"},{"key":"10.1016\/0304-3975(91)90386-G_BIB9","first-page":"18","article-title":"Henkin-type semantics for program schemes to turn negative results to positive","volume":"2","author":"Andr\u00e9ka","year":"1979"},{"issue":"2,3","key":"10.1016\/0304-3975(91)90386-G_BIB10_1","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0304-3975(82)90004-4","article-title":"A complete logic for reasoning about programs via nonstandard model theory, Parts I\u2013II","volume":"17","author":"Andr\u00e9ka","year":"1982","journal-title":"Theoret. Comput. Sci."},{"issue":"2,3","key":"10.1016\/0304-3975(91)90386-G_BIB10_2","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0304-3975(82)90025-1","article-title":"A complete logic for reasoning about programs via nonstandard model theory, Parts I\u2013II","volume":"17","author":"Andr\u00e9ka","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90386-G_BIB11","series-title":"Mathematical Foundations of Computer Science","first-page":"135","article-title":"On the strength of temporal proofs (extended abstract)","volume":"379","author":"Andr\u00e9ka","year":"1989"},{"key":"10.1016\/0304-3975(91)90386-G_BIB13","series-title":"Handbook of Mathematical Logic","year":"1977"},{"key":"10.1016\/0304-3975(91)90386-G_BIB14","unstructured":"B. Bir\u00f3 and I. Sain, Peano arithmetic for the time scale of nonstandard models for logics of programs, Ann. Pure Appl. Logic, to appear."},{"key":"10.1016\/0304-3975(91)90386-G_BIB15","first-page":"68","article-title":"First order programming logic","author":"Cartwright","year":"1979","journal-title":"Proc. 6th Ann. ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(91)90386-G_BIB16","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0304-3975(81)90076-1","article-title":"Programs and program verification in a general setting","volume":"16","author":"Csirmaz","year":"1981","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/0304-3975(91)90386-G_BIB17","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1305\/ndjfl\/1093870760","article-title":"A completeness theorem for dynamic logic","volume":"26","author":"Csirmaz","year":"1985","journal-title":"Notre Dame J. Formal Logic"},{"key":"10.1016\/0304-3975(91)90386-G_BIB18","first-page":"324","article-title":"A property of 2-sorted Peano models and program verification","volume":"30","author":"Csirmaz","year":"1984","journal-title":"Z. Math. Logic Grundlagen Math."},{"key":"10.1016\/0304-3975(91)90386-G_BIB19","volume":"II","year":"1984"},{"key":"10.1016\/0304-3975(91)90386-G_BIB20","first-page":"163","article-title":"On the temporal analysis of fairness","author":"Gabbay","year":"1980","journal-title":"Proc. 7th Ann. ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(91)90386-G_BIB21","first-page":"355","article-title":"First-order programming theories","author":"Gergely","year":"1991","journal-title":"SZ\u00c1MALK Technical Report Budapest"},{"key":"10.1016\/0304-3975(91)90386-G_BIB22","article-title":"Logics of time and computation","volume":"7","author":"Goldblatt","year":"1987","journal-title":"Center for the Study of Language and Information, Lecture Notes"},{"key":"10.1016\/0304-3975(91)90386-G_BIB23","first-page":"443","article-title":"Some conservativeness results for nonstandard dynamic logic","volume":"42","author":"H\u00e1jek","year":"1986"},{"key":"10.1016\/0304-3975(91)90386-G_BIB24","article-title":"First-Order Dynamic Logic","volume":"68","author":"Harel","year":"1979"},{"key":"10.1016\/0304-3975(91)90386-G_BIB25","series-title":"Cylindric Algebras Part II","author":"Henkin","year":"1985"},{"key":"10.1016\/0304-3975(91)90386-G_BIB26","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1111\/j.1755-2567.1971.tb00071.x","article-title":"Formal properties of \u201cNow\u201d","volume":"37","author":"Kamp","year":"1971","journal-title":"Theoria"},{"key":"10.1016\/0304-3975(91)90386-G_BIB27","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0019-9958(75)90415-5","article-title":"On the termination of program schemes","volume":"29","author":"Kfoury","year":"1975","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(91)90386-G_BIB28","article-title":"Temporal logic of programs","author":"Kr\u00f6ger","year":"1988","journal-title":"EATCS Monographs on Theoretical Computer Science"},{"key":"10.1016\/0304-3975(91)90386-G_BIB29","first-page":"132","article-title":"Logical and mathematical reasoning about imperative programs","author":"Leivant","year":"1985","journal-title":"Proc. 12th Ann. ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(91)90386-G_BIB30","series-title":"Proc. Coll. Logics of Programs","first-page":"196","article-title":"The glory of the past","volume":"193","author":"Lichtenstein","year":"1985"},{"key":"10.1016\/0304-3975(91)90386-G_BIB31","first-page":"44","article-title":"Standard versus nonstandard semantics in logics for functional programs","author":"Luezas","year":"1989"},{"key":"10.1016\/0304-3975(91)90386-G_BIB32","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0304-3975(89)90156-4","article-title":"Weak second order characterizations of various program verification systems","volume":"66","author":"Makowsky","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90386-G_BIB33","series-title":"Internat. Coll. on Automata, Languages and Programming '79","first-page":"385","article-title":"The modal logic of programs","volume":"71","author":"Manna","year":"1979"},{"key":"10.1016\/0304-3975(91)90386-G_BIB34","series-title":"Report No. STAN-CS-83\u2013967","article-title":"Verification of concurrent programs: A temporal proof system","author":"Manna","year":"1983"},{"key":"10.1016\/0304-3975(91)90386-G_BIB35","series-title":"Tech. Report STAN-CS-87\u20131186","article-title":"A hierarchy of temporal properties","author":"Manna","year":"1987"},{"key":"10.1016\/0304-3975(91)90386-G_BIB36","first-page":"311","article-title":"Nonstandard dynamic logic","volume":"131","author":"N\u00e9meti","year":"1982"},{"key":"10.1016\/0304-3975(91)90386-G_BIB37","first-page":"177","article-title":"A decidability result for second order process logic","author":"Parikh","year":"1978","journal-title":"IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(91)90386-G_BIB38","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0747-7171(86)80013-X","article-title":"Non-standard algorithmic and dynamic logic","volume":"2","author":"Pasztor","year":"1986","journal-title":"J. Symbolic Comput."},{"issue":"1","key":"10.1016\/0304-3975(91)90386-G_BIB39","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0304-3975(90)90156-C","article-title":"Recursive programs and denotational semantics in absolute logics of programs","volume":"70","author":"Pasztor","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90386-G_BIB40","article-title":"A streamlined temporal completeness theorem","volume":"440","author":"Pasztor","year":"1990"},{"key":"10.1016\/0304-3975(91)90386-G_BIB41","series-title":"Information Processing (IFIP '86)","first-page":"845","article-title":"Specification and development of reactive systems","author":"Pnueli","year":"1986"},{"key":"10.1016\/0304-3975(91)90386-G_BIB42","series-title":"Algebra, Combinatorics, and Logic in Computer Science","first-page":"667","article-title":"Nonstandard computation theory","volume":"42","author":"Richter","year":"1986"},{"key":"10.1016\/0304-3975(91)90386-G_BIB43","first-page":"195","article-title":"There are general rules for specifying semantics: Observations on Abstract Model Theory","volume":"XIII","author":"Sain","year":"1979","journal-title":"Computational Linguistics and Computer Languages"},{"issue":"2","key":"10.1016\/0304-3975(91)90386-G_BIB44","first-page":"64","article-title":"Total correctness in nonstandard dynamic logic","volume":"12","author":"Sain","year":"1983","journal-title":"Bull. Section Logic"},{"key":"10.1016\/0304-3975(91)90386-G_BIB45","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1002\/malq.19840303102","article-title":"Structural nonstandard dynamic logic","volume":"30","author":"Sain","year":"1984","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"10.1016\/0304-3975(91)90386-G_BIB46","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0304-3975(85)90024-6","article-title":"A simple proof for completeness of Floyd method","volume":"35","author":"Sain","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90386-G_BIB47","article-title":"Relative program verifying powers of the various temporal logics","author":"Sain","year":"1985","journal-title":"Math. Inst. Hungar. Acad. Sci."},{"key":"10.1016\/0304-3975(91)90386-G_BIB48","first-page":"302","article-title":"The reasoning powers of Burstall's (modal logic) and Pnueli's (temporal logic) program verification methods","volume":"193","author":"Sain","year":"1985"},{"key":"10.1016\/0304-3975(91)90386-G_BIB49","series-title":"Dissertation","article-title":"Nonstandard logics of programs","author":"Sain","year":"1986"},{"key":"10.1016\/0304-3975(91)90386-G_BIB50","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0304-3975(87)90118-6","article-title":"Total correctness of nonstandard logics of programs","volume":"50","author":"Sain","year":"1987","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/0304-3975(91)90386-G_BIB51","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1305\/ndjfl\/1093635239","article-title":"An elementary proof for some semantic characterizations of nondeterministic Floyd-Hoare logic","volume":"30","author":"Sain","year":"1989","journal-title":"Notre Dame J. Formal Logic"},{"key":"10.1016\/0304-3975(91)90386-G_BIB52","series-title":"Many Sorted Logic and its Applications","article-title":"Comparing and characterizing the power of established program verification methods","author":"Sain","year":"1988"},{"key":"10.1016\/0304-3975(91)90386-G_BIB54","article-title":"Temporal logics need their clocks","author":"Sain","year":"1989","journal-title":"Math. Inst. Hungar. Acad. Sci."},{"key":"10.1016\/0304-3975(91)90386-G_BIB55","article-title":"Computer science temporal logics need clocks","author":"Sain","year":"1989","journal-title":"Abstracts of the AMS"},{"issue":"4","key":"10.1016\/0304-3975(91)90386-G_BIB56","first-page":"153","article-title":"Computer science temporal logics need their clocks","volume":"18","author":"Sain","year":"1989","journal-title":"Bull. Section Logic"},{"key":"10.1016\/0304-3975(91)90386-G_BIB57","first-page":"208","article-title":"Completeness problems in verification of programs and program schemes","volume":"74","author":"Andr\u00e9ka","year":"1979"},{"key":"10.1016\/0304-3975(91)90386-G_BIB58","series-title":"DIMACS Tech. Report 90-28","article-title":"Induction and Peano models","author":"Csirmaz","year":"1990"},{"key":"10.1016\/0304-3975(91)90386-G_BIB59","unstructured":"J. Kraji\u010dek, Letter to the present authors, 1989."},{"key":"10.1016\/0304-3975(91)90386-G_BIB60","series-title":"Aspects and Prospects of Theoretical Computer Science","first-page":"80","article-title":"Past proves more invariance properties but not pca's","volume":"464","author":"Sain","year":"1990"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190386G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190386G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T15:56:06Z","timestamp":1554825366000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759190386G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"references-count":59,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991]]}},"alternative-id":["030439759190386G"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90386-g","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991]]}}}