Results 1  10
of
430
Extending NonTermination Proof Techniques to Asynchronously Communicating Concurrent Programs
"... Currently, no approaches are known that allow for nontermination proofs of concurrent programs which account for asynchronous communication via FIFO message queues. Those programs may be written in highlevel languages such as Java or Promela. We present a first approach to prove nontermination for ..."
Abstract
 Add to MetaCart
Currently, no approaches are known that allow for nontermination proofs of concurrent programs which account for asynchronous communication via FIFO message queues. Those programs may be written in highlevel languages such as Java or Promela. We present a first approach to prove nontermination
Proving nontermination
 In POPL
, 2008
"... The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of verification tools. While this is wellunderstood in safety verification, the current focus of liveness verification has ..."
Abstract

Cited by 46 (7 self)
 Add to MetaCart
has been almost exclusively on the search for termination proofs. A counterexample to termination is an infinite program execution. In this paper, we propose a method to search for such counterexamples. The search proceeds in two phases. We first dynamically enumerate lassoshaped candidate paths
Nontermination inference of logic programs
 ACM Transactions on Programming Languages and
"... We present a static analysis technique for nontermination inference of logic programs. Our framework relies on an extension of the subsumption test, where some specific argument positions can be instantiated while others are generalized. We give syntactic criteria to statically identify such argume ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
such argument positions from the text of a program. Atomic left looping queries are generated bottomup from selected subsets of the binary unfoldings of the program of interest. We propose a set of correct algorithms for automating the approach. Then, nontermination inference is tailored to attempt proofs
An Integrated Logic for Termination and NonTermination Reasoning
"... Abstract. We propose a logical framework for specifying and proving assertions about program termination and nontermination. Although program termination has been well studied, it is usually added as an external component to a specification logic. Here we propose to integrate termination requiremen ..."
Abstract
 Add to MetaCart
Abstract. We propose a logical framework for specifying and proving assertions about program termination and nontermination. Although program termination has been well studied, it is usually added as an external component to a specification logic. Here we propose to integrate termination
Experiments with NonTermination Analysis for Java Bytecode
"... Nontermination analysis proves that programs, or parts of a program, do not terminate. This is important since nontermination is often an unexpected behaviour of computer programs and exposes a bug in their code. While research has found ways of proving nontermination of logic programs and of ter ..."
Abstract
 Add to MetaCart
Nontermination analysis proves that programs, or parts of a program, do not terminate. This is important since nontermination is often an unexpected behaviour of computer programs and exposes a bug in their code. While research has found ways of proving nontermination of logic programs
Structural Simulation Proofs based on ASMs even for NonTerminating Programs
"... Abstract When transforming programs, one often has the requirement to preserve their semantics, as e.g. in compilers. To guarantee that such a requirement is fulfilled, formal proofs are necessary. Therefore, we want to do a simulation proof by showing that the state transitions which appear wh ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. But for nonterminating programs it is not appropriate. In this paper, we show that a coinductive proof technique is necessary in principle and that the problem of simulation proofs for nonterminating programs can be solved easily using coinduction. 1 Problems with Simulation Proofs In this section, we
Proving Nontermination Using MaxSMT
"... Abstract. We show how MaxSMTbased invariant generation can be exploited for proving nontermination of programs. The construction of the proof of nontermination is guided by the generation of quasiinvariants – properties such that if they hold at a location during execution once, then they will c ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract. We show how MaxSMTbased invariant generation can be exploited for proving nontermination of programs. The construction of the proof of nontermination is guided by the generation of quasiinvariants – properties such that if they hold at a location during execution once
Semantics Of NonTerminating Systems Through Term Rewriting
, 1995
"... This thesis is primarily concerned with the algebraic semantics of nonterminating term rewriting systems. The usual semantics for rewrite system is based in interpreting rewrite rules as equations and rewriting as a particular case of equational reasoning. The termination of a rewrite system ensure ..."
Abstract
 Add to MetaCart
This thesis is primarily concerned with the algebraic semantics of nonterminating term rewriting systems. The usual semantics for rewrite system is based in interpreting rewrite rules as equations and rewriting as a particular case of equational reasoning. The termination of a rewrite system
NonTermination Inference and Optimal Termination Conditions of Logic Program
"... First, we present an approach to nontermination inference of logic programs. Our framework relies on an extension of the Lifting Lemma, where some specic argument positions can be instantiated while others are generalized. Atomic left looping queries are then generated bottomup from selected subse ..."
Abstract
 Add to MetaCart
subsets of the binary unfoldings of the program of interest. Then nontermination inference is tailored to attempt proofs of optimality of left termination conditions computed by a termination inference tool. For each class of atomic queries not covered by a termination condition, the aim is to ensure
Reasoning about realtime repetitions: Terminating and nonterminating
 Science of Computer Programming, 43(2–3):161–192, May/June
, 2002
"... It is common for a realtime system to contain a nonterminating process monitoring an input and controlling an output. Hence a realtime program development method needs to support nonterminating repetitions. In this paper we develop a general proof rule for reasoning about possibly nonterminating r ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
It is common for a realtime system to contain a nonterminating process monitoring an input and controlling an output. Hence a realtime program development method needs to support nonterminating repetitions. In this paper we develop a general proof rule for reasoning about possibly nonterminating
Results 1  10
of
430