{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T06:24:45Z","timestamp":1780727085490,"version":"3.54.1"},"reference-count":24,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1979,4,1]],"date-time":"1979-04-01T00:00:00Z","timestamp":291772800000},"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":12526,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1979,4]]},"DOI":"10.1016\/0022-0000(79)90046-1","type":"journal-article","created":{"date-parts":[[2003,12,5]],"date-time":"2003-12-05T11:41:56Z","timestamp":1070624516000},"page":"194-211","source":"Crossref","is-referenced-by-count":738,"title":["Propositional dynamic logic of regular programs"],"prefix":"10.1016","volume":"18","author":[{"given":"Michael J.","family":"Fischer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Richard E.","family":"Ladner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(79)90046-1_BIB1","series-title":"Tech. Report 78-08-02","article-title":"Applications of Boolean Variables to Automata Theory and Dynamic Logic","author":"Abrahamson","year":"1978"},{"key":"10.1016\/0022-0000(79)90046-1_BIB2","article-title":"Test-Free Propositional Dynamic Logic is Weaker than PDL","author":"Berman","year":"1977","journal-title":"Tech. Report TR 77-10-02"},{"key":"10.1016\/0022-0000(79)90046-1_BIB3","series-title":"17th IEEE Symposium on Foundations of Computer Science","first-page":"98","article-title":"Alternation","author":"Chandra","year":"1976"},{"key":"10.1016\/0022-0000(79)90046-1_BIB4","series-title":"Ninth ACM Symposium on Theory of Computing","first-page":"269","article-title":"On the theory of programming logics","author":"Constable","year":"1977"},{"key":"10.1016\/0022-0000(79)90046-1_BIB5","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/360933.360975","article-title":"Guarded commands, nondeterminacy and formal derivation of programs","volume":"8","author":"Dijkstra","year":"1975","journal-title":"Comm. ACM 18"},{"key":"10.1016\/0022-0000(79)90046-1_BIB6","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0023017","article-title":"Theory of Program Structures: Schemes, Semantics, Verification","author":"Greibach","year":"1975"},{"key":"10.1016\/0022-0000(79)90046-1_BIB7_1","article-title":"Logics of Programs: Axiomatics and Descriptive Power","author":"Harel","year":"1978"},{"key":"10.1016\/0022-0000(79)90046-1_BIB7_2","author":"Harel","year":"1978"},{"key":"10.1016\/0022-0000(79)90046-1_BIB8","series-title":"Ninth ACM Symposium on Theory of Computing","first-page":"261","article-title":"Computatibility and completeness in logics of programs: preliminary report","author":"Harel","year":"1977"},{"key":"10.1016\/0022-0000(79)90046-1_BIB9","series-title":"Fifth ACM Symposium on Principles of Programming Languages","article-title":"Nondeterminism in logics of programs","author":"Harel","year":"1978"},{"key":"10.1016\/0022-0000(79)90046-1_BIB10_1","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","article-title":"An axiomatic basis for computer programming","volume":"10","author":"Hoare","year":"1969","journal-title":"Comm. ACM 12"},{"key":"10.1016\/0022-0000(79)90046-1_BIB10_2","first-page":"583","article-title":"An axiomatic basis for computer programming","volume":"10","author":"Hoare","year":"1969","journal-title":"Comm. ACM 12"},{"key":"10.1016\/0022-0000(79)90046-1_BIB11","first-page":"135","article-title":"Consistent and complementary formal theories of the semantics of programming languages","volume":"2","author":"Hoare","year":"1974","journal-title":"Acta Inform. 3"},{"key":"10.1016\/0022-0000(79)90046-1_BIB12","series-title":"17th IEEE Symposium on Foundations of Computer Science","first-page":"89","article-title":"On parallelism in Turing machines","author":"Kozen","year":"1976"},{"key":"10.1016\/0022-0000(79)90046-1_BIB13","series-title":"Automata, Languages and Programming, 2nd Colloquium, University of Saarbr\u00fccken","article-title":"Effectivity problems of algorithmic logic","author":"Kreczmar","year":"1974"},{"key":"10.1016\/0022-0000(79)90046-1_BIB14","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1002\/malq.19630090502","article-title":"Sementical analysis of modal logic I: Normal modal propositional calculi","volume":"9","author":"Kripke","year":"1963","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"10.1016\/0022-0000(79)90046-1_BIB15","series-title":"Automata, Languages and Programming","first-page":"87","article-title":"Logical rules of natural reasoning about programs","author":"Kr\u00f6ger","year":"1976"},{"key":"10.1016\/0022-0000(79)90046-1_BIB16","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1137\/0206033","article-title":"The computational complexity of provability in systems of modal propositional logic","volume":"3","author":"Ladner","year":"1977","journal-title":"SIAM J. Comput. 6"},{"key":"10.1016\/0022-0000(79)90046-1_BIB17","series-title":"Fifth ACM Symposium on Theory of Computing","first-page":"1","article-title":"Word problems requiring exponential time","author":"Meyer","year":"1973"},{"key":"10.1016\/0022-0000(79)90046-1_BIB18","series-title":"Symposium on Mathematical Foundations of Computer Science","article-title":"A completeness result for PDL","author":"Parikh","year":"1978"},{"key":"10.1016\/0022-0000(79)90046-1_BIB19","series-title":"17th IEEE Symposium on Foundations of Computer Science","first-page":"109","article-title":"Semantical considerations on Floyd-Hoare logic","author":"Pratt","year":"1976"},{"key":"10.1016\/0022-0000(79)90046-1_BIB20","series-title":"10th ACM Symposium on Theory of Computing","first-page":"326","article-title":"A practical decision method for propositional dynamic logic","author":"Pratt","year":"1978"},{"key":"10.1016\/0022-0000(79)90046-1_BIB21","first-page":"227","article-title":"Formalized algorithmic languages","volume":"18","author":"Saltvicki","year":"1970","journal-title":"Bull. Acad. Polon. Sci. Sir. Sci. Math. Astronom. Phys."},{"key":"10.1016\/0022-0000(79)90046-1_BIB22","first-page":"A","article-title":"A completeness theorem in the modal logic of programs","volume":"6","author":"Segerberg","year":"1977","journal-title":"Notices Amer. Math. Soc. 24"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000079900461?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000079900461?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T12:20:34Z","timestamp":1550319634000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000079900461"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,4]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1979,4]]}},"alternative-id":["0022000079900461"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(79)90046-1","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1979,4]]}}}