International audienceWe consider the termination/non-termination property of a class of loops. Such loops are commonly used abstractions of real program pieces. Second-order logic is a convenient language to express non-termination. Of course, such property is generally undecidable. However, by restricting the language to known decidable cases, we exhibit new classes of loops, the non-termination of which is decidable. We present a bunch of examples
Non-termination analysis proves that programs, or parts of a program, do notterminate. This is impor...
One of the main advantages of logic programs is that it allows to write declarative programs that ve...
Termination and non-termination are a pair of fundamental program properties. Arguably, the majority...
One of the main advantages of logic programs is that it allows to write declarative programs that ve...
International audienceThis paper addresses the problem of conditional termination, which is that of ...
Can the semantics of a program be represented as a single formula? We show that one formula is insuf...
Proving program termination is typically done by finding a well-founded ranking function for the pro...
Abstract. This paper addresses the problem of conditional termination, which is that of defining the...
Termination is well-known to be one of the most intriguing aspects of program verification. Since lo...
While termination checking tailored to real-world library code or frameworks has received ever-incre...
The search for reliable and scalable automated methods for finding counterexamples to termination or...
Abstract. Proving program termination is typically done by finding a well-founded ranking function f...
While termination checking tailored to real-world library code or frameworks has received ever-incre...
AbstractWe survey termination analysis techniques for Logic Programs. We give an extensive introduct...
AbstractNon-termination analysis proves that programs, or parts of a program, do not terminate. This...
Non-termination analysis proves that programs, or parts of a program, do notterminate. This is impor...
One of the main advantages of logic programs is that it allows to write declarative programs that ve...
Termination and non-termination are a pair of fundamental program properties. Arguably, the majority...
One of the main advantages of logic programs is that it allows to write declarative programs that ve...
International audienceThis paper addresses the problem of conditional termination, which is that of ...
Can the semantics of a program be represented as a single formula? We show that one formula is insuf...
Proving program termination is typically done by finding a well-founded ranking function for the pro...
Abstract. This paper addresses the problem of conditional termination, which is that of defining the...
Termination is well-known to be one of the most intriguing aspects of program verification. Since lo...
While termination checking tailored to real-world library code or frameworks has received ever-incre...
The search for reliable and scalable automated methods for finding counterexamples to termination or...
Abstract. Proving program termination is typically done by finding a well-founded ranking function f...
While termination checking tailored to real-world library code or frameworks has received ever-incre...
AbstractWe survey termination analysis techniques for Logic Programs. We give an extensive introduct...
AbstractNon-termination analysis proves that programs, or parts of a program, do not terminate. This...
Non-termination analysis proves that programs, or parts of a program, do notterminate. This is impor...
One of the main advantages of logic programs is that it allows to write declarative programs that ve...
Termination and non-termination are a pair of fundamental program properties. Arguably, the majority...
DOI
Add to ORKG