{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:45:11Z","timestamp":1764557111207},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1983,4,1]],"date-time":"1983-04-01T00:00:00Z","timestamp":418003200000},"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":11065,"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":[[1983,4]]},"DOI":"10.1016\/0022-0000(83)90014-4","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"222-243","source":"Crossref","is-referenced-by-count":69,"title":["Propositional dynamic logic of nonregular programs"],"prefix":"10.1016","volume":"26","author":[{"given":"David","family":"Harel","sequence":"first","affiliation":[]},{"given":"Amir","family":"Pnueli","sequence":"additional","affiliation":[]},{"given":"Jonathan","family":"Stavi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(83)90014-4_BIB1","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0022-0000(75)80056-0","article-title":"On the completeness of the inductive assertion method","volume":"11","author":"deBakker","year":"1975","journal-title":"J. Comput. Sys. Sci."},{"key":"10.1016\/0022-0000(83)90014-4_BIB2","first-page":"143","article-title":"On formal properties of simple phrase structure grammars","volume":"14","author":"Bar-Hillel","year":"1961","journal-title":"Z. Phonetik, Sprach. Kommunikation."},{"key":"10.1016\/0022-0000(83)90014-4_BIB3","series-title":"Proc. Symp. Pure Math.","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1090\/pspum\/028.2\/0432534","article-title":"Hilbert's tenth problem. Diophantine equations: Positive aspects of a negative solution","author":"Davis","year":"1976"},{"key":"10.1016\/0022-0000(83)90014-4_BIB4","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","article-title":"Propositional dynamic logic of regular programs","volume":"18","author":"Fischer","year":"1979","journal-title":"J. Comput. Sys. Sci."},{"key":"10.1016\/0022-0000(83)90014-4_BIB5","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1145\/322217.322224","article-title":"Super deterministic PDA's: A subcase with a decidable equivalence problem","volume":"27","author":"Greibach","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(83)90014-4_BIB6","series-title":"Proc. Workshop on Logics of Programs","article-title":"Further results on propositional dynamic logic of nonregular programs","author":"Harel","year":"1981"},{"key":"10.1016\/0022-0000(83)90014-4_BIB7","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0022-0000(83)90014-4_BIB8","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0022-0000(79)90055-2","article-title":"Two decidability results for deterministic pushdown automata","volume":"18","author":"Linna","year":"1979","journal-title":"J. Comput. Sys. Sci."},{"key":"10.1016\/0022-0000(83)90014-4_BIB9","first-page":"354","article-title":"Enumerable sets are diophantine","volume":"11","author":"Matijaseviu","year":"1970","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0022-0000(83)90014-4_BIB10","series-title":"Proc. 8th Int. Colloq. on Autom. Lang. Prog.","article-title":"The deducibility problem in propositional dynamic logic","author":"Meyer","year":"1981"},{"key":"10.1016\/0022-0000(83)90014-4_BIB11","unstructured":"T. Olshansky and A. Pnueli, \u201cThere Exist Decidable Context-Free Propositional Dynamic Logics,\u201d manuscript."},{"key":"10.1016\/0022-0000(83)90014-4_BIB12","series-title":"Proc. 17th IEEE Symp. 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(83)90014-4_BIB13","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0022-0000(80)90061-6","article-title":"A near optimal method for reasoning about action","volume":"20","author":"Pratt","year":"1980","journal-title":"J. Comput. Sys. Sci."},{"key":"10.1016\/0022-0000(83)90014-4_BIB14","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"issue":"2","key":"10.1016\/0022-0000(83)90014-4_BIB15","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S0019-9958(80)90741-X","article-title":"The decidability of equivalence for a family of linear grammars","volume":"47","author":"Yehudai","year":"1981","journal-title":"Inform. and Control"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900144?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900144?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:50:44Z","timestamp":1550325044000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000083900144"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,4]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,4]]}},"alternative-id":["0022000083900144"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(83)90014-4","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1983,4]]}}}