This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
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...
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...
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...
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 ...
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...