Efficient dataflow analysis of logic programs

Authors:
S. K. Debray
Affiliations:
Department of Computer Science, The University of Arizona, Tucson, AZ
Venue:
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Year:
1988

Citing 7
Cited 5

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
OLD resolution with tabulation

Proceedings on Third international conference on logic programming
Detection and optimization of functional computations in Prolog

Proceedings on Third international conference on logic programming
Compile-time garbage collection or How to transform programs in an assignment-free language into code with assignments

The IFIP TC2/WG 2.1 Working Conference on Program specification and transformation
Improving the execution speed of compiled prolog with modes, clause selection, and determinism

II and Colloquium on Functional and Logic Programming and Specifications (CFLP) on TAPSOFT '87: Advanced Seminar on Foundations of Innovative Software Development
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
A precise inter-procedural data flow algorithm

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Compiling dataflow analysis of logic programs

PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
A general framework for semantics-based bottom-up abstract interpretation of logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Verification of proofs for the B formal development process

ACM SIGPLAN Notices
Denotational abstract interpretation of logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Machine Independent AND and OR Parallel Execution of Logic Programs: Part II-Compiled Execution

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate a framework for efficient flow analyses of logic programs. A major problem in this context is that unification can give rise to aliasing and dependencies between variables whose effects are difficult to predict, and which make sound flow analysis algorithms computationally expensive. We give a simple characterization of the class of flow analysis problems for which aliasing effects can be ignored without loss of soundness, and describe an efficient analysis procedure for this class of problems. The utility of our approach is illustrated by discussing its application to several analysis and optimization problems for logic programs. Our results are useful in the design of efficient flow analysis systems for logic programming languages.