{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T23:10:41Z","timestamp":1648941041857},"reference-count":33,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,11,1]],"date-time":"1989-11-01T00:00:00Z","timestamp":625881600000},"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":8659,"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":[[1989,11]]},"DOI":"10.1016\/0304-3975(89)90165-5","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T21:44:32Z","timestamp":1034286272000},"page":"277-302","source":"Crossref","is-referenced-by-count":0,"title":["Hoare's logic for nondeterministic regular programs: A nonstandard approach"],"prefix":"10.1016","volume":"68","author":[{"given":"M.Teresa","family":"Hortal\u00e1-Gonz\u00e1lez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Rodr\u00edguez-Artalejo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90165-5_BIB1","series-title":"Math. Found. of Comout. Sci. 79","first-page":"208","article-title":"Completeness problem in verification of programs and programs schemes","volume":"74","author":"Andr\u00e9ka","year":"1979"},{"key":"10.1016\/0304-3975(89)90165-5_BIB2","series-title":"Math. Found. of Comput. Sci. 81","first-page":"162","article-title":"A characterization of Floyd's provable programs","volume":"118","author":"Andr\u00e9ka","year":"1981"},{"key":"10.1016\/0304-3975(89)90165-5_BIB3_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."},{"key":"10.1016\/0304-3975(89)90165-5_BIB3_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(89)90165-5_BIB4","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(83)90066-X","article-title":"Ten years of Hoare's logic: A survey. Part II: Nondeterminism","volume":"28","author":"Apt","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90165-5_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(84)90065-3","article-title":"Proving program inclusion in Hoare's logic","volume":"30","author":"Bergstra","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90165-5_BIB6","series-title":"Logics of Programs 81","first-page":"24","article-title":"The refinement of specifications and the stability of Hoare's logic","volume":"131","author":"Bergstra","year":"1981"},{"key":"10.1016\/0304-3975(89)90165-5_BIB7","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF00264252","article-title":"The axiomatic semantics of programs based on Hoare's logic","volume":"21","author":"Bergstra","year":"1984","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(89)90165-5_BIB8","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF01786985","article-title":"Semantics of looping programs in propositional dynamic logic","volume":"15","author":"Berman","year":"1982","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(89)90165-5_BIB9","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1145\/355592.365646","article-title":"Flow diagrams, Turing Machines and Languages with only two formation rules","volume":"9","author":"B\u00f6hm","year":"1966","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(89)90165-5_BIB10","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1137\/0213026","article-title":"Recursive programs as definitions in first-order logic","volume":"13","author":"Cartwright","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(89)90165-5_BIB11","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1137\/0207005","article-title":"Soundness and completeness of an axiom system for program verification","volume":"7","author":"Cook","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(89)90165-5_BIB12","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":"15","author":"Csirmaz","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90165-5_BIB13","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0019-9958(83)80042-4","article-title":"On the strength of \u201cSometimes\u201d and \u201cAlways\u201d in program verification","volume":"57","author":"Csirmaz","year":"1983","journal-title":"Inform and Control"},{"key":"10.1016\/0304-3975(89)90165-5_BIB14","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/malq.19840301907","article-title":"A propertu of 2-sortde Peano models and program verification","volume":"30","author":"Csirmaz","year":"1984","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/0304-3975(89)90165-5_BIB15","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/360933.360975","article-title":"Guarded commands, nondeterminacy and formal derivation of programs","volume":"18","author":"Dijkstra","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(89)90165-5_BIB16","series-title":"Math. Aspects of Comput. Sci.","first-page":"19","article-title":"Assigning meaning to programs","volume":"19","author":"Floyd","year":"1967"},{"key":"10.1016\/0304-3975(89)90165-5_BIB17","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0304-3975(86)90032-0","article-title":"A simple dynamic predicate logic","volume":"46","author":"Hajek","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90165-5_BIB18","article-title":"First-order Dynamic Logic","volume":"68","author":"Harel","year":"1979"},{"key":"10.1016\/0304-3975(89)90165-5_BIB19","doi-asserted-by":"crossref","unstructured":"D. Harel, Effective transformations on infinite trees, with applications to high undecidability, dominoes and fairness, J. ACM (to appear).","DOI":"10.1145\/4904.4993"},{"key":"10.1016\/0304-3975(89)90165-5_BIB20","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1145\/363235.363259","article-title":"An axiomatic basis for computer programming","volume":"12","author":"Hoare","year":"1969","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(89)90165-5_BIB21","series-title":"Proc. 12th ICALP","first-page":"270","article-title":"Hoare's logic for nondeterministic regular programs: A nonstandard completeness theorem","volume":"194","author":"Hortal\u00e1-Gonz\u00e1lez","year":"1985"},{"key":"10.1016\/0304-3975(89)90165-5_BIB22","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/0890-5401(88)90015-6","article-title":"Some general incompleteness result for partial correctness logics","volume":"79","author":"Hortal\u00e1-Gonz\u00e1lez","year":"1988","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(89)90165-5_BIB23","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0019-9958(75)90415-5","article-title":"On the termination of programs schemes","volume":"29","author":"Kfoury","year":"1975","journal-title":"Inform and Control"},{"key":"10.1016\/0304-3975(89)90165-5_BIB24","first-page":"421","article-title":"On formalized systems of algorithmic logic","volume":"19","author":"Mirkowska","year":"1971","journal-title":"Bull. Acad. Polon. Sci., Ser. Sci. Math. Astron. Phys."},{"key":"10.1016\/0304-3975(89)90165-5_BIB25","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0304-3975(83)90009-9","article-title":"On the motion of expressiveness and the rule of adaptation","volume":"24","author":"Olderog","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90165-5_BIB26","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."},{"key":"10.1016\/0304-3975(89)90165-5_BIB27","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(85)90138-0","article-title":"Some questions about expressiveness and relative completeness in Hoare's logic","volume":"39","author":"Rodriquez-Artalejo","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90165-5_BIB28","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1002\/malq.19840303102","article-title":"Structured nonstandard dynamic logic","volume":"30","author":"Sain","year":"1984","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/0304-3975(89)90165-5_BIB29","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0304-3975(85)90024-6","article-title":"A simple proof for the completeness of Floyd's method","volume":"35","author":"Sain","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90165-5_BIB30","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0304-3975(87)90118-6","article-title":"Total correctness in nonstandard logics of programs","volume":"50","author":"Sain","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90165-5_BIB31","series-title":"Mathematical Logic","author":"Shoenfield","year":"1967"},{"key":"10.1016\/0304-3975(89)90165-5_BIB32","series-title":"First-Order Logic","author":"Smullyan","year":"1968"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589901655?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589901655?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T22:20:38Z","timestamp":1555194038000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589901655"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,11]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,11]]}},"alternative-id":["0304397589901655"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90165-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,11]]}}}