Logic programs as compact denotations

Authors:
Patricia M. Hill;Fausto Spoto
Affiliations:
School of Computing, University of Leeds, LS2 9JT Leeds, UK;Dipartimento di Informatica, Universití di Verona, Strada Le Grazie, 15, Ca' Vignal, 37134 Verona, Italy
Venue:
Computer Languages, Systems and Structures
Year:
2003

Citing 16
Cited 1

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Object-oriented type inference

OOPSLA '91 Conference proceedings on Object-oriented programming systems, languages, and applications
Bounded fixed point iteration

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Global flow analysis as a practical compilation tool

Journal of Logic Programming
Simple and effective analysis of statically-typed object-oriented programs

Proceedings of the 11th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Fast static analysis of C++ virtual function calls

Proceedings of the 11th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Escape analysis for object-oriented languages: application to Java

Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Implementing Groundness Analysis with Definite Boolean Functions

ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Logic Programs as Compact Denotations

PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
Set Constraints and Set-Based Analysis

PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
A Foundation of Escape Analysis

AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
An Experiment in Domain Refinement: Type Domains and Type Representations for Logic Programs

PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
Class Analysis of Object-Oriented Programs through Abstract Interpretation

FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
A New Class of Functions for Abstract Interpretation

SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Watchpoint Semantics: A Tool for Compositional and Focussed Static Analyses

SAS '01 Proceedings of the 8th International Symposium on Static Analysis

Deriving escape analysis by abstract interpretation

Higher-Order and Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

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. Moreover, we show that, in the case of sign analysis, our technique requires less memory and has an efficiency comparable to that of an implementation based on binary decision diagrams.