The 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
One way to develop more robust software is to use formal program verification. Formal program verifi...
Abstract. This paper addresses the problem of conditional termination, which is that of defining the...
While termination checking tailored to real-world library code or frameworks has received ever-incre...
The computations evoked by starting a program can differ with respect to termination and—in case of ...
AbstractThe computations evoked by starting a program can differ with respect to termination and—in ...
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...
Termination is well-known to be one of the most intriguing aspects of program verification. Since lo...
In this paper we focus on the relationship between a number of specification models. The models are ...
The problem of determining whether or not any program terminates was shown to be undecidable by Turi...
International audienceThis paper addresses the problem of conditional termination, which is that of ...
We present a constraint-based method for proving conditional termination of integer programs. Buildi...
AbstractIn this note we show that probabilistic termination of concurrent programs is in many cases ...
AbstractWe show that termination is a first-order notion if approached via Nonstandard Logics of Pro...
Abstract. We present a novel technique for proving program termination which introduces a new dimens...
One way to develop more robust software is to use formal program verification. Formal program verifi...
Abstract. This paper addresses the problem of conditional termination, which is that of defining the...
While termination checking tailored to real-world library code or frameworks has received ever-incre...
The computations evoked by starting a program can differ with respect to termination and—in case of ...
AbstractThe computations evoked by starting a program can differ with respect to termination and—in ...
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...
Termination is well-known to be one of the most intriguing aspects of program verification. Since lo...
In this paper we focus on the relationship between a number of specification models. The models are ...
The problem of determining whether or not any program terminates was shown to be undecidable by Turi...
International audienceThis paper addresses the problem of conditional termination, which is that of ...
We present a constraint-based method for proving conditional termination of integer programs. Buildi...
AbstractIn this note we show that probabilistic termination of concurrent programs is in many cases ...
AbstractWe show that termination is a first-order notion if approached via Nonstandard Logics of Pro...
Abstract. We present a novel technique for proving program termination which introduces a new dimens...
One way to develop more robust software is to use formal program verification. Formal program verifi...
Abstract. This paper addresses the problem of conditional termination, which is that of defining the...
While termination checking tailored to real-world library code or frameworks has received ever-incre...
DOI
Add to ORKG