{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T05:15:28Z","timestamp":1733375728113,"version":"3.30.1"},"reference-count":89,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"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":4307,"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":[[2001,10]]},"DOI":"10.1016\/s0167-6423(01)00003-x","type":"journal-article","created":{"date-parts":[[2002,10,31]],"date-time":"2002-10-31T21:12:04Z","timestamp":1036098724000},"page":"139-172","source":"Crossref","is-referenced-by-count":10,"title":["Strengthening invariants for efficient computation"],"prefix":"10.1016","volume":"41","author":[{"given":"Yanhong A.","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott D.","family":"Stoller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Teitelbaum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1983","series-title":"Data Structures and Algorithms","author":"Aho","key":"10.1016\/S0167-6423(01)00003-X_BIB1"},{"year":"1986","series-title":"Compilers, Principles, Techniques, and Tools","author":"Aho","key":"10.1016\/S0167-6423(01)00003-X_BIB2"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB3","series-title":"Program Flow Analysis","first-page":"79","article-title":"Reduction of operator strength","author":"Allen","year":"1981"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB4","unstructured":"B. Alpern, R. Hoover, B. Rosen, P. Sweeney, K. Zadeck, Incremental evaluation of computational circuits, in: Proc. 1st Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM, New York, January 1990, pp. 32\u201342."},{"issue":"4","key":"10.1016\/S0167-6423(01)00003-X_BIB5","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1145\/6465.20890","article-title":"The PSG system","volume":"8","author":"Bahlke","year":"1986","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"1","key":"10.1016\/S0167-6423(01)00003-X_BIB6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1145\/125489.122804","article-title":"The Pan language-based editing system","volume":"1","author":"Ballance","year":"1992","journal-title":"ACM Trans. Soft. Eng. Methodol."},{"issue":"2","key":"10.1016\/S0167-6423(01)00003-X_BIB7","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1109\/32.21743","article-title":"Formal program construction by transformations \u2013 computer-aided, intuition-guided programming","volume":"15","author":"Bauer","year":"1989","journal-title":"IEEE Trans. Software Eng."},{"issue":"4","key":"10.1016\/S0167-6423(01)00003-X_BIB8","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1145\/1780.1781","article-title":"The promotion and accumulation strategies in transformational programming","volume":"6","author":"Bird","year":"1984","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"3","key":"10.1016\/S0167-6423(01)00003-X_BIB9","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/3550149","article-title":"Addendum","volume":"7","author":"Bird","year":"1985","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10.1016\/S0167-6423(01)00003-X_BIB10","doi-asserted-by":"crossref","unstructured":"P. Borras, D. Cl\u00e9ment, T. Despeyroux, J. Incerpi, G. Kahn, B. Lang. V. Pascual, CENTAUR: the system, in: Proc. ACM SIGSOFT\/SIGPLAN Software Engineering Symp. on Practical Software Development Environments, ACM, New York, November 1988, pp. 14\u201324.","DOI":"10.1145\/64137.65005"},{"year":"1979","series-title":"A Computational Logic, ACM Monograph Series","author":"Boyer","key":"10.1016\/S0167-6423(01)00003-X_BIB11"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB12","series-title":"Program Transformation and Programming Environments","first-page":"199","article-title":"Algebraic methods for program construction","author":"Broy","year":"1984"},{"issue":"1","key":"10.1016\/S0167-6423(01)00003-X_BIB13","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1093\/comjnl\/12.1.41","article-title":"Proving properties of programs by structural induction","volume":"12","author":"Burstall","year":"1969","journal-title":"Comput. J."},{"issue":"1","key":"10.1016\/S0167-6423(01)00003-X_BIB14","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\/S0167-6423(01)00003-X_BIB15","doi-asserted-by":"crossref","unstructured":"W.-N. Chin, Towards an automated tupling strategy, in: Proc. ACM SIGPLAN Symp. on Partial Evaluation and Semantics-Based Program Manipulation, ACM, New York, June 1993, pp. 119\u2013132.","DOI":"10.1145\/154630.154643"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB16","doi-asserted-by":"crossref","unstructured":"W.-N. Chin, M. Hagiya, A bounds inference method for vector-based memoization, in: Proc. ACM SIGPLAN Internat. Conf. on Functional Programming, ACM, New York, June 1997, pp. 176\u2013187.","DOI":"10.1145\/258948.258965"},{"issue":"11","key":"10.1016\/S0167-6423(01)00003-X_BIB17","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"},{"year":"1986","series-title":"Implementing Mathematics with the Nuprl Proof Development System","author":"Constable","key":"10.1016\/S0167-6423(01)00003-X_BIB18"},{"year":"1990","series-title":"Introduction to Algorithms","author":"Cormen","key":"10.1016\/S0167-6423(01)00003-X_BIB19"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB20","doi-asserted-by":"crossref","unstructured":"N. Dershowitz, in: The Evolution of Programs, Progress in Computer Science, Vol. 5, Birkh\u00e4user, Boston, 1983.","DOI":"10.1007\/978-1-4612-5621-2_7"},{"year":"1976","series-title":"A Discipline of Programming, Prentice-Hall Series in Automatic Computation","author":"Dijkstra","key":"10.1016\/S0167-6423(01)00003-X_BIB21"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB22","series-title":"Interactive Programming Environments","first-page":"128","article-title":"Programming environments based on structure editor","author":"Donzeau-Gouge","year":"1984"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB23","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. Lang."},{"issue":"1","key":"10.1016\/S0167-6423(01)00003-X_BIB24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/357153.357154","article-title":"A system for assisting program transformation","volume":"4","author":"Feather","year":"1982","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10.1016\/S0167-6423(01)00003-X_BIB25","doi-asserted-by":"crossref","unstructured":"J. Field, T. Teitelbaum, Incremental reduction in the lambda calculus, in: Proc. ACM Conf. on LISP and Functional Programming, ACM, New York, June 1990, pp. 307\u2013322.","DOI":"10.1145\/91556.91679"},{"year":"1963","series-title":"The Logic of Computer Arithmetic","author":"Flores","key":"10.1016\/S0167-6423(01)00003-X_BIB26"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB27","unstructured":"Proc. 4th Internat. Conf. on Functional Programming Languages and Computer Architecture, ACM, New York, September 1989."},{"key":"10.1016\/S0167-6423(01)00003-X_BIB28","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1126\/science.267.5196.332","article-title":"Mathematical logic flushes out the bugs in chip designs","volume":"267","author":"Glanz","year":"1995","journal-title":"Science"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB29","unstructured":"G. G\u00f3mez, Y.A. Liu, Automatic time-bound analysis for a higher-order language, Tech. Rep. TR 535, Computer Science Department, Indiana University, November 1999."},{"key":"10.1016\/S0167-6423(01)00003-X_BIB30","unstructured":"GrammaTech, Inc. Synthesizer Generator Scripting Language Supplemental Manual, Release 5.0, GrammaTech, Inc., Ithaca, New York, 1996."},{"year":"1981","series-title":"The Science of Programming","author":"Gries","key":"10.1016\/S0167-6423(01)00003-X_BIB31"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB32","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0167-6423(83)90015-1","article-title":"A note on a standard strategy for developing loop invariants and loops","volume":"2","author":"Gries","year":"1984","journal-title":"Sci. Comput. Program."},{"issue":"12","key":"10.1016\/S0167-6423(01)00003-X_BIB33","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1109\/TSE.1986.6313007","article-title":"Gandalf","volume":"SE-12","author":"Habermann","year":"1986","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0167-6423(01)00003-X_BIB34","doi-asserted-by":"crossref","unstructured":"R. Hoover, Alphonse: incremental computation as a programming abstraction, in: Proc. ACM SIGPLAN \u201992 Conf. on Programming Language Design and Implementation, ACM, New York, June 1992, pp. 261\u2013272.","DOI":"10.1145\/143095.143139"},{"issue":"4","key":"10.1016\/S0167-6423(01)00003-X_BIB35","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. Program. Lang. Syst."},{"key":"10.1016\/S0167-6423(01)00003-X_BIB36","doi-asserted-by":"crossref","unstructured":"F. Jalili, J.H. Gallier, Building friendly parsers, in: Conf. Record of the 9th Ann. ACM Symp. on Principles of Programming Languages, ACM, New York, January 1982, pp. 196\u2013206.","DOI":"10.1145\/582153.582175"},{"year":"1993","series-title":"Partial Evaluation and Automatic Program Generation","author":"Jones","key":"10.1016\/S0167-6423(01)00003-X_BIB37"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB38","doi-asserted-by":"crossref","unstructured":"N.D. Jones, P. Sestoft, H. S\u00f8ndergaard, An experiment in partial evaluation: the generation of a compiler generator, in: J.-P. Jouannaud (Ed.), Rewriting Techniques and Applications, Lecture Notes in Computer Science, Vol. 202, Springer, Berlin, May 1985, pp. 124\u2013140.","DOI":"10.1007\/3-540-15976-2_6"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB39","doi-asserted-by":"crossref","unstructured":"S.B. Jones, D. Le M\u00e9tayer, Compile-time garbage collection by sharing analysis, in: FPCA 1989 [27], pp. 54\u201374.","DOI":"10.1145\/99370.99375"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB40","doi-asserted-by":"crossref","unstructured":"U. Jorring, W.L. Scherlis, Compilers and staging transformations, in: Conf. Record of the 13th Annual ACM Symp. on Principles of Programming Languages, ACM, New York, January 1986, pp. 86\u201396.","DOI":"10.1145\/512644.512652"},{"issue":"2","key":"10.1016\/S0167-6423(01)00003-X_BIB41","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/63264.63400","article-title":"Incremental dynamic semantics for language-based programming environments","volume":"11","author":"Kaiser","year":"1989","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"3","key":"10.1016\/S0167-6423(01)00003-X_BIB42","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF00288644","article-title":"Ordered attributed grammars","volume":"13","author":"Kastens","year":"1980","journal-title":"Acta Inform."},{"issue":"3","key":"10.1016\/S0167-6423(01)00003-X_BIB43","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/579.586","article-title":"Translation of attribute grammars into procedures","volume":"6","author":"Katayama","year":"1984","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10.1016\/S0167-6423(01)00003-X_BIB44","unstructured":"S.C. Kleene, Introduction to Metamathematics, Van Nostrand, New York, 1952. 10th reprint, Wolters-Noordhoff Publishing, Groningen and North-Holland Publishing Company, Amsterdam, 1991."},{"key":"10.1016\/S0167-6423(01)00003-X_BIB45","series-title":"Partial Evaluation and Mixed Computation","first-page":"299","article-title":"Projections for specialisation","author":"Launchbury","year":"1988"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB46","doi-asserted-by":"crossref","unstructured":"Y.A. Liu, CACHET: An interactive, incremental-attribution-based program transformation system for deriving incremental programs, in: Proc 10th Knowledge-Based Software Engineering Conf., IEEE CS Press, Los Alamitos, CA, November 1995, pp. 19\u201326.","DOI":"10.1109\/KBSE.1995.490115"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB47","series-title":"Algorithmic Languages and Calculi","first-page":"357","article-title":"Principled strength reduction","author":"Liu","year":"1997"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB48","doi-asserted-by":"crossref","unstructured":"Y.A. Liu, Dependence analysis for recursive data, in: Proc. IEEE Internat. Conf. on Computer Languages, IEEE CS Press, Los Alamitos, CA., May 1998, pp. 206\u2013215.","DOI":"10.1109\/ICCL.1998.674171"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB49","doi-asserted-by":"crossref","unstructured":"Y.A. Liu, G. G\u00f3mez, Automatic accurate time-bound analysis for high-level languages, in: Proc. ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems, Lecture Notes in Computer Science, Vol. 1474, Springer, Berlin, June 1998, pp. 31\u201340.","DOI":"10.1007\/BFb0057778"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB50","doi-asserted-by":"crossref","unstructured":"Y.A. Liu, S.D. Stoller, Loop optimization for aggregate array computations, in: Proc. IEEE Internat. Conf. on Computer Languages, IEEE CS Press, Los Alamitos, CA, May 1998, pp. 262\u2013271.","DOI":"10.1109\/ICCL.1998.674176"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB51","unstructured":"Y.A. Liu, S.D. Stoller, Dynamic programming via static incrementalization, in: Proc 8th European Symp. on Programming, Lecture Notes in Computer Science, Vol. 1576, Springer, Berlin, March 1999, pp. 288\u2013305."},{"key":"10.1016\/S0167-6423(01)00003-X_BIB52","unstructured":"Y.A. Liu, S.D. Stoller, Eliminating dead code on recursive data, in: Proc. 6th Internat. Static Analysis Symp. Lecture Notes in Computer Science, Vol. 1694, Venice, Italy, September 1999, Springer, Berlin, pp. 211\u2013231."},{"key":"10.1016\/S0167-6423(01)00003-X_BIB53","doi-asserted-by":"crossref","unstructured":"Y.A. Liu, S.D. Stoller, From recursion to iteration: what are the optimizations?, in: Proc. ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, ACM, New York, January 2000, pp. 73\u201382.","DOI":"10.1145\/328691.328700"},{"issue":"3","key":"10.1016\/S0167-6423(01)00003-X_BIB54","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1145\/291889.291895","article-title":"Static caching for incremental computation","volume":"20","author":"Liu","year":"1998","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10.1016\/S0167-6423(01)00003-X_BIB55","doi-asserted-by":"crossref","unstructured":"Y.A. Liu, T. Teitelbaum, Caching intermediate results for program improvement, in: Proc. ACM SIGPLAN Symp. on Partial Evaluation and Semantics-Based Program Manipulation, ACM, New York, June 1995, pp. 190\u2013201.","DOI":"10.1145\/215465.215590"},{"issue":"1","key":"10.1016\/S0167-6423(01)00003-X_BIB56","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(94)00031-9","article-title":"Systematic derivation of incremental programs","volume":"24","author":"Liu","year":"1995","journal-title":"Sci. Comput. Program."},{"issue":"1","key":"10.1016\/S0167-6423(01)00003-X_BIB57","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/357084.357090","article-title":"A deductive approach to program synthesis","volume":"2","author":"Manna","year":"1980","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"8","key":"10.1016\/S0167-6423(01)00003-X_BIB58","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1109\/32.153379","article-title":"Fundamentals of deductive program synthesis","volume":"18","author":"Manna","year":"1992","journal-title":"IEEE Trans. Software Eng."},{"year":"1993","series-title":"The Deductive Foundations of Computer Programming","author":"Manna","key":"10.1016\/S0167-6423(01)00003-X_BIB59"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB60","first-page":"52","article-title":"Non-restoring integer square root","volume":"Vol. 901","author":"O'Leary","year":"1995"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB61","doi-asserted-by":"crossref","unstructured":"B. Paige, J.T. Schwartz, Expression continuity and the formal differentiation of algorithms, in: Conf. Record of the 4th Ann. ACM Symp. on Principles of Programming Languages, ACM, New York, January 1977, pp. 58\u201371.","DOI":"10.1145\/512950.512957"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB62","doi-asserted-by":"crossref","unstructured":"R. Paige, Transformational programming \u2013 Applications to algorithms and systems, in: Conf. Record of the 10th Ann. ACM Symp. on Principles of Programming Languages, ACM, New York, January 1983, pp, 73\u201387.","DOI":"10.1145\/567067.567076"},{"issue":"1","key":"10.1016\/S0167-6423(01)00003-X_BIB63","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":"3","key":"10.1016\/S0167-6423(01)00003-X_BIB64","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. Program. Lang. Syst."},{"year":"1990","series-title":"Specification and Transformation of Programs \u2013 A Formal Approach to Software Development","author":"Partsch","key":"10.1016\/S0167-6423(01)00003-X_BIB65"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB66","doi-asserted-by":"crossref","unstructured":"A. Pettorossi, A powerful strategy for deriving efficient programs by transformation, in: Conf. Record of the 1984 ACM Symp. on LISP and Functional Programming, ACM, New York, August 1984.","DOI":"10.1145\/800055.802044"},{"issue":"2","key":"10.1016\/S0167-6423(01)00003-X_BIB67","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1145\/234528.234529","article-title":"Rules and strategies for transforming functional and logic programs","volume":"28","author":"Pettorossi","year":"1996","journal-title":"ACM Comput. Survey"},{"issue":"2","key":"10.1016\/S0167-6423(01)00003-X_BIB68","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1145\/128861.128865","article-title":"Incremental global reoptimization of programs","volume":"14","author":"Pollock","year":"1992","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"8","key":"10.1016\/S0167-6423(01)00003-X_BIB69","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1145\/135226.135233","article-title":"The Omega test","volume":"31","author":"Pugh","year":"1992","journal-title":"Commun. ACM"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB70","doi-asserted-by":"crossref","unstructured":"W. Pugh, T. Teitelbaum, Incremental computation via function caching, in: Conf. Record of the 16th Ann. ACM Symp. on Principles of Programming Languages, ACM, New York, January 1989, pp. 315\u2013328.","DOI":"10.1145\/75277.75305"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB71","doi-asserted-by":"crossref","unstructured":"S.P. Reiss, An approach to incremental compilation, in: Proc. ACM SIGPLAN \u201984 Symp. on Compiler Construction, ACM, New York, June 1984, pp. 144\u2013156. Published as SIGPLAN Notices, 19(6).","DOI":"10.1145\/502874.502889"},{"year":"1988","series-title":"The Synthesizer Generator: A System for Constructing Language-Based Editors","author":"Reps","key":"10.1016\/S0167-6423(01)00003-X_BIB72"},{"issue":"3","key":"10.1016\/S0167-6423(01)00003-X_BIB73","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 Trans. Program. Lang. Syst."},{"year":"1981","series-title":"The Craft of Programming","author":"Reynolds","key":"10.1016\/S0167-6423(01)00003-X_BIB74"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB75","doi-asserted-by":"crossref","unstructured":"M. Rosendahl, Automatic complexity analysis, in: FPCA 1989 [27], pp. 144\u2013156.","DOI":"10.1145\/99370.99381"},{"issue":"1","key":"10.1016\/S0167-6423(01)00003-X_BIB76","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. Program. Lang. Syst."},{"issue":"9","key":"10.1016\/S0167-6423(01)00003-X_BIB77","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1109\/32.58788","article-title":"KIDS","volume":"16","author":"Smith","year":"1990","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0167-6423(01)00003-X_BIB78","first-page":"394","article-title":"Efficient code motion and an adaption to strength reduction","volume":"Vol. 494","author":"Steffen","year":"1991"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB79","doi-asserted-by":"crossref","unstructured":"R.S. Sundaresh, P. Hudak, Incremental computation via partial evaluation, in: Conf. Record of the 18th Annual ACM Symp. on Principles of Programming Languages, ACM, New York, January 1991, pp. 1\u201313.","DOI":"10.1145\/99583.99587"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB80","unstructured":"L. Unnikrishnan, S.D. Stoller, Y.A. Liu, Automatic accurate stack space and heap space analysis for high-level languages, Tech. Rep. TR 538, Computer Science Department, Indiana University, February 2000."},{"key":"10.1016\/S0167-6423(01)00003-X_BIB81","doi-asserted-by":"crossref","unstructured":"M. Wand, W.D. Clinger. Set constraints for destructive array update optimization, in: Proc. IEEE Internat. Conf. on Computer Languages, IEEE CS Press, Los Alamitos, CA, May 1998, pp. 184\u2013193.","DOI":"10.1109\/ICCL.1998.674169"},{"issue":"2","key":"10.1016\/S0167-6423(01)00003-X_BIB82","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/2.121472","article-title":"Steps towards architecture-independent image processing","volume":"25","author":"Webb","year":"1992","journal-title":"IEEE Comput."},{"issue":"9","key":"10.1016\/S0167-6423(01)00003-X_BIB83","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":"4","key":"10.1016\/S0167-6423(01)00003-X_BIB84","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1109\/TSE.1984.5010248","article-title":"Program slicing","volume":"SE-10","author":"Weiser","year":"1984","journal-title":"IEEE Trans. Software Eng."},{"issue":"2","key":"10.1016\/S0167-6423(01)00003-X_BIB85","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1109\/TPAMI.1986.4767776","article-title":"III. Efficient synthesis of Gaussian filters by cascaded uniform filters","volume":"8","author":"Wells","year":"1986","journal-title":"IEEE Trans. Patt. Anal. Mach. Intell."},{"issue":"2","key":"10.1016\/S0167-6423(01)00003-X_BIB86","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1145\/103135.103137","article-title":"INC","volume":"13","author":"Yellin","year":"1991","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10.1016\/S0167-6423(01)00003-X_BIB87","unstructured":"R. Zabih, Individuating unknown objects by combining motion and stereo, Ph.D. Thesis, Department of Computer Science, Stanford University, Stanford, CA, 1994."},{"key":"10.1016\/S0167-6423(01)00003-X_BIB88","series-title":"Proc. 3rd European Conf. on Computer Vision, volume 801 of Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BFb0028345","article-title":"Non-parametric local transforms for computing visual correspondence","author":"Zabih","year":"1994"},{"key":"10.1016\/S0167-6423(01)00003-X_BIB89","doi-asserted-by":"crossref","unstructured":"Y. Zhang, Y.A. Liu, Automating derivation of incremental programs, in: Proc. ACM SIGPLAN Internat. Conf. on Functional Programming, ACM, New York, September 1998, p. 350.","DOI":"10.1145\/289423.289480"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016764230100003X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016764230100003X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T07:04:09Z","timestamp":1733295849000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016764230100003X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":89,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S016764230100003X"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6423(01)00003-x","relation":{},"ISSN":["0167-6423"],"issn-type":[{"type":"print","value":"0167-6423"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}