1461 search results - page 44 / 293 » Analysis of Constraint Logic Programs |
LOPSTR
2007
Springer
15 years 3 months ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
SAS
2001
Springer
15 years 2 months ago
2001
Springer
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...
BIRTHDAY
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. In this work we introduce counterexample guided path reduction based on interval constraint solving for static program analysis. The aim of this technique is to reduce th...
RTA
2010
Springer
15 years 1 months ago
2010
Springer
The K framework, based on rewriting logic semantics, provides a powerful logic for deļ¬ning the semantics of programming languages. While most work in this area has focused on deļ...
71
Voted
LPAR
2001
Springer
15 years 2 months 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...