Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Foundations of deductive databases and logic programming
The family of concurrent logic programming languages
ACM Computing Surveys (CSUR)
Moded type systems for logic programming
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The languages FCP(:) and FCP(:,?)
New Generation Computing - Selected papers on parallel logic programming from the International Conference on Fifth Generation Computer Systems, 1988
Termination proofs for logic programs
Termination proofs for logic programs
Proving termination of logic programs by exploiting term properties
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Advances in distributed computing (ADC) and colloquium on combining paradigms for software development (CCPSD): Vol. 2
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
Analysis of constraint logic programs
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
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
Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation
PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
On the complexity of dataflow analysis of 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
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Making abstract interpretations complete
Journal of the ACM (JACM)
Transformations of CCP programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Constraint Programming: Strategic Directions
Constraints
Analysis of Logic Programs with Delay
LOPSTR '97 Proceedings of the 7th International Workshop on Logic Programming Synthesis and Transformation
Inferring non-suspension conditions for logic programs with dynamic scheduling
ACM Transactions on Computational Logic (TOCL)
Modular class analysis with DATALOG
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
| Hi-index | 0.00 |
Concurrent logic languages specify reactive systems which consist of collections of communicating processes. The presence of unintended suspended computations is a common programming error which is difficult to detect using standard debugging and testing techniques. We develop a number of analyses, based on abstract interpretation, which succeed if a program is definitely suspension free. If an analysis fails, the program may, or may not, be suspension free. Examples demonstrate that the analyses are practically useful. They are conceptually simple and easy to justify because they are based directly on the transition system semantics of concurrent logic programs. A naive analysis must consider all scheduling policies. However, it is proven that for our analyses it suffices to consider only one scheduling policy, allowing for efficient implementation.