{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T04:12:29Z","timestamp":1648527149057},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,6,1]],"date-time":"1994-06-01T00:00:00Z","timestamp":770428800000},"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":6986,"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":[[1994,6]]},"DOI":"10.1016\/0304-3975(94)90083-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"123-142","source":"Crossref","is-referenced-by-count":3,"title":["Correctness of fixpoint transformations"],"prefix":"10.1016","volume":"129","author":[{"given":"Jiawang","family":"Wei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90083-3_BIB1","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/S0019-9958(72)90063-0","article-title":"Equational languages","volume":"21","author":"Blikle","year":"1972","journal-title":"Inform. and Control"},{"issue":"13","key":"10.1016\/0304-3975(94)90083-3_BIB2","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0167-6423(88)90033-0","article-title":"Program derivation by fixed point computation","volume":"11","author":"Cai","year":"1989","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0304-3975(94)90083-3_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(86)90050-2","article-title":"Equivalence and transformation of regular systems: application to recursive program schemes and grammars","volume":"42","author":"Courcelle","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90083-3_BIB4","series-title":"3rd Intern. Workshop on Graph-Grammars and Their Application to Computer Science","first-page":"133","article-title":"On context free sets of graphs and their monadic second order theory","volume":"Vol. 291","author":"Courcelle","year":"1987"},{"key":"10.1016\/0304-3975(94)90083-3_BIB5","first-page":"459","article-title":"Recursive applicative program schemes","volume":"Vol. B","author":"Courcelle","year":"1990"},{"issue":"8","key":"10.1016\/0304-3975(94)90083-3_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/872734.806926","article-title":"Automatic synthesis of optimal invariant assertions: mathematical foundations","volume":"12","author":"Cousot","year":"1977","journal-title":"SIGPLAN Notices"},{"issue":"1","key":"10.1016\/0304-3975(94)90083-3_BIB7","doi-asserted-by":"crossref","first-page":"43","DOI":"10.2140\/pjm.1979.82.43","article-title":"Constructive versions of Tarski's fixed point theorems","volume":"82","author":"Cousot","year":"1979","journal-title":"Pacific J. Math."},{"key":"10.1016\/0304-3975(94)90083-3_BIB8","series-title":"Mathematical Theory of Program Correctness","author":"de Bakker","year":"1980"},{"key":"10.1016\/0304-3975(94)90083-3_BIB9","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0167-6423(92)90019-8","article-title":"Reasoning algebraically about recursion","volume":"18","author":"Gardiner","year":"1992","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0304-3975(94)90083-3_BIB10","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1145\/321127.321132","article-title":"Two families of languages related to ALGOL","volume":"9","author":"Ginsburg","year":"1962","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)90083-3_BIB11","series-title":"Proc. IRIA Conf. on Automata, Language and Programming Theory","first-page":"225","article-title":"Introduction rules and termination proofs","author":"Hitchcock","year":"1973"},{"issue":"1","key":"10.1016\/0304-3975(94)90083-3_BIB12","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321921.321938","article-title":"Global data flow analysis and iterative algorithms","volume":"23","author":"Kam","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)90083-3_BIB13","first-page":"1073","article-title":"Elements of relational database theory","volume":"Vol. B","author":"Kanellakis","year":"1990"},{"key":"10.1016\/0304-3975(94)90083-3_BIB14","series-title":"Introduction to Metamathematics","author":"Kleene","year":"1952"},{"key":"10.1016\/0304-3975(94)90083-3_BIB15","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(78)90033-6","article-title":"The convergence of functions to fixed points of recursive definitions","volume":"6","author":"Manna","year":"1978","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/0304-3975(94)90083-3_BIB16","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF02485815","article-title":"Chain-completeness posets and directed sets with application","volume":"6","author":"Markowsky","year":"1976","journal-title":"Algebra Universalis"},{"key":"10.1016\/0304-3975(94)90083-3_BIB17","first-page":"71","article-title":"Bounded fixed point iteration","author":"Nielson","year":"1992","journal-title":"Proc. ACM Symp. on Principle of Programming Language"},{"issue":"2","key":"10.1016\/0304-3975(94)90083-3_BIB18","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","article-title":"A lattice theoretical fixpoint theorem and its application","volume":"5","author":"Tarski","year":"1955","journal-title":"Pacific J. Math."},{"key":"10.1016\/0304-3975(94)90083-3_BIB19","series-title":"Sets: Naive, Axiomatic and Applied","author":"van Dalen","year":"1978"},{"key":"10.1016\/0304-3975(94)90083-3_BIB20","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1080\/00207169108804016","article-title":"Convergence of chaotic iterative least fixed point computations","volume":"40","author":"Wei","year":"1991","journal-title":"Intern. J. Comput. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900833?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900833?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:27:39Z","timestamp":1555129659000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594900833"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["0304397594900833"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90083-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}