Sciweavers

PEPM
1995
ACM
13 years 10 months ago
Shape Analysis as a Generalized Path Problem
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...
Thomas W. Reps
PEPM
1995
ACM
13 years 10 months ago
The Essence of LR Parsing
Partial evaluation can turn a general parser into a parser generator. The generated parsers surpass those produced by traditional parser generators in speed and compactness. We us...
Michael Sperber, Peter Thiemann
PEPM
1995
ACM
13 years 10 months ago
Effect Systems with Subtyping
Yan Mei Tang, Pierre Jouvelot
PEPM
1995
ACM
13 years 10 months ago
Caching Intermediate Results for Program Improvement
A systematic approach is given for symbolically caching intermediate results useful for deriving incremental programs from non-incremental programs. Our method can be applied stra...
Yanhong A. Liu, Tim Teitelbaum
PEPM
1995
ACM
13 years 10 months ago
Abstract Interpretation and Low-Level Code Optimization
Interpretation and Low-Level Code Optimization Saumya Debray Department of Computer Science University of Arizona Tucson, AZ 85715 Abstract interpretation is widely accepted as a ...
Saumya K. Debray
PEPM
1995
ACM
13 years 10 months ago
Semantic Foundations of Binding Time Analysis for Imperative Programs
Manuvir Das, Thomas W. Reps, Pascal Van Hentenryck
PEPM
1995
ACM
13 years 10 months ago
Towards Creating Specialised Integrity Checks through Partial Evaluation of Meta-Interpreters
In [23] we presented a partial evaluation scheme for a “real life” subset of Prolog, containing first-order built-in’s, simple side-effects and the operational predicate i...
Michael Leuschel, Danny De Schreye