{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T17:15:53Z","timestamp":1784135753456,"version":"3.55.0"},"reference-count":81,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,4,1]],"date-time":"1989-04-01T00:00:00Z","timestamp":607392000000},"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":8873,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1989,4]]},"DOI":"10.1016\/0167-6423(88)90033-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:19:32Z","timestamp":1027657172000},"page":"197-261","source":"Crossref","is-referenced-by-count":65,"title":["Program derivation by fixed point computation"],"prefix":"10.1016","volume":"11","author":[{"given":"Jiazhen","family":"Cai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Paige","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(88)90033-0_BIB1","series-title":"Handbook of Mathematical Logic","first-page":"739","article-title":"An introduction to inductive definitions","author":"Aczel","year":"1977"},{"key":"10.1016\/0167-6423(88)90033-0_BIB2","series-title":"Proc. 6th ACM Symp. Principles of Programming Languages","first-page":"110","article-title":"Universality of data retrieval language","author":"Aho","year":"1979"},{"key":"10.1016\/0167-6423(88)90033-0_BIB3","series-title":"Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0167-6423(88)90033-0_BIB4","series-title":"Compilers","author":"Aho","year":"1986"},{"issue":"4","key":"10.1016\/0167-6423(88)90033-0_BIB5","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1145\/31846.31852","article-title":"Monotone versis positive","volume":"34","author":"Ajtai","year":"1987","journal-title":"JACM"},{"issue":"8","key":"10.1016\/0167-6423(88)90033-0_BIB6","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/359576.359579","article-title":"Can programming be liberated from the von Neumann style? A functional style and its algebra of programs","volume":"21","author":"Backus","year":"1978","journal-title":"CACM"},{"key":"10.1016\/0167-6423(88)90033-0_BIB7","series-title":"Algorithmic Language and Program Development","author":"Bauer","year":"1982"},{"key":"10.1016\/0167-6423(88)90033-0_BIB8","series-title":"Lattice Theory","author":"Birkhoff","year":"1966"},{"key":"10.1016\/0167-6423(88)90033-0_BIB9","series-title":"Ph.D. Thesis","article-title":"Fixed Point Computation and Transformational Programming","author":"Cai","year":"1987"},{"key":"10.1016\/0167-6423(88)90033-0_BIB10","article-title":"An iterative version of Hopcroft and Tarjan's planarity testing algorithm","volume":"324","author":"Cai","year":"1987"},{"key":"10.1016\/0167-6423(88)90033-0_BIB11","series-title":"Proc. 14th ACM Symp. Principles of Programming Languages","first-page":"85","article-title":"Binding performance at language design time","author":"Cai","year":"1987"},{"issue":"11","key":"10.1016\/0167-6423(88)90033-0_BIB12","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1145\/359863.359888","article-title":"An algorithm for reduction of operator strength","volume":"20","author":"Cocke","year":"1977","journal-title":"CACM"},{"key":"10.1016\/0167-6423(88)90033-0_BIB13","series-title":"Lecture Notes","article-title":"Programming Languages and Their Compilers","author":"Cocke","year":"1969"},{"issue":"6","key":"10.1016\/0167-6423(88)90033-0_BIB14","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/362384.362685","article-title":"A relational model of data for large shared data banks","volume":"13","author":"Codd","year":"1970","journal-title":"CACM"},{"key":"10.1016\/0167-6423(88)90033-0_BIB15","series-title":"Program Flow Analysis","first-page":"303","article-title":"Semantic foundations of program analysis","author":"Cousot","year":"1981"},{"key":"10.1016\/0167-6423(88)90033-0_BIB16","series-title":"Proc. 4th ACM Symp. Principles of Programming Languages","first-page":"238","article-title":"Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixed points","author":"Cousot","year":"1977"},{"issue":"8","key":"10.1016\/0167-6423(88)90033-0_BIB17","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\/0167-6423(88)90033-0_BIB18","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\/0167-6423(88)90033-0_BIB19","series-title":"Computability, Complexity and Languages","author":"Davis","year":"1983"},{"key":"10.1016\/0167-6423(88)90033-0_BIB20","series-title":"Mathematical Theory of Program Correctness","author":"de Bakker","year":"1980"},{"issue":"1","key":"10.1016\/0167-6423(88)90033-0_BIB21","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/357062.357064","article-title":"Program by refinement, as exemplified by the SETL representation sublanguage","volume":"1","author":"Dewar","year":"1979","journal-title":"TOPLAS"},{"issue":"4","key":"10.1016\/0167-6423(88)90033-0_BIB22","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0096-0551(75)90019-3","article-title":"High level iterators and a method for automatically designing data structure representation","volume":"1","author":"Earley","year":"1976","journal-title":"J. Comput. Languages"},{"key":"10.1016\/0167-6423(88)90033-0_BIB23","series-title":"Tech. Rept. 86-06","article-title":"Model checking in the propositional mu-calculus","author":"Emerson","year":"1986"},{"key":"10.1016\/0167-6423(88)90033-0_BIB24","series-title":"Proc. ACM Symp. Compiler Construction","first-page":"85","article-title":"Automatic generation of fixed-point-finding evaluators for circular, but well-defined, attribute grammars","author":"Farrow","year":"1986"},{"key":"10.1016\/0167-6423(88)90033-0_BIB25","series-title":"IFIPTC 2 WG2.1 Working Conference on Program Specification and Transformation","first-page":"165","article-title":"A survey and classification of some program transformation approaches and techniques","author":"Feather","year":"1987"},{"key":"10.1016\/0167-6423(88)90033-0_BIB26","series-title":"Proc. 3rd ACM Symp. Principles of Programming Languages","first-page":"104","article-title":"Induction variables in very high level languages","author":"Fong","year":"1976"},{"key":"10.1016\/0167-6423(88)90033-0_BIB27","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0167-6423(88)90033-0_BIB28","series-title":"Proc. ACM Symp. LISP and Functional Programming","first-page":"53","article-title":"Stream processing","author":"Goldberg","year":"1984"},{"key":"10.1016\/0167-6423(88)90033-0_BIB29","series-title":"Edinburgh LCF","author":"Gordon","year":"1979"},{"key":"10.1016\/0167-6423(88)90033-0_BIB30","series-title":"General Lattice Theory","author":"Gratzer","year":"1978"},{"key":"10.1016\/0167-6423(88)90033-0_BIB31","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF00264025","article-title":"Describing an algorithm by Hopcroft","volume":"2","author":"Gries","year":"1973","journal-title":"Acta Informatica"},{"key":"10.1016\/0167-6423(88)90033-0_BIB32","series-title":"Computation and Proof Theory","first-page":"175","article-title":"Toward logic tailored for computational complexity","author":"Gurevich","year":"1984"},{"key":"10.1016\/0167-6423(88)90033-0_BIB33","series-title":"Current Trends in Theoretical Computer Science","article-title":"Logic and the Challenge of Computer Science","author":"Gurevich","year":"1987"},{"key":"10.1016\/0167-6423(88)90033-0_BIB34","series-title":"26th Annual Symposium on Foundation of Computer Science","first-page":"346","article-title":"Fixed-point extensions of first-order logic","author":"Gurevich","year":"1985"},{"issue":"2","key":"10.1016\/0167-6423(88)90033-0_BIB35","first-page":"1","article-title":"A programming language for the inductive sets, and applications","volume":"63","author":"Harel","year":"1985","journal-title":"Inform. and Control"},{"issue":"4","key":"10.1016\/0167-6423(88)90033-0_BIB36","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1137\/0204044","article-title":"A simple algorithm for global data flow analysis problems","volume":"4","author":"Hecht","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6423(88)90033-0_BIB37","first-page":"47","article-title":"On compiling queries in recursive first-order database","volume":"31","author":"Henschen","year":"1984","journal-title":"CACM"},{"key":"10.1016\/0167-6423(88)90033-0_BIB38","series-title":"Theory of Machines and Computations","first-page":"189","article-title":"An n log n algorithm for minimizing states in a finite automation","author":"Hopcroft","year":"1971"},{"key":"10.1016\/0167-6423(88)90033-0_BIB39","series-title":"Proc. 14th ACM Symp. Theory of Computing","first-page":"147","article-title":"Relational queries computable in polynomial time","author":"Immerman","year":"1982"},{"key":"10.1016\/0167-6423(88)90033-0_BIB40","series-title":"Proc. 15th ACM Symp. Theory of Computing","first-page":"347","article-title":"Languages which capture complexity classes","author":"Immerman","year":"1983"},{"issue":"1","key":"10.1016\/0167-6423(88)90033-0_BIB41","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":"JACM"},{"key":"10.1016\/0167-6423(88)90033-0_BIB42","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF00290339","article-title":"Monotone data flow analysis frameworks","volume":"7","author":"Kam","year":"1977","journal-title":"Acta Informatica"},{"issue":"1","key":"10.1016\/0167-6423(88)90033-0_BIB43","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/322169.322181","article-title":"A scheme for the automatic inference of variable types","volume":"27","author":"Kaplan","year":"1980","journal-title":"JACM"},{"key":"10.1016\/0167-6423(88)90033-0_BIB44","series-title":"Proc. 1st ACM Symp. Principles of Programming Languages","first-page":"194","article-title":"A unified approach to global program optimization","author":"Kildall","year":"1973"},{"key":"10.1016\/0167-6423(88)90033-0_BIB45","series-title":"Introduction to Meta-Mathematics","author":"Kleene","year":"1952"},{"key":"10.1016\/0167-6423(88)90033-0_BIB46","series-title":"Tech. Rept. DCS-TR-159","article-title":"Applicability of incremental iterative algorithms","author":"Marlowe","year":"1985"},{"key":"10.1016\/0167-6423(88)90033-0_BIB47","series-title":"Proc. 7th IJCAI","first-page":"368","article-title":"Using active connection graphs for reasoning with recursive rules","author":"McKay","year":"1981"},{"key":"10.1016\/0167-6423(88)90033-0_BIB48","series-title":"Tech. Rept. STAN-CS-86-1108","article-title":"Design overview of the NAIL! system","author":"Morris","year":"1986"},{"key":"10.1016\/0167-6423(88)90033-0_BIB49","first-page":"25","article-title":"Synthesizing least fixed point queries into non-recursive iterative programs","volume":"83","author":"Naqvi","year":"1983","journal-title":"IJCAI"},{"key":"10.1016\/0167-6423(88)90033-0_BIB50","series-title":"Tech. Rept. STAN-CS-86-1114","article-title":"Optimizing function-free recursive inference rules","author":"Naughton","year":"1986"},{"key":"10.1016\/0167-6423(88)90033-0_BIB51","series-title":"Proc. 4th Internat. Conf. on Logic Prog.","first-page":"729","article-title":"Finite fixed-point problems, Logic Programming","author":"O'Keefe","year":"1987"},{"key":"10.1016\/0167-6423(88)90033-0_BIB52","series-title":"Proc. 10th ACM Symp. Principles of Programming Languages","first-page":"73","article-title":"Transformational programming\u2014applications to algorithms and systems","author":"Paige","year":"1983"},{"key":"10.1016\/0167-6423(88)90033-0_BIB53","series-title":"Program Transformation and Programming Environments","first-page":"331","article-title":"Supercompilers\u2014extended abstract","author":"Paige","year":"1984"},{"key":"10.1016\/0167-6423(88)90033-0_BIB54","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0304-3975(85)90159-8","article-title":"A linear time solution to the single function coarsest partition problem","volume":"40","author":"Paige","year":"1985","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/0167-6423(88)90033-0_BIB55","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/MS.1986.233070","article-title":"Programming with invariants","volume":"3","author":"Paige","year":"1986","journal-title":"IEEE Software"},{"issue":"2","key":"10.1016\/0167-6423(88)90033-0_BIB56","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0747-7171(87)80066-4","article-title":"Mechanical translation of set theoretic problem specifications into efficient RAM code\u2014A case study","volume":"4","author":"Paige","year":"1987","journal-title":"J. Symbolic Comput."},{"issue":"3","key":"10.1016\/0167-6423(88)90033-0_BIB57","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1145\/357172.357177","article-title":"Finite differencing of computable expressions","volume":"4","author":"Paige","year":"1982","journal-title":"ACM TOPLAS"},{"issue":"6","key":"10.1016\/0167-6423(88)90033-0_BIB58","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","article-title":"Three partition refinement algorithms","volume":"16","author":"Paige","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6423(88)90033-0_BIB59","first-page":"21","article-title":"A note on the expressive power of PROLOG","volume":"26","author":"Papadimitriou","year":"1985","journal-title":"Bull. EATCS"},{"key":"10.1016\/0167-6423(88)90033-0_BIB60","series-title":"Algorithm Design\u2014A Recursion Transformation Framework","author":"Paull","year":"1988"},{"key":"10.1016\/0167-6423(88)90033-0_BIB61","doi-asserted-by":"crossref","unstructured":"J.H. Reif and H.R. Lewis, Symbolic evaluation and the global value graph, Proc. 4th ACM Symp. Principles of Programming Languages.","DOI":"10.1145\/512950.512961"},{"key":"10.1016\/0167-6423(88)90033-0_BIB62","series-title":"Deriving efficient graph algorithms","author":"Reif","year":"1982"},{"issue":"3","key":"10.1016\/0167-6423(88)90033-0_BIB63","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1145\/2166.357218","article-title":"Incremental context-dependent analysis for language-based editors","volume":"5","author":"Reps","year":"1983","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0167-6423(88)90033-0_BIB64","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"issue":"2","key":"10.1016\/0167-6423(88)90033-0_BIB65","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1145\/357133.357135","article-title":"An automatic technique for selection of data representations in SETL programs","volume":"3","author":"Schonberg","year":"1981","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0167-6423(88)90033-0_BIB66","series-title":"CIMS","article-title":"On programming: an interim report on the SETL project","author":"Schwartz","year":"1974"},{"issue":"2","key":"10.1016\/0167-6423(88)90033-0_BIB67","first-page":"161","article-title":"Optimization of very high level languages, Part I","volume":"1","author":"Schwartz","year":"1975","journal-title":"Optimization of very high level languages, Part II"},{"issue":"12","key":"10.1016\/0167-6423(88)90033-0_BIB68","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1145\/361227.361235","article-title":"Automatic data structure choice in a language of very high level","volume":"18","author":"Schwartz","year":"1975","journal-title":"CACM"},{"key":"10.1016\/0167-6423(88)90033-0_BIB69","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","article-title":"Data types as lattices","volume":"5","author":"Scott","year":"1976","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/0167-6423(88)90033-0_BIB70","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1145\/357162.357166","article-title":"Some observations on formal differentiation","volume":"4","author":"Sharir","year":"1982","journal-title":"ACM TOPLAS"},{"issue":"1","key":"10.1016\/0167-6423(88)90033-0_BIB71","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1145\/942578.807086","article-title":"Calculating properties of programs by valuations on specific models","volume":"7","author":"Sintzoff","year":"1972","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/0167-6423(88)90033-0_BIB72","series-title":"Axiomatic Set Theory","author":"Suppes","year":"1972"},{"issue":"2","key":"10.1016\/0167-6423(88)90033-0_BIB73","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6423(88)90033-0_BIB74","series-title":"Algorithms and Complexity\u2014New Directions and Recent Results","first-page":"71","article-title":"Iterative algorithms for global flow analysis","author":"Tarjan","year":"1976"},{"key":"10.1016\/0167-6423(88)90033-0_BIB75","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."},{"issue":"9","key":"10.1016\/0167-6423(88)90033-0_BIB76","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/358746.358755","article-title":"The Cornell program synthesizer: a syntax-directed programming environment","volume":"24","author":"Teitelbaum","year":"1981","journal-title":"CACM"},{"key":"10.1016\/0167-6423(88)90033-0_BIB77","series-title":"Ph.D. Thesis","article-title":"Type determination for very high level languages","author":"Tenenbaum","year":"1974"},{"issue":"3","key":"10.1016\/0167-6423(88)90033-0_BIB78","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/3979.3980","article-title":"Implementation of logical query languages for databases","volume":"10","author":"Ullman","year":"1985","journal-title":"ACM TODS"},{"key":"10.1016\/0167-6423(88)90033-0_BIB79","series-title":"Proc. 14th ACM Symp. Theory of Computing","first-page":"137","article-title":"Complexity of relational query languages","author":"Vardi","year":"1982"},{"key":"10.1016\/0167-6423(88)90033-0_BIB80","series-title":"Proc. 12th ACM Symp. Principles of Programming Languages","first-page":"291","article-title":"Constant Propagation with Conditional Branches","author":"Wegman","year":"1985"},{"key":"10.1016\/0167-6423(88)90033-0_BIB81","series-title":"Proc. 13th Internat. Confer. Very Large Data Bases","first-page":"275","article-title":"An extended disjunctive normal form approach for processing recursive logic queries in loosely coupled environments","author":"Whang","year":"1987"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642388900330?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642388900330?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:29:12Z","timestamp":1555072152000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642388900330"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,4]]},"references-count":81,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,4]]}},"alternative-id":["0167642388900330"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(88)90033-0","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1989,4]]}}}