Goal-independent suspension analysis for logic programs with dynamic scheduling

Authors:
Samir Genaim;Andy King
Affiliations:
Universita' degli Studi di Verona, Verona, Italy and Ben-Gurion University of the Negev, Beer-Sheva, Israel and University of Kent, Canterbury, UK;Ben-Gurion University of the Negev, Beer-Sheva, Israel and University of Kent, Canterbury, UK
Venue:
ESOP'03 Proceedings of the 12th European conference on Programming
Year:
2003

Citing 11
Cited 3

Unification revisited

Foundations of deductive databases and logic programming
Recursive query processing: the power of logic

Theoretical Computer Science
On derived dependencies and connected databases

Journal of Logic Programming
Abstract interpretation for concurrent logic languages

Proceedings of the 1990 North American conference on Logic programming
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
A logical model for relational abstract domains

ACM Transactions on Programming Languages and Systems (TOPLAS)
Two classes of Boolean functions for dependency analysis

Science of Computer Programming
Algorithm = logic + control

Communications of the ACM
Foundations of Logic Programming

Foundations of Logic Programming
A backward analysis for constraint logic programs

Theory and Practice of Logic Programming

Inferring non-suspension conditions for logic programs with dynamic scheduling

ACM Transactions on Computational Logic (TOCL)
Detecting determinacy in prolog programs

ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Closure operators for ROBDDs

VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation

Quantified Score

Hi-index	0.01

Visualization

Abstract

A goal-independent suspension analysis is presented that infers a class of goals for which a logic program with delays can be executed without suspension. The crucial point is that the analysis does not verify that an (abstract) goal does not lead to suspension but rather it infers (abstract) goals which do not lead to suspension.