{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T15:57:49Z","timestamp":1648569469432},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1984,8,1]],"date-time":"1984-08-01T00:00:00Z","timestamp":460166400000},"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":10577,"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":[[1984,8]]},"DOI":"10.1016\/0022-0000(84)90016-3","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"99-117","source":"Crossref","is-referenced-by-count":0,"title":["Weak equivalence in a class of structured program schemes"],"prefix":"10.1016","volume":"29","author":[{"given":"Douglas R.","family":"Troeger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(84)90016-3_BIB1","doi-asserted-by":"crossref","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."},{"issue":"1","key":"10.1016\/0022-0000(84)90016-3_BIB2_1","doi-asserted-by":"crossref","DOI":"10.1109\/TSE.1976.233800","article-title":"Structured programming with and without GOTO statements","volume":"SE-2","author":"Elgot","year":"1976","journal-title":"IEEE Trans. Software Engrg."},{"issue":"3","key":"10.1016\/0022-0000(84)90016-3_BIB2_2","volume":"SE-2","author":"Elgot","year":"1976","journal-title":"Erratum and Corrigendum"},{"issue":"2","key":"10.1016\/0022-0000(84)90016-3_BIB3","article-title":"On the computational complexity of program scheme equivalence","volume":"9","author":"Hunt","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(84)90016-3_BIB4","doi-asserted-by":"crossref","DOI":"10.1016\/S0022-0000(74)80043-7","article-title":"Analysis of structured programs","volume":"9","author":"Kosaraju","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(84)90016-3_BIB5","article-title":"The Exponential Storage Cost of D-Schemes","author":"Tindell","year":"1976"},{"key":"10.1016\/0022-0000(84)90016-3_BIB6","unstructured":"R. Tindell, \u201cCovering Morphisms and Unique Minimal D-Schemes,\u201d to appear."},{"key":"10.1016\/0022-0000(84)90016-3_BIB7","unstructured":"D. Troeger, \u201cAn Algorithm for D Scheme Optimization,\u201d Stevens Institute of Technology Technical Report, to appear."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900163?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900163?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:51:30Z","timestamp":1550325090000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000084900163"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,8]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,8]]}},"alternative-id":["0022000084900163"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(84)90016-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1984,8]]}}}