Incremental Computation for Transformational Software Development
| dc.contributor.author | Liu, Yanhong A. | en_US |
| dc.contributor.author | Teitelbaum, Tim | en_US |
| dc.date.accessioned | 2007-04-23T18:01:25Z | |
| dc.date.available | 2007-04-23T18:01:25Z | |
| dc.date.issued | 1995-03 | en_US |
| dc.description.abstract | Given a program $f$ and an input change $\oplus$, we wish to obtain an incremental program that computes $f(x\oplus y)$ efficiently by making use of the value of $f(x)$, the intermediate results computed in computing $f(x)$, and auxiliary information about $x$ that can be inexpensively maintained. Obtaining such incremental programs is an essential part of the transformational-programming approach to software development and enhancement. This paper presents a systematic approach that discovers a general class of useful auxiliary information, combines it with useful intermediate results, and obtains an efficient incremental program that uses and maintains these intermediate results and auxiliary information. We give a number of examples from list processing, VLSI circuit design, image processing, {\it etc}. | en_US |
| dc.format.extent | 265044 bytes | |
| dc.format.extent | 238243 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR95-1499 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/7157 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Incremental Computation for Transformational Software Development | en_US |
| dc.type | technical report | en_US |