Lower-bound time-complexity analysis of logic programs

Parallel execution of prolog programs: a survey

ACM Transactions on Programming Languages and Systems (TOPLAS)

Calculating Sized Types

Higher-Order and Symbolic Computation

Deriving Pre-conditions for Array Bound Check Elimination

PADO '01 Proceedings of the Second Symposium on Programs as Data Objects

Combining Norms to Prove Termination

VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation

Reuse of Results in Termination Analysis of Typed Logic Programs

SAS '02 Proceedings of the 9th International Symposium on Static Analysis

PAN: a portable, parallel prolog: Its design, realisation and performance

New Generation Computing

Computing convex hulls with a linear solver

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)

Elimination of Local Variables from Definite Logic Programs

Electronic Notes in Theoretical Computer Science (ENTCS)

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