{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T10:34:50Z","timestamp":1770287690717,"version":"3.49.0"},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1974,6,1]],"date-time":"1974-06-01T00:00:00Z","timestamp":139276800000},"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":14291,"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":[[1974,6]]},"DOI":"10.1016\/s0022-0000(74)80028-0","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T09:46:40Z","timestamp":1289382400000},"page":"333-365","source":"Crossref","is-referenced-by-count":24,"title":["On homomorphisms, correctness, termination, unfoldments, equivalence of flow diagram programs"],"prefix":"10.1016","volume":"8","author":[{"suffix":"Jr.","given":"J.A.","family":"Goguen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(74)80028-0_bib1","series-title":"Proc. of an ACM Confr. on Proving Assertions about Programs","first-page":"7","article-title":"An algebraic description of programs with assertions, verification, and simulation","author":"Burstall","year":"1972"},{"key":"10.1016\/S0022-0000(74)80028-0_bib2","unstructured":"R. M. Burstall, unpublished notes, University of Edinburgh, Scotland, 1972."},{"key":"10.1016\/S0022-0000(74)80028-0_bib3","first-page":"19","article-title":"Assigning meanings to programs","volume":"Vol. 19","author":"Floyd","year":"1967"},{"key":"10.1016\/S0022-0000(74)80028-0_bib4","author":"Ginzburg","year":"1968"},{"key":"10.1016\/S0022-0000(74)80028-0_bib5","series-title":"1971 IEEE Confr. on Decision and Control","first-page":"42","article-title":"Systems and minimal realization","author":"Goguen","year":"1972"},{"key":"10.1016\/S0022-0000(74)80028-0_bib6","series-title":"Global Systems Dynamics","first-page":"111","article-title":"Mathematical representation of hierarchically organized systems","author":"Goguen","year":"1970"},{"key":"10.1016\/S0022-0000(74)80028-0_bib7","series-title":"Proc. of 1972 IEEE Symp. on Switching and Automata Theory","first-page":"52","article-title":"On homomorphisms, simulations, correctness, and subroutines for programs and program schemes","author":"Goguen","year":"1972"},{"key":"10.1016\/S0022-0000(74)80028-0_bib8","article-title":"A Junction between Computer Science and Category Theory, I: Basic Concepts and Examples","author":"Goguen","year":"1973","journal-title":"IBM Watson Res. Ctr. Technical Report"},{"key":"10.1016\/S0022-0000(74)80028-0_bib9","series-title":"Proc. of an ACM Confr. on Proving Assertions about Programs","first-page":"66","article-title":"The correctness of numerical algorithms","author":"Hull","year":"1972"},{"key":"10.1016\/S0022-0000(74)80028-0_bib10","doi-asserted-by":"crossref","DOI":"10.1145\/800195.805955","article-title":"Recursion Induction Applied to Generalized Flowcharts","author":"Kaplan","year":"1969"},{"key":"10.1016\/S0022-0000(74)80028-0_bib11","article-title":"Some Applications of Logical Syntax to Digital Computer Programming","author":"Karp","year":"1959","journal-title":"Harvard University Thesis"},{"key":"10.1016\/S0022-0000(74)80028-0_bib12","series-title":"Symp. on Semantics of Algorithmic Languages","first-page":"236","article-title":"Experience with inductive assertions for proving programs correct","volume":"Vol. 188","author":"London","year":"1971"},{"key":"10.1016\/S0022-0000(74)80028-0_bib13","author":"Mac Lane","year":"1972"},{"key":"10.1016\/S0022-0000(74)80028-0_bib14","article-title":"An Algebraic Definition of Simulation between Program","author":"Milner","year":"1971"},{"key":"10.1016\/S0022-0000(74)80028-0_bib15","author":"Pareigis","year":"1971"},{"key":"10.1016\/S0022-0000(74)80028-0_bib16","author":"Schwartz","year":"1972"},{"key":"10.1016\/S0022-0000(74)80028-0_bib17","series-title":"Symp. on Semantics of Algorithmic Languages","first-page":"311","article-title":"The lattice of flow diagrams","volume":"Vol. 188","author":"Scott","year":"1971"},{"key":"10.1016\/S0022-0000(74)80028-0_bib18","series-title":"Proceedings of the Fifth Annual ACM Symposium on Theory of Computating","first-page":"214","article-title":"From algebras to programming languages","author":"Wagner","year":"1973"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800280?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800280?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T05:11:50Z","timestamp":1559797910000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000074800280"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,6]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1974,6]]}},"alternative-id":["S0022000074800280"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(74)80028-0","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1974,6]]}}}