{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:42:30Z","timestamp":1778298150325,"version":"3.51.4"},"reference-count":52,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,2,1]],"date-time":"1995-02-01T00:00:00Z","timestamp":791596800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,2,1]],"date-time":"1995-02-01T00:00:00Z","timestamp":791596800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2000,4,18]],"date-time":"2000-04-18T00:00:00Z","timestamp":956016000000},"content-version":"vor","delay-in-days":1903,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1995,2]]},"DOI":"10.1016\/0167-6423(94)00031-9","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:32:00Z","timestamp":1049729520000},"page":"1-39","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":58,"title":["Systematic derivation of incremental programs"],"prefix":"10.1016","volume":"24","author":[{"given":"Yanhong A.","family":"Liu","sequence":"first","affiliation":[]},{"given":"Tim","family":"Teitelbaum","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(94)00031-9_BIB1","article-title":"Compilers, Principles, Techniques, and Tools","author":"Aho","year":"1986"},{"key":"10.1016\/0167-6423(94)00031-9_BIB2","series-title":"Proc. 1st Ann. ACM-SIAM Symp. on Discrete Algorithms","first-page":"32","article-title":"Incremental evaluation of computational circuits","author":"Alpern","year":"1990"},{"issue":"1","key":"10.1016\/0167-6423(94)00031-9_BIB3","first-page":"95","article-title":"The Pan language-based editing system","volume":"1","author":"Ballance","year":"1992","journal-title":"ACM Trans. Programming Languages Systems"},{"issue":"4","key":"10.1016\/0167-6423(94)00031-9_BIB4","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1145\/356827.356831","article-title":"Tabulation techniques for recursive programs","volume":"12","author":"Bird","year":"1980","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0167-6423(94)00031-9_BIB5","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0167-6423(91)90002-F","article-title":"Automatic autoprojection of recursive equations with global variables and abstract data types","volume":"16","author":"Bondorf","year":"1991","journal-title":"Sci. Comput. Programming"},{"issue":"1","key":"10.1016\/0167-6423(94)00031-9_BIB6","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/321992.321996","article-title":"A transformation system for developing recursive programs","volume":"24","author":"Burstall","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/0167-6423(94)00031-9_BIB7","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":"1988","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(94)00031-9_BIB8","first-page":"223","article-title":"Achieving incremental consistency among autonomous replicated databases","volume":"A25","author":"Ceri","year":"1993","journal-title":"IFIP Trans. A [Computer Science and Technology]"},{"issue":"11","key":"10.1016\/0167-6423(94)00031-9_BIB9","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":"Commun. ACM"},{"key":"10.1016\/0167-6423(94)00031-9_BIB10","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0096-0551(75)90019-3","article-title":"High leveliterators 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(94)00031-9_BIB11","series-title":"Proc. 33rd Ann. IEEE Symp. on FOCS","article-title":"Sparsification \u2014 a technique for speeding up dynamic graph algorithms","author":"Eppstein","year":"1992"},{"key":"10.1016\/0167-6423(94)00031-9_BIB12","series-title":"Proc. ACM '90 Conf. on LISP and Functional Programming","first-page":"307","article-title":"Incremental reduction in the lambda calculus","author":"Field","year":"1990"},{"issue":"1","key":"10.1016\/0167-6423(94)00031-9_BIB13","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1145\/76372.77531","article-title":"An incremental constraint solver","volume":"33","author":"Freeman-Benson","year":"1990","journal-title":"Commun. ACM"},{"key":"10.1016\/0167-6423(94)00031-9_BIB14","series-title":"Partial Evaluation and Mixed Computation","first-page":"133","article-title":"Generalized partial evaluation","author":"Futamura","year":"1988"},{"issue":"1","key":"10.1016\/0167-6423(94)00031-9_BIB15","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/357062.357066","article-title":"Incremental parsing","volume":"1","author":"Ghezzi","year":"1979","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/0167-6423(94)00031-9_BIB16","series-title":"Proc. of the ACM SIGPLAN '92 Conf. on PLDI","first-page":"261","article-title":"Alphonse: Incremental computation as a programming abstraction","author":"Hoover","year":"1992"},{"issue":"4","key":"10.1016\/0167-6423(94)00031-9_BIB17","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1145\/6465.6512","article-title":"Generating editing environments based on relations and attributes","volume":"8","author":"Horwitz","year":"1986","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/0167-6423(94)00031-9_BIB18","series-title":"Conf. Record of the 9th Ann. ACM Symp. on POPL","first-page":"196","article-title":"Building friendly parsers","author":"Jalili","year":"1982"},{"key":"10.1016\/0167-6423(94)00031-9_BIB19","series-title":"Partial Evaluation and Automatic Program Generation","author":"Jones","year":"1993"},{"issue":"6","key":"10.1016\/0167-6423(94)00031-9_BIB20","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1109\/69.180604","article-title":"Incremental recovery in main memory database systems","volume":"4","author":"Levy","year":"1992","journal-title":"IEEE Trans. Knowledge Data Eng."},{"issue":"5","key":"10.1016\/0167-6423(94)00031-9_BIB21","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1109\/TSE.1981.231109","article-title":"An incremental programming environment","volume":"SE-7","author":"Medina-Mora","year":"1981","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/0167-6423(94)00031-9_BIB22","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1038\/218019a0","article-title":"\u201cMemo\u201d functions and machine learning","volume":"218","author":"Michie","year":"1968","journal-title":"Nature"},{"key":"10.1016\/0167-6423(94)00031-9_BIB23","series-title":"Partial Evaluation and Mixed Computation","first-page":"325","article-title":"Partially static structures in a self-applicable partial evaluator","author":"Mogensen","year":"1988"},{"key":"10.1016\/0167-6423(94)00031-9_BIB24","series-title":"Program Flow Analysis: Theory and Applications","year":"1981"},{"key":"10.1016\/0167-6423(94)00031-9_BIB25_1","article-title":"Formal Differentiation: A Program Synthesis Technique","volume":"Vol. 7","author":"Paige","year":"1981"},{"key":"10.1016\/0167-6423(94)00031-9_BIB25_2","author":"Paige","year":"1979"},{"key":"10.1016\/0167-6423(94)00031-9_BIB26","series-title":"Conf. Record of the 10th Ann. ACM Symp. on POPL","first-page":"73","article-title":"Transformational programming \u2014 applications to algorithms and system","author":"Paige","year":"1983"},{"key":"10.1016\/0167-6423(94)00031-9_BIB27","first-page":"171","article-title":"Applications of finite differencing to database integrity control and query\/transaction optimization","volume":"Vol 2","author":"Paige","year":"1984"},{"key":"10.1016\/0167-6423(94)00031-9_BIB28","series-title":"Proc. 3rd ESOP","first-page":"36","article-title":"Symbolic finite differencing \u2014 Part I","volume":"Vol. 432","author":"Paige","year":"1990"},{"issue":"2","key":"10.1016\/0167-6423(94)00031-9_BIB29","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 \u2014 A case study","volume":"4","author":"Paige","year":"1987","journal-title":"J. Symbolic Comput."},{"issue":"3","key":"10.1016\/0167-6423(94)00031-9_BIB30","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 Trans. Programming Languages Systems"},{"key":"10.1016\/0167-6423(94)00031-9_BIB31","article-title":"Specification and Transformation of Programs \u2014 A Formal Approach to Software Development","author":"Partsch","year":"1990"},{"key":"10.1016\/0167-6423(94)00031-9_BIB32","series-title":"Conf. Record of the 16th Ann. ACM Symp. on POPL","first-page":"315","article-title":"Incremental computation via function caching","author":"Pugh","year":"1989"},{"key":"10.1016\/0167-6423(94)00031-9_BIB33","series-title":"Conf. Record of the 20th Ann. ASCM Symp. on POPL","first-page":"502","article-title":"A categorized bibliography on incremental computation","author":"Ramalingam","year":"1993"},{"key":"10.1016\/0167-6423(94)00031-9_BIB34","series-title":"The Synthesizer Generator: A System for Constructing Language-Based Editors","author":"Reps","year":"1988"},{"issue":"3","key":"10.1016\/0167-6423(94)00031-9_BIB35","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":"Teps","year":"1983","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/0167-6423(94)00031-9_BIB36","series-title":"Proc. 4th Internat. Conf. on FPCA","first-page":"144","article-title":"Automatic complexity analysis","author":"Rosendahl","year":"1989"},{"issue":"1","key":"10.1016\/0167-6423(94)00031-9_BIB37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/42192.42193","article-title":"Incremental data flow analysis algorithms","volume":"10","author":"Ryder","year":"1988","journal-title":"ACM Trans. Programming Languages Systems"},{"issue":"9","key":"10.1016\/0167-6423(94)00031-9_BIB38","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1109\/32.58788","article-title":"KIDS: A semiautomatic program development system","volume":"16","author":"Smith","year":"1990","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/0167-6423(94)00031-9_BIB39","series-title":"Automating Software Design","article-title":"KIDS \u2014 A knowledge-based software development system","author":"Smith","year":"1991"},{"key":"10.1016\/0167-6423(94)00031-9_BIB40","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0167-6423(90)90025-9","article-title":"Algorithm theories and design tactics","volume":"14","author":"Smith","year":"1990","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(94)00031-9_BIB41_1","series-title":"Proc. of the Symp. on PEPM","first-page":"83","article-title":"Building incremental programs using partial evaluation","author":"Sundaresh","year":"1991"},{"key":"10.1016\/0167-6423(94)00031-9_BIB41_2","unstructured":"Published as SIGPLAN Notices, 26(9)."},{"key":"10.1016\/0167-6423(94)00031-9_BIB42","series-title":"Conf. Record of the 18th Ann. ACM Symp. on POPL","first-page":"1","article-title":"Incremental computation via partial evaluation","author":"Sundaresh","year":"1991"},{"issue":"3","key":"10.1016\/0167-6423(94)00031-9_BIB43","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1145\/5956.5957","article-title":"The concept of a supercompiler","volume":"8","author":"Turchin","year":"1986","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/0167-6423(94)00031-9_BIB44","article-title":"Incremental constraint satisfaction and its application to graphical interfaces","author":"Vander Zanden","year":"1988"},{"issue":"2","key":"10.1016\/0167-6423(94)00031-9_BIB45","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1109\/49.126988","article-title":"An incremental algorithm for TDM switching assignments in satellite and terrestrial networks","volume":"10","author":"Varma","year":"1992","journal-title":"IEEE J. Selected Areas Commun."},{"issue":"9","key":"10.1016\/0167-6423(94)00031-9_BIB46","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1145\/361002.361016","article-title":"Mechanical program analysis","volume":"18","author":"Wegbreit","year":"1975","journal-title":"Commun. ACM"},{"issue":"2","key":"10.1016\/0167-6423(94)00031-9_BIB47","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/TSE.1976.233533","article-title":"Goal-directed program transformation","volume":"SE-2","author":"Wegbreit","year":"1976","journal-title":"IEEE Trans. Software Eng"},{"issue":"12","key":"10.1016\/0167-6423(94)00031-9_BIB48","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1145\/57669.57672","article-title":"Improvements on an incremental evaluation algorithm for ordered attribute grammars","volume":"23","author":"Yeh","year":"1988","journal-title":"SIGPLAN Notices"},{"issue":"4","key":"10.1016\/0167-6423(94)00031-9_BIB49","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF01209711","article-title":"Speeding up dynamic transitive closure for bounded degree graphs","volume":"30","author":"Yellin","year":"1993","journal-title":"Acta Inform."},{"issue":"2","key":"10.1016\/0167-6423(94)00031-9_BIB50","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1145\/103135.103137","article-title":"INC: A language for incremental computations","volume":"13","author":"Yellin","year":"1991","journal-title":"ACM Trans. Programming Languages Systems"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642394000319?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642394000319?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:20:41Z","timestamp":1757452841000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642394000319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,2]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,2]]}},"alternative-id":["0167642394000319"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(94)00031-9","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1995,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Systematic derivation of incremental programs","name":"articletitle","label":"Article Title"},{"value":"Science of Computer Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0167-6423(94)00031-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1995 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}