{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T11:44:55Z","timestamp":1648899895912},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1979,6,1]],"date-time":"1979-06-01T00:00:00Z","timestamp":297043200000},"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":12465,"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":[[1979,6]]},"DOI":"10.1016\/0304-3975(79)90016-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"325-357","source":"Crossref","is-referenced-by-count":10,"title":["A semantically meaningful characterization of reducible flowchart schemes"],"prefix":"10.1016","volume":"8","author":[{"given":"Calvin C.","family":"Elgot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John C.","family":"Shepherdson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(79)90016-1_BIB1","article-title":"Graph-theoretic constructs for control flow analysis","author":"Allen","year":"1972","journal-title":"IBM Research Report RC-3923"},{"key":"10.1016\/0304-3975(79)90016-1_BIB2","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":"3","key":"10.1016\/0304-3975(79)90016-1_BIB3","doi-asserted-by":"crossref","DOI":"10.1016\/S0022-0000(76)80003-7","article-title":"The existence and construction of free iterative theories","volume":"12","author":"Bloom","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(79)90016-1_BIB4","article-title":"The external behavior of machines","author":"Elgot","year":"1970","journal-title":"Proc. of Third International Conference on System Sciences"},{"key":"10.1016\/0304-3975(79)90016-1_BIB5","series-title":"Studies in Logic","article-title":"Monadic computation and iterative algebraic theories, Logic Colloquium '73","author":"Elgot","year":"1975"},{"key":"10.1016\/0304-3975(79)90016-1_BIB6","article-title":"Structured programming with and without GO TO statements","author":"Elgot","year":"1976","journal-title":"IEEE Trans. on Software Eng. SE-2"},{"key":"10.1016\/0304-3975(79)90016-1_BIB7","series-title":"IBM Research Report RC-6230","article-title":"On the algebraic structure of rooted trees","author":"Elgot","year":"1976"},{"issue":"7","key":"10.1016\/0304-3975(79)90016-1_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/390013.808479","article-title":"Control flow analysis","volume":"5","author":"Allen","year":"1970","journal-title":"Proc. ACM SIGPLAN Symposium on Compiler Optimization"},{"issue":"2","key":"10.1016\/0304-3975(79)90016-1_BIB9","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1137\/0201014","article-title":"Flowgraph reducibility","volume":"1","author":"Hecht","year":"1972","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/0304-3975(79)90016-1_BIB10","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1145\/321832.321835","article-title":"Characterizations of reducible flow graphs","volume":"21","author":"Hecht","year":"1974","journal-title":"J. Assoc. Comput. Mach."},{"issue":"7","key":"10.1016\/0304-3975(79)90016-1_BIB11","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/390013.808480","article-title":"Global common subexpression elimination","volume":"5","author":"Cocke","year":"1970","journal-title":"Proc. ACM SIGPLAN Symposium on Compiler Optimization"},{"issue":"1","key":"10.1016\/0304-3975(79)90016-1_BIB12","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/362835.362838","article-title":"Object code optimization","author":"Lowry","year":"1969","journal-title":"Comm. ACM."},{"key":"10.1016\/0304-3975(79)90016-1_BIB13","series-title":"Proc. Eastern Joint Computer Conference","first-page":"133","article-title":"Applications of Boolean matrices to the analysis of flow diagrams","author":"Prosser","year":"1959"},{"key":"10.1016\/0304-3975(79)90016-1_BIB14","series-title":"Dissertation","article-title":"Iterative algebraic theories, infinite trees and program schemata","author":"Ginali","year":"1976"},{"key":"10.1016\/0304-3975(79)90016-1_BIB15","series-title":"Categories for the working mathematician","author":"Mac Lane","year":"1971"},{"key":"10.1016\/0304-3975(79)90016-1_BIB16","series-title":"Cardinal and Ordinal Numbers","author":"Sierpinski","year":"1958"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900161?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900161?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:23:33Z","timestamp":1555111413000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397579900161"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,6]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979,6]]}},"alternative-id":["0304397579900161"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(79)90016-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1979,6]]}}}