{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T15:15:51Z","timestamp":1648998951180},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1983,10,1]],"date-time":"1983-10-01T00:00:00Z","timestamp":433814400000},"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":10882,"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,10]]},"DOI":"10.1016\/0022-0000(83)90040-5","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"221-224","source":"Crossref","is-referenced-by-count":1,"title":["An axiomatization of D-scheme strong equivalence"],"prefix":"10.1016","volume":"27","author":[{"given":"Douglas R.","family":"Troeger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(83)90040-5_BIB1","first-page":"180","article-title":"Minimal While Programs","author":"Bainbridge","year":"1976"},{"key":"10.1016\/0022-0000(83)90040-5_BIB2","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/0304-3975(79)90031-8","article-title":"Algebraic and graph theoretic characterizations of structured flowchart schemes","volume":"9","author":"Bloom","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(83)90040-5_BIB3","doi-asserted-by":"crossref","unstructured":"C. C. Elgot, Structured Programming with an without GO TO Statements, IEEE Trans. Software Engrg. SE-2 41\u201353; Erratum and Corrigendum, p. 232.","DOI":"10.1109\/TSE.1976.233820"},{"key":"10.1016\/0022-0000(83)90040-5_BIB4","series-title":"Categorical and Algebraic Methods in Computer Science and System Theory","first-page":"94","article-title":"Covering Morphisms and Structured Ianov Schemes","author":"Tindell","year":"1976"},{"key":"10.1016\/0022-0000(83)90040-5_BIB5","series-title":"Topics in Graph Theory","first-page":"201","article-title":"Covering digraphs","volume":"Vol. 328","author":"Tindell","year":"1979"},{"key":"10.1016\/0022-0000(83)90040-5_BIB6","article-title":"Flowchart Schemes, Algebras, and Covers","author":"Yoepp","year":"1981"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900405?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900405?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T16:47:48Z","timestamp":1585327668000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000083900405"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,10]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,10]]}},"alternative-id":["0022000083900405"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(83)90040-5","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1983,10]]}}}