For term rewrite systems (TRSs), a huge number of automated termination analysis tech-niques have been developed during the last decades, and by automated transformations of Prolog programs to TRSs, these techniques can also be used to prove termination of Prolog programs. Very recently, techniques for automated termination analysis of TRSs have been adapted to prove asymptotic upper bounds for the runtime complexity of TRSs automatically. In this paper, we present an automated transformation from Prolog pro-grams to TRSs such that the runtime of the resulting TRS is an asymptotic upper bound for the runtime of the original Prolog program (where the runtime of a Prolog program is measured by the number of unification attempts). Thus, techni...
We present a new method to infer upper bounds on the innermost runtime complexity of term rewrite sy...
Derivational complexity of term rewriting considers the length of the longest rewrite sequence for a...
We present the first approach to deduce lower bounds for innermost runtime complexity of term rewrit...
The most fundamental decision problem in computer science is the halting problem, i.e., given a desc...
The paper presents an analyzer for verifying the correctness of a Prolog program relative to a speci...
AbstractTime and space complexity of Prolog programs is investigated in simplest Prolog subclasses: ...
We present the first approach to deduce lower bounds for innermost runtime complexity of term rewrit...
Although Prolog is (still) the most widely used logic language, it suffers from a number of drawback...
There are two kinds of approaches for termination analysis of logic programs: transformational and...
AbstractAlthough Prolog is (still) the most widely used logic language, it suffers from a number of ...
There are two kinds of approaches for termination analysis of logic programs: transformational and...
In this system description, we present the tool AProVE for automatic termination and complexity proo...
A methodology for proving the termination of well-moded logic programs is developed by reducing the ...
This dissertation describes research toward automatic complexity analysis of logic programs and its ...
AbstractA methodology for proving the termination of well-moded logic programs is developed by reduc...
We present a new method to infer upper bounds on the innermost runtime complexity of term rewrite sy...
Derivational complexity of term rewriting considers the length of the longest rewrite sequence for a...
We present the first approach to deduce lower bounds for innermost runtime complexity of term rewrit...
The most fundamental decision problem in computer science is the halting problem, i.e., given a desc...
The paper presents an analyzer for verifying the correctness of a Prolog program relative to a speci...
AbstractTime and space complexity of Prolog programs is investigated in simplest Prolog subclasses: ...
We present the first approach to deduce lower bounds for innermost runtime complexity of term rewrit...
Although Prolog is (still) the most widely used logic language, it suffers from a number of drawback...
There are two kinds of approaches for termination analysis of logic programs: transformational and...
AbstractAlthough Prolog is (still) the most widely used logic language, it suffers from a number of ...
There are two kinds of approaches for termination analysis of logic programs: transformational and...
In this system description, we present the tool AProVE for automatic termination and complexity proo...
A methodology for proving the termination of well-moded logic programs is developed by reducing the ...
This dissertation describes research toward automatic complexity analysis of logic programs and its ...
AbstractA methodology for proving the termination of well-moded logic programs is developed by reduc...
We present a new method to infer upper bounds on the innermost runtime complexity of term rewrite sy...
Derivational complexity of term rewriting considers the length of the longest rewrite sequence for a...
We present the first approach to deduce lower bounds for innermost runtime complexity of term rewrit...