We describe a new method, called cyclic abduction, for automatically inferring the inductive definitions of termination preconditions for programs written in a simple imperative language. That is, given a program, our method returns the definition of an inductively defined predicate in separation logic under which the program is guaranteed to terminate. Cyclic abduction essentially works by searching for a cyclic proof of termination of the program, abducing definitional clauses of the precondition as necessary in order to symbolically execute program instructions. The formation of cycles in this proof then forces the instantiation of recursion in the abduced inductive definitions. Our procedure is capable of constructing natural terminatio...
One way to develop more robust software is to use formal program verification. Formal program verifi...
techniques for automated (innermost) termination proofs of (possibly conditional) TRSs, logic progra...
We describe a new program termination analysis designed to handle imperative programs whose termina...
Abstract. We introduce cyclic abduction: a new method for automati-cally inferring safety and termin...
We propose a novel approach to proving the termination of heap-manipulating programs, which combines...
We describe a formal verification framework and tool implementation, based upon cyclic proofs, for c...
Abstract. This paper investigates the use of Separation Logic with inductive definitions in reasonin...
In the current paper, we discuss cycles in Constraint Handling Rules for the purpose of scaling term...
Abstract. This paper introduces a modular framework for termination analysis of logic programming. T...
In program veri_cation, measures for proving the termination of programs are typically constructed u...
We propose a constraint-based approach towards automated termination analysis of Constraint Handling...
We present a constraint-based method for proving conditional termination of integer programs. Buildi...
Abstract. We present a novel technique for proving program termination which introduces a new dimens...
Term rewrite systems have been extensively used in order to model computer programs for the purpose ...
The termination assertion p〈S〉 q means that whenever the formula p is true, there is an execution of...
One way to develop more robust software is to use formal program verification. Formal program verifi...
techniques for automated (innermost) termination proofs of (possibly conditional) TRSs, logic progra...
We describe a new program termination analysis designed to handle imperative programs whose termina...
Abstract. We introduce cyclic abduction: a new method for automati-cally inferring safety and termin...
We propose a novel approach to proving the termination of heap-manipulating programs, which combines...
We describe a formal verification framework and tool implementation, based upon cyclic proofs, for c...
Abstract. This paper investigates the use of Separation Logic with inductive definitions in reasonin...
In the current paper, we discuss cycles in Constraint Handling Rules for the purpose of scaling term...
Abstract. This paper introduces a modular framework for termination analysis of logic programming. T...
In program veri_cation, measures for proving the termination of programs are typically constructed u...
We propose a constraint-based approach towards automated termination analysis of Constraint Handling...
We present a constraint-based method for proving conditional termination of integer programs. Buildi...
Abstract. We present a novel technique for proving program termination which introduces a new dimens...
Term rewrite systems have been extensively used in order to model computer programs for the purpose ...
The termination assertion p〈S〉 q means that whenever the formula p is true, there is an execution of...
One way to develop more robust software is to use formal program verification. Formal program verifi...
techniques for automated (innermost) termination proofs of (possibly conditional) TRSs, logic progra...
We describe a new program termination analysis designed to handle imperative programs whose termina...