Analyzing logic programs with dynamic scheduling

Authors:
Kim Marriott;María José García de la Banda;Manuel Hermenegildo
Affiliations:
Dept. of Computer Science, Monash University, Clayton Vic 3168, Australia;Facultad de Informática - UPM, 28660-Boadilla del Monte, Madrid, Spain;Facultad de Informática - UPM, 28660-Boadilla del Monte, Madrid, Spain
Venue:
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Year:
1994

Citing 20
Cited 17

Negation and control in Prolog

Negation and control in Prolog
Constraint logic programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Static inference of modes and data dependencies in logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Functional computations in logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Global compilation of prolog

Journal of Logic Programming
Moded type systems for logic programming

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
LIPS on MIPS: results from Prolog compiler for a RISC

Logic programming
The DCG, UDG, and MEL methods for automatic compile-time parallelization of logic programs for independent and-parallelism

Logic programming
Prolog and its performance: exploiting independent and-parallelism

Logic programming
Abstract interpretation for concurrent logic languages

Proceedings of the 1990 North American conference on Logic programming
The benefits of global dataflow analysis for an optimizing Prolog compiler

Proceedings of the 1990 North American conference on Logic programming
A characterization of non-floundering logic programs

Proceedings of the 1990 North American conference on Logic programming
Abstract interpretation and application to logic programs

Journal of Logic Programming
Compile-time derivation of variable dependency using abstract interpretation

Journal of Logic Programming
Global flow analysis as a practical compilation tool

Journal of Logic Programming
Analysis of nonlinear constraints in CLP( R )

ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Denotational abstract interpretation of logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Data flow analysis of applicative programs using minimal function graphs

POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
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
Efficient Analysis of Concurrent Constraint Logic Programs

ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming

Global analysis of constraint logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Strategic directions in constraint programming

ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Some challenges for constraint programming

ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
A transformation system for CLP with dynamic scheduling and CCP

PEPM '97 Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Proving concurrent constraint programs correct

ACM Transactions on Programming Languages and Systems (TOPLAS)
Effectivness of abstract interpretation in automatic parallelization: a case study in logic programming

ACM Transactions on Programming Languages and Systems (TOPLAS)
Constraint Programming: Strategic Directions

Constraints
Some Challenges for Constraint Programming

Constraints
Efficient Negation Using Abstract Interpretation

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Reexecution-Based Analysis of Logic Programs with Delay Declarations

PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Analysis of Logic Programs with Delay

LOPSTR '97 Proceedings of the 7th International Workshop on Logic Programming Synthesis and Transformation
Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)

Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
Inferring non-suspension conditions for logic programs with dynamic scheduling

ACM Transactions on Computational Logic (TOCL)
Program development using abstract interpretation (and the ciao system preprocessor)

SAS'03 Proceedings of the 10th international conference on Static analysis
Goal-independent suspension analysis for logic programs with dynamic scheduling

ESOP'03 Proceedings of the 12th European conference on Programming
A syntactic approach to combining functional notation, lazy evaluation, and higher-order in LP systems

FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
Declarative diagnosis of floundering in prolog

ACSC '12 Proceedings of the Thirty-fifth Australasian Computer Science Conference - Volume 122

Quantified Score

Hi-index	0.01

Visualization

Abstract

Traditional logic programming languages, such as Prolog, use a fixed left-to-right atom scheduling rule. Recent logic programming languages, however, usually provide more flexible scheduling in which computation generally proceed left-to-right but in which some calls are dynamically “delayed” until their arguments are sufficiently instantiated to allow the call to run efficiently. Such dynamic scheduling has a significant cost. We give a framework for the global analysis of logic programming languages with dynamic scheduling and show that program analysis based on this framework supports optimizations which remove much of the overhead of dynamic scheduling.