Yanhong A. Liu, Ning Li, Scott D. Stoller  Home/Search
Context Related
| sunysb.edu/pub/stoller/SAS2001.ps.gz Cached: PS.gz PS 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.
Image Update HelpPS.gz PS PDF From: sunysb.edu/~stoller (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper describes the precise speci cation, design, analysis, implementation, and measurements of an ecient algorithm for solving regular tree grammar based constraints. The particular constraints are for dead-code elimination on recursive data, but the method used for the algorithm design and complexity analysis is general and applies to other program analysis problems as well. The method is centered around Paige's nite di erencing, i.e., computing expensive set expressions... (Update)
Context of citations to this paper: More
.... as shown by our prototype implementation and supported by our recent work on the formal design and analysis of the simpli cation algorithm [35]. Example 5.2 Suppose we need the result of len and therefore added N 28 L; we obtain the productions in Figure 7(a) Suppose we need...
.... values and algebraic properties of the computations involved so as to fold the rst iteration back into the loop body, as done in [13, 46, 48]. In general, code size might have to increase. In fact, it is exactly the optimization studied in this paper that allows a programmer...
Cited by: More
From Datalog Rules to Efficient Programs with Time and Space.. - Liu, Stoller (2003) (Correct)
Dynamic Programming via Static Incrementalization - Liu, Stoller (2002) (Correct)
From Datalog Rules to Optimal Algorithms with Time and Space.. - Liu, Stoller (2003) (Correct)
Similar documents (at the sentence level):
40.9%: Solving Regular Tree Grammar Based Constraints - Liu, Li, Stoller (2000) (Correct)
6.4%: Solving Regular Path Queries - Liu, Yu (2002) (Correct)
Active bibliography (related documents): More All
1.1: Eliminating Dead Code on Recursive Data - Liu, Stoller (2001) (Correct)
0.6: SETL for Internet Data Processing - Bacon (2000) (Correct)
0.3: Efficient Computation via Incremental Computation - Liu (1999) (Correct)
Similar documents based on text: More All
0.1: Static Caching for Incremental Computation - Liu, Stoller, Teitelbaum (1998) (Correct)
0.1: Program Optimization using Indexed and Recursive Data Structures - Liu, Stoller (2001) (Correct)
0.1: [30] R. Paige. Applications of finite differencing to.. - Advances In Database (Correct)
Related documents from co-citation: More All
6: erencing of computable expressions (context) - Paige, Koenig - 1982
6: Static caching for incremental computation - Liu, Stoller et al. - 1998
4: The Synthesizer Generator : a System for Constructing Language-based Editors (context) - Reps, Teitelbaum - 1989
BibTeX entry: (Update)
Y. A. Liu, N. Li, and S. D. Stoller. Solving regular tree grammar based constraints. Technical Report TR 540, Computer Science Department, Indiana University, July 2000. http://citeseer.ist.psu.edu/article/liu00solving.html More
@article{ liu01solving,
author = "Yanhong A. Liu and Ning Li and Scott D. Stoller",
title = "Solving Regular Tree Grammar Based Constraints",
journal = "Lecture Notes in Computer Science",
volume = "2126",
pages = "213--??",
year = "2001",
url = "citeseer.ist.psu.edu/article/liu00solving.html" }
Citations (may not include all citations):1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
981 Principles of Database and Knowledge-Base Systems (context) - Ullman - 1988
228 Points-to analysis in almost linear time - Steensgaard - 1996
207 Flow analysis and optimization of LISP-like structures (context) - Jones, Muchnick - 1981
181 Principles of Program Analysis (context) - Nielson, Nielson et al. - 1999
171 The Synthesizer Generator: A System for Constructing Languag.. (context) - Reps, Teitelbaum - 1988
165 Set-based analysis of ML programs (context) - Heintze
157 Soft typing with conditional types - Aiken, Wimmers et al. - 1994
101 Programming with Sets: An Introduction to SETL (context) - Schwartz, Dewar et al. - 1986
67 Componential set-based analysis - Flanagan, Felleisen - 1999
57 Systematic derivation of incremental programs - Liu, Teitelbaum - 1995
54 Partial online cycle elimination in inclusion constraint gra.. - ahndrich, Foster et al. - 1998
53 Static type inference in a dynamically typed language - Aiken, Murphy - 1991
51 grammar and set-constraint-based program analysis by abstrac.. (context) - Cousot, Cousot - 1995
48 Points-to analysis by type inference of programs with struct.. - Steensgaard - 1996
47 Program specialization via program slicing - Reps, Turnidge - 1996
46 Akademiai Kiado (context) - Gecseg, Steinb - 1984
39 Set constraints and set-based analysis - Heintze, Ja - 1994
34 Projection merging: Reducing redundancies in inclusion const.. - Su, ahndrich et al. - 2000
34 Programming with invariants (context) - Paige - 1986
33 Dynamic programming via static incrementalization - Liu, Stoller - 1999
33 Real-time simulation of a set machine on a RAM - Paige
33 Static caching for incremental computation - Liu, Stoller et al. - 1998
29 Practical aspects of set based analysis - Heintze - 1992
24 the complexity analysis of static analyses - McAllester - 1999
18 erencing of computable expressions (context) - Paige, Koenig - 1982
15 Type analysis and data structure selection - Cai, Facon et al. - 1991
14 Eciency by incrementalization: An introduction (context) - Liu - 2000
14 Linear-time subtransitive control ow analysis (context) - Heintze, McAllester - 1997
13 Binding-time analysis for standard ML - Birkedal, Welinder - 1994
13 Binding-time analysis for Standard ML - Birkedal, Welinder - 1995
13 The Complexity of Simple Subtyping Systems - Rehof - 1998
13 Ecient type inference for higher-order binding-time analysis (context) - Henglein - 1991
12 Program derivation by xed point computation (context) - Cai, Paige - 1988
12 Eliminating dead code on recursive data - Liu, Stoller - 1999
10 Courant Institute of Mathematical Sciences (context) - Snyder, Programming et al. - 1990
9 Automatic computation of data set denitions (context) - Reynolds
6 Ecient analyses for realistic o -line partial evaluation (context) - Bondorf, rgensen - 1993
6 Optimization of very high level languages { I: Value transmi.. (context) - Schwartz - 1975
5 volume 6 of Computer Science and Articial Intelligence (context) - Paige, erentiation et al.
5 Separating binding times in language specications (context) - Mogensen - 1989
5 A Language Theoretic Approach to Algorithms (context) - Goyal - 2000
4 erences: An ecient new xpoint algorithm for distributive con.. (context) - Fecht, Seidl - 1998
3 Practice and Experience (context) - Dershowitz, Reingold et al. - 1990
1 An example program Program (context) - Yellin, dynamic et al. - 1993
http://www.cs.indiana.edu/scheme-repository/
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.sunysb.edu/~stoller): More
Efficient Detection of Global Properties in Distributed .. - Stoller, Unnikrishnan, .. (2000) (Correct)
Leader Election in Asynchronous Distributed Systems - Stoller (2000) (Correct)
A Bound on Attacks on Authentication Protocols - Stoller (2000) (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