Determinacy Analysis for Logic Programs Using Mode and Type Information

We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (which implies that at most one of their clauses will succeed) even if they are not deterministic (because they call other predicates that can produce more than one solution). Applications of such determinacy information include detecting programming errors, performing certain high-level program transformations for improving search efficiency, optimizing low level code generation and parallel execution, and estimating tighter upper bounds on the computational costs of goals and data sizes, which can be used for program debugging, resource consumption and granularity control, etc. We have implemented the analysis and integrated it in the CiaoPP system, which also infers automatically the mode and type information that our analysis takes as input. Experiments performed on this implementation show that the analys...

• Type: Conference
• Year: 2004
• Where: LOPSTR
• Authors: Pedro López-García, Francisco Bueno, Manuel V. Hermenegildo
• Keywords: LOPSTR 2004, Low Level Code, Mutually Exclusive, Tighter Upper Bounds