Yanhong A. Liu, Scott D. Stoller, Tim Teitelbaum  Home/Search
Context Related
| sunysb.edu/pub/liu/SIECSCP.ps.gz sunysb.edu/pub/liu/SIECSCP01.ps.gz Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: sunysb.edu/~liu/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper presents program analyses and transformations for strengthening invariants for the purpose of efficient computation. Finding the stronger invariants corresponds to discovering a general class of auxiliary information for any incremental computation problem. Combining the techniques with previous techniques for caching intermediate results, we obtain a systematic approach that transforms non-incremental programs into ecient incremental programs that use and maintain useful auxiliary... (Update)
Similar documents based on text: More All
0.6: Optimizing Ackermann's Function by Incrementalization - Liu, Stoller (2001) (Correct)
0.5: Incremental Computation for Transformational Software.. - Yanhong Liu Tim (1995) (Correct)
0.4: Efficient Computation via Incremental Computation - Yanhong Liu July (Correct)
BibTeX entry: (Update)
Y. A. Liu, S. D. Stoller, and T. Teitelbaum. Strengthening invariants for ecient computation. Sci. Comput. Program., 2001. To appear. http://citeseer.ist.psu.edu/liu01strengthening.html More
@article{ liu01strengthening,
author = "Yanhong A. Liu and Scott D. Stoller and Tim Teitelbaum",
title = "Strengthening invariants for efficient computation",
journal = "Science of Computer Programming",
volume = "41",
number = "2",
pages = "139--172",
year = "2001",
url = "citeseer.ist.psu.edu/liu01strengthening.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
638 Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
505 Implementing Mathematics with the Nuprl Proof Development Sy.. - Constable - 1986
452 Data Structures and Algorithms (context) - Aho, Hopcroft et al. - 1983
385 A transformation system for developing recursive programs - Burstall, Darlington - 1977
275 The Science of Programming (context) - Gries - 1981
265 Program slicing (context) - Weiser - 1984
245 The Omega Test: A fast and practical integer programming alg.. - Pugh - 1992
204 KIDS: A semiautomatic program development system - Smith - 1990
171 The Synthesizer Generator: A System for Constructing Languag.. (context) - Reps, Teitelbaum - 1988
159 and Tools (context) - Aho, Sethi et al. - 1986
127 CENTAUR: The system - Borras, Cl et al. - 1988
94 A deductive approach to program synthesis (context) - Manna, Waldinger - 1980
86 Gandalf: Software development environments (context) - Habermann, Notkin - 1986
85 An experiment in partial evaluation: The generation of a com.. (context) - Jones, Sestoft et al. - 1985
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.sunysb.edu/~liu/): More
Dynamic Programming via Static Incrementalization - Liu, Stoller (2000) (Correct)
Optimizing Ackermann's function by incrementalization - Liu, Stoller (2000) (Correct)
Eliminating Dead Code on Recursive Data - Liu, Stoller (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC