(Enter summary)
Abstract: This paper shows how logic programs can be used to implement the transition
functions of denotational abstract interpretation. The logic variables express regularity in the
abstract behaviour of commands. The technique has been applied to sign, class and escape
analysis for object-oriented programs. We show that the time and space costs using logic
programs for these analyses are smaller than those using a ground relational representation. (Update)
Context of citations to this paper: More
...semantics [16] for a simpli cation of the Java bytecode. The domains use the compact representation of the abstract denotations described in [10]. This paper shows how a logic program can provide a compact representation of the abstract denotations used in denotational abstract...
Cited by: More
Modular Class Analysis with DATALOG - Besson, Jensen, Spoto (2003)
(Correct)
Logic Programs as Compact Denotations - Hill, Spoto (2003)
(Correct)
Escape Analysis: Final Report for EPSRC grant GR/R53401 - Hill (2002)
(Correct)
Active bibliography (related documents): More All
0.5: A Refinement of the Escape Property - Hill, Spoto (2002)
(Correct)
0.5: Collecting Potential Optimisations - Mazur, Janssens, Vanhoof
(Correct)
0.3: Pos(T): Analyzing Dependencies in Typed Logic Programs - Bruynooghe, Vanhoof, Codish (2001)
(Correct)
Similar documents based on text: More All
0.7: Focused Static Analyses for the Java Bytecode - Fausto Spoto Dipartimento
(Correct)
0.5: Information Flow Analysis for Java Bytecode - Genaim, Spoto
(Correct)
0.4: Analysis of Downward Closed Properties of Logic Programs - Hill, Spoto (2000)
(Correct)
Related documents from co-citation: More All
2: Fast static analysis of C++ virtual function calls (context) - Bacon, Sweeney - 1996
2: ective analysis of statically-typed objectoriented programs (context) - Diwan, Eliot et al. - 1996
2: Class Analysis of Object-Oriented Programs through Abstract Interpretation
- Jensen, Spoto - 2001
BibTeX entry: (Update)
P. M. Hill and F. Spoto. Logic Programs as Compact Denotations. Accepted for the Fifth International Symposium on Practical Aspects of Declarative Languages, PADL '03, New Orleans, 13-14 Jan 2003. http://citeseer.ist.psu.edu/hill03logic.html More
@misc{ hill03logic,
author = "P. Hill and F. Spoto",
title = "Logic Programs as Compact Denotations",
text = "P. M. Hill and F. Spoto. Logic Programs as Compact Denotations. Accepted
for the Fifth International Symposium on Practical Aspects of Declarative
Languages, PADL '03, New Orleans, 13-14 Jan 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/hill03logic.html" }
Citations (may not include all citations):
1726
Graph-Based Algorithms for Boolean Function Manipulation
- Bryant - 1986
815
Abstract Interpretation: A Unified Lattice Model for Static .. (context) - Cousot, Cousot - 1977
809
A Theory of Type Polymorphism in Programming (context) - Milner - 1978
160
The Principal Type-Scheme of an Object in Combinatory Logic (context) - Hindley - 1969
151
Object-Oriented Type Inference
- Palsberg, Schwartzbach - 1991
71
Fast Static Analysis of C++ Virtual Function Calls (context) - Bacon, Sweeney - 1996
67
Escape Analysis for Object Oriented Languages (context) - Blanchet - 1999
52
Global Flow Analysis as a Practical Compilation Tool
- Hermenegildo, Warren et al. - 1992
36
Deriving Polymorphic Type Dependencies for Logic Programs Us..
- Codish, Demoen - 1994
32
ective Analysis of Statically Typed Object-Oriented Programs (context) - Diwan, Moss et al. - 1996
17
Practical Model-Based Static Analysis for Definite Logic Pro..
- Gallagher, Boulanger et al. - 1995
12
Principles Techniques and Tools (context) - Aho, Sethi et al. - 1986
10
Watchpoint Semantics: A Tool for Compositional and Focussed ..
- Spoto - 2001
8
Bounded Fixed Point Iteration (context) - Nielson, Nielson - 1992
6
Class Analysis of Object-Oriented Programs through Abstract ..
- Jensen, Spoto - 2001
4
An Experiment in Domain Refinement: Type Domains and Type Re..
- Levi, Spoto - 1998
4
A Foundation of Escape Analysis
- Hill, Spoto - 2002
3
Logic Programs as Compact Denotations
- Hill, Spoto - 2003
2
A New Class of Function for Abstract Interpretation (context) - Koller, Mohnen - 1999
2
Implementing Groundness Analysis with Definite Boolean Funct..
- Howe, King - 2000
www.sci.univr.it/#spoto/loop/
www.itu.dk/research/buddy/
Documents on the same site (http://profs.sci.univr.it/~spoto/papers.html): More
A Foundation of Escape Analysis - Hill, Spoto (2002)
(Correct)
Static Analysis for JML's assignable Clauses - Spoto, Poll (2003)
(Correct)
A Foundation of Escape Analysis - Hill, Spoto (2002)
(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