Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
The semantic foundations of concurrent constraint programming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Determinacy analysis for full Prolog
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Extracting determinacy in logic programs
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Cardinality analysis of Prolog
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
New Generation Computing - Special issue on the workshop on parallel logic programming
A Framework for Analysis of Typed Logic Programs
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
A Semantics-Based Determinacy Analysis for Prolog with Cut
Proceedings of the Second International Andrei Ershov Memorial Conference on Perspectives of System Informatics
SAS '96 Proceedings of the Third International Symposium on Static Analysis
Offline specialisation in Prolog using a hand-written compiler generator
Theory and Practice of Logic Programming
Sequence-based abstract interpretation of Prolog
Theory and Practice of Logic Programming
A backward analysis for constraint logic programs
Theory and Practice of Logic Programming
Termination analysis of logic programs through combination of type-based norms
ACM Transactions on Programming Languages and Systems (TOPLAS)
Goal-independent suspension analysis for logic programs with dynamic scheduling
ESOP'03 Proceedings of the 12th European conference on Programming
Determinacy inference for logic programs
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Determinacy analysis for logic programs using mode and type information
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs
Proceedings of the 14th symposium on Principles and practice of declarative programming
| Hi-index | 0.00 |
In program development it is useful to know that a call to a Prolog program will not inadvertently leave a choice-point on the stack. Determinacy inference has been proposed for solving this problem yet the analysis was found to be wanting in that it could not infer determinacy conditions for programs that contained cuts or applied certain tests to select a clause. This paper shows how to remedy these serious deficiencies. It also addresses the problem of identifying those predicates which can be rewritten in a more deterministic fashion. To this end, a radically new form of determinacy inference is introduced, which is founded on ideas in ccp, that is capable of reasoning about the way bindings imposed by a rightmost goal can make a leftmost goal deterministic.