{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T07:52:13Z","timestamp":1775461933890,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,6,1]],"date-time":"1982-06-01T00:00:00Z","timestamp":391737600000},"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":11369,"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":[[1982,6]]},"DOI":"10.1016\/0304-3975(82)90071-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"301-323","source":"Crossref","is-referenced-by-count":13,"title":["Expressing program looping in regular dynamic logic"],"prefix":"10.1016","volume":"18","author":[{"given":"Albert R.","family":"Meyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karl","family":"Winklmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(82)90071-8_BIB1","series-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0304-3975(82)90071-8_BIB2","article-title":"Theory of Program Structures: Schemes, Semantics, Verification","volume":"36","author":"Greibach","year":"1975"},{"key":"10.1016\/0304-3975(82)90071-8_BIB3","series-title":"Technical Memorandum 130","article-title":"Specifying the semantics of while-programs","author":"Greif","year":"1979"},{"key":"10.1016\/0304-3975(82)90071-8_BIB4_1","article-title":"First Order Dynamic Logic","volume":"68","author":"Harel","year":"1979"},{"key":"10.1016\/0304-3975(82)90071-8_BIB4_2","series-title":"PhD Thesis","article-title":"Logics of programs: axiomatics and descriptive power","author":"Harel","year":"1978"},{"key":"10.1016\/0304-3975(82)90071-8_BIB5","first-page":"203","article-title":"Nondeterminism in logics of programs","author":"Harel","year":"1978","journal-title":"5th Annual Symposium on Principles of Programming Languages"},{"issue":"3","key":"10.1016\/0304-3975(82)90071-8_BIB6","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/322077.322088","article-title":"Some properties of predicate transformers","volume":"25","author":"Hoare","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(82)90071-8_BIB7","doi-asserted-by":"crossref","DOI":"10.1109\/SWAT.1972.28","article-title":"The emptiness problem for automata on infinite trees","author":"Hossley","year":"1972","journal-title":"13th Annual Symposium on Switching and Automata Theory"},{"key":"10.1016\/0304-3975(82)90071-8_BIB8","first-page":"11","article-title":"Ten thousand and one logics of programming","author":"Meyer","year":"1980","journal-title":"EATCS Bull."},{"key":"10.1016\/0304-3975(82)90071-8_BIB9","first-page":"1","article-title":"Definability in Dynamic Logic","author":"Meyer","year":"1980","journal-title":"11th ACM Symposium or Theory of Computing"},{"key":"10.1016\/0304-3975(82)90071-8_BIB10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/SFCS.1976.27","article-title":"Semantical considerations on Floyd-Hoare Logic","author":"Pratt","year":"1976","journal-title":"17th Annual Symposium on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(82)90071-8_BIB11","series-title":"Technical Report No. 37","article-title":"Automata on infinite trees and the synthesis problem","author":"Rabin","year":"1970"},{"key":"10.1016\/0304-3975(82)90071-8_BIB12","series-title":"Report No. 281","article-title":"Algorithmic logic","author":"Rasiowa","year":"1977"},{"issue":"5","key":"10.1016\/0304-3975(82)90071-8_BIB13","first-page":"227","article-title":"Formalized algorithmic languages","volume":"XVIII","author":"Salwicki","year":"1970","journal-title":"Bull. Acad. Polon. Sci. S\u00e9r. Sci. Math. Astronom. Phys."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582900718?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582900718?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:26:26Z","timestamp":1555111586000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397582900718"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,6]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,6]]}},"alternative-id":["0304397582900718"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(82)90071-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1982,6]]}}}