{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T23:13:49Z","timestamp":1648941229174},"reference-count":26,"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)90043-0","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"268-290","source":"Crossref","is-referenced-by-count":3,"title":["Correctness of recursive parallel nondeterministic flow programs"],"prefix":"10.1016","volume":"27","author":[{"given":"J.A.","family":"Goguen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Meseguer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(83)90043-0_BIB1","series-title":"Arrows, Structures, and Functors","author":"Arbib","year":"1975"},{"issue":"8","key":"10.1016\/0022-0000(83)90043-0_BIB2","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/359576.359579","article-title":"Can programming be liberated from the von Neumann style?","volume":"21","author":"Backus","year":"1978","journal-title":"Comm ACM"},{"key":"10.1016\/0022-0000(83)90043-0_BIB3","first-page":"1","article-title":"Structures Alg\u00e9briques dans les Cat\u00e9gories","volume":"10","author":"Benabou","year":"1968","journal-title":"Cahiers Topologie G\u00e9om. Diff\u00e9rentielle"},{"key":"10.1016\/0022-0000(83)90043-0_BIB4","first-page":"167","article-title":"An Analysis of Programs by Algebraic Means","author":"Blikle","year":"1977"},{"key":"10.1016\/0022-0000(83)90043-0_BIB5","series-title":"Proceedings of ACM Conference 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\/0022-0000(83)90043-0_BIB6","article-title":"A Note on Program Proof by a Continuation Method","author":"Burstall","year":"1975"},{"key":"10.1016\/0022-0000(83)90043-0_BIB7","series-title":"Proceedings, Fifth International Joint Conference on Artificial Intelligence","first-page":"1045","article-title":"Putting theories together to make specifications","author":"Burstall","year":"1977"},{"key":"10.1016\/0022-0000(83)90043-0_BIB8","series-title":"Proceedings, Symposium on Category Theory Applied to Computation and Control","first-page":"126","article-title":"The algebraic theory of recursive program schemes","volume":"Vol. 25","author":"Burstall","year":"1975"},{"key":"10.1016\/0022-0000(83)90043-0_BIB9","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1016\/S0019-9958(67)90670-5","article-title":"Automata in general algebras","volume":"11","author":"Eilenberg","year":"1967","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(83)90043-0_BIB10","series-title":"Symposium on Semantics of Algorithmic Languages","first-page":"71","article-title":"Algebraic theories and program schemes","volume":"Vol. 188","author":"Elgot","year":"1971"},{"key":"10.1016\/0022-0000(83)90043-0_BIB11","series-title":"Proceedings, Third IBM Japan Symposium","article-title":"Assignement statements in the context of algebraic theories","author":"Elgot","year":"1978"},{"key":"10.1016\/0022-0000(83)90043-0_BIB12","series-title":"Proceedings, Fifth ICALP","article-title":"Semantics and correctness of nondeterministic flowchart programs with recursive procedures","author":"Gallier","year":"1978"},{"key":"10.1016\/0022-0000(83)90043-0_BIB13","doi-asserted-by":"crossref","unstructured":"J.A. Goguen, On homomorphisms, correctness, termination, unfoldments, and equivalence of flow diagram programs, J. Comput. System Sci. 8 (974), 333\u2013365.","DOI":"10.1016\/S0022-0000(74)80028-0"},{"key":"10.1016\/0022-0000(83)90043-0_BIB14","article-title":"Set-Theoretic Correctness Proofs","author":"Goguen","year":"1974"},{"key":"10.1016\/0022-0000(83)90043-0_BIB15","series-title":"Proceedings, Mathematical Foundations of Computer Science","first-page":"580","article-title":"Correctness of recursive flow diagram programs","volume":"Vol. 53","author":"Goguen","year":"1977"},{"key":"10.1016\/0022-0000(83)90043-0_BIB16","series-title":"Current Trends in Programming Methodology","article-title":"An initial algebra approach to the specification, correctness and implementation of abstract data types","author":"Goguen","year":"1978"},{"key":"10.1016\/0022-0000(83)90043-0_BIB17","article-title":"An Introduction to Categories, Algebraic Theories, and Algebras","author":"Goguen","year":"1975"},{"key":"10.1016\/0022-0000(83)90043-0_BIB18","series-title":"The Categorial Analysis of Logic","author":"Goldblatt","year":"1979"},{"key":"10.1016\/0022-0000(83)90043-0_BIB19","article-title":"The Specification and Application to Programming of Abstract Data Types","author":"Guttag","year":"1975"},{"key":"10.1016\/0022-0000(83)90043-0_BIB20","series-title":"proceedings, National Academy of Science","article-title":"Functorial semantics of algebraic theories","author":"Lawvere","year":"1963"},{"key":"10.1016\/0022-0000(83)90043-0_BIB21","series-title":"Categories for the Working Mathematician","author":"MaClane","year":"1971"},{"key":"10.1016\/0022-0000(83)90043-0_BIB22","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0022-0000(69)80009-7","article-title":"The correctness of programs","volume":"3","author":"Manna","year":"1969","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90043-0_BIB23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(70)90002-0","article-title":"The correctness of nondeterministic programs","volume":"1","author":"Manna","year":"1970","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0022-0000(83)90043-0_BIB24","series-title":"Symposium on Semantics of Algorithmic Languages","first-page":"252","article-title":"Mathematical theory of partial correctness","volume":"Vol. 188","author":"Manna","year":"1971"},{"key":"10.1016\/0022-0000(83)90043-0_BIB25","series-title":"Proceedings, 1962 IFIP Congress","first-page":"21","article-title":"Towards a mathematical science of computation","author":"McCarthy","year":"1962"},{"key":"10.1016\/0022-0000(83)90043-0_BIB26","article-title":"Abstract Specification of Data Types","author":"Zilles","year":"1974"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900430?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900430?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:06Z","timestamp":1550325066000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000083900430"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,10]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,10]]}},"alternative-id":["0022000083900430"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(83)90043-0","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1983,10]]}}}