AbstractThe computations evoked by starting a program can differ with respect to termination and—in case of termination—final state. This paper contains two examples, together with formal proofs, of programs with different classes of possible computations for different initial states
When disproving termination using known techniques (e.g. recurrence sets), abstractions that overapp...
In expounding the notions of pre- and postconditions, of termination and nontermination, of correctn...
One way to develop more robust software is to use formal program verification. Formal program verifi...
The computations evoked by starting a program can differ with respect to termination and—in case of ...
The search for reliable and scalable automated methods for finding counterexamples to termination or...
We present a constraint-based method for proving conditional termination of integer programs. Buildi...
AbstractWe survey termination analysis techniques for Logic Programs. We give an extensive introduct...
International audienceWe address the problem of conditional termination, which is that of defining t...
Abstract. We study the proof of a recent and relevant result about termination of programs, the Term...
The termination assertion p〈S〉 q means that whenever the formula p is true, there is an execution of...
AbstractWe show that termination is a first-order notion if approached via Nonstandard Logics of Pro...
Termination is well-known to be one of the most intriguing aspects of program verification. Since lo...
The problem of determining whether or not any program terminates was shown to be undecidable by Turi...
After Turing proved the halting problem undecidable in 1936, many considered the dream of automatic ...
If there truly is a proof that shows that no universal halt decider exists on the basis that certain...
When disproving termination using known techniques (e.g. recurrence sets), abstractions that overapp...
In expounding the notions of pre- and postconditions, of termination and nontermination, of correctn...
One way to develop more robust software is to use formal program verification. Formal program verifi...
The computations evoked by starting a program can differ with respect to termination and—in case of ...
The search for reliable and scalable automated methods for finding counterexamples to termination or...
We present a constraint-based method for proving conditional termination of integer programs. Buildi...
AbstractWe survey termination analysis techniques for Logic Programs. We give an extensive introduct...
International audienceWe address the problem of conditional termination, which is that of defining t...
Abstract. We study the proof of a recent and relevant result about termination of programs, the Term...
The termination assertion p〈S〉 q means that whenever the formula p is true, there is an execution of...
AbstractWe show that termination is a first-order notion if approached via Nonstandard Logics of Pro...
Termination is well-known to be one of the most intriguing aspects of program verification. Since lo...
The problem of determining whether or not any program terminates was shown to be undecidable by Turi...
After Turing proved the halting problem undecidable in 1936, many considered the dream of automatic ...
If there truly is a proof that shows that no universal halt decider exists on the basis that certain...
When disproving termination using known techniques (e.g. recurrence sets), abstractions that overapp...
In expounding the notions of pre- and postconditions, of termination and nontermination, of correctn...
One way to develop more robust software is to use formal program verification. Formal program verifi...
DOI
Add to ORKG