1911 search results - page 26 / 383 » Program analysis for code duplication in logic programs |
LPAR
2001
Springer
14 years 27 days ago
2001
Springer
This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalizes traditional termination analysis where an analyzer tries to veri...
ERSHOV
2001
Springer
14 years 28 days ago
2001
Springer
A general semantics-based framework for the analysis of logic programs with delay declarations is presented. The framework incorporates well known refinement techniques based on r...
CADE
2001
Springer
14 years 8 months ago
2001
Springer
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...
EUROPAR
2000
Springer
14 years 1 days ago
2000
Springer
One of the advantages of logic programming is the fact that it offers many sources of implicit parallelism, such as and-parallelism and or-parallelism. Arguably, or-parallel system...
ICLP
1997
Springer
14 years 18 days ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...