Analysis of Logic Programs with Delay

Authors:
Andrew Heaton;Patricia M. Hill;Andy King
Affiliations:
-;-;-
Venue:
LOPSTR '97 Proceedings of the 7th International Workshop on Logic Programming Synthesis and Transformation
Year:
1997

Citing 9
Cited 0

Global flow analysis as a practical compilation tool

Journal of Logic Programming
QD-Janus: a sequential implementation of Janus in Prolog

Software—Practice & Experience
Precise and efficient groundness analysis for logic programs

ACM Letters on Programming Languages and Systems (LOPLAS)
Suspension analyses for concurrent logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Analyzing logic programs with dynamic scheduling

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Fast and precise regular approximations of logic programs

Proceedings of the eleventh international conference on Logic programming
Detection and optimization of suspension-free logic programs

ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Abstracting Synchronization in Concurrent Constraint Programming

PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
Practical Model-Based Static Analysis for Definite Logic Programs

Practical Model-Based Static Analysis for Definite Logic Programs

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper focuses on practical analyses for logic programs with delay. The method described is for downward-closed program properties and, in particular, groundness. A program transformation is defined which eliminates the delay statements but still enables an accurate approximation of the behaviour of delayed goals to be traced by the analyser. An implementation has been built which shows that the analysis can be both accurate and Efficient.