Proving Non-looping Non-termination Automatically

Emmes, Fabian; Enger, Tim; Giesl, Jürgen

doi:10.1007/978-3-642-31365-3_19

Cited by 18 publications

(41 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Non-termination of TRSs is detected by suitable adaptions of narrowing [25,36]. The frontends for Java and C programs generate int-TRSs, a variation of standard term rewriting that has builtin support for integer values and operations.…”

Section: Analyzing Term Rewrite Systemsmentioning

confidence: 99%

“…A graphical overview of our approach is shown below. Technical details on the techniques for transforming programs to (int-) TRSs and for analyzing rewrite systems can be found in, e.g., [10,11,12,14,17,25,26,27,28,29,30,31,32,33,34,36,37,39,40,41,43,44,51,52,57,58]. Since the current paper is a system description, we focus on the implementation of these techniques in AProVE, which we have made available as a plug-in for the popular Eclipse software development environment [23].…”

mentioning

confidence: 99%

See 1 more Smart Citation

Analyzing Program Termination and Complexity Automatically with AProVE

et al. 2016

Self Cite

View full text Add to dashboard Cite

In this system description, we present the tool AProVE for automatic termination and complexity proofs of Java, C, Haskell, Prolog, and rewrite systems. In addition to classical term rewrite systems (TRSs), AProVE also supports rewrite systems containing built-in integers (int-TRSs). To analyze programs in high-level languages, AProVE automatically converts them to (int-)TRSs. Then, a wide range of techniques is employed to prove termination and to infer complexity bounds for the resulting rewrite systems. The generated proofs can be exported to check their correctness using automatic certifiers. To use AProVE in software construction, we present a corresponding plug-in for the popular Eclipse software development environment.

show abstract

Section: Analyzing Term Rewrite Systemsmentioning

confidence: 99%

mentioning

confidence: 99%

Analyzing Program Termination and Complexity Automatically with AProVE

et al. 2016

Self Cite

View full text Add to dashboard Cite

show abstract

“…As SMT solvers, AProVE uses Yices [12] and Z3 [25]. Non-termination of TRSs is detected by suitable adaptions of narrowing [15].…”

Section: Analyzing Term Rewrite Systemsmentioning

confidence: 99%

Proving Termination of Programs Automatically with AProVE

Giesl

Brockschmidt

Emmes

et al. 2014

Automated Reasoning

Self Cite

View full text Add to dashboard Cite

Abstract. AProVE is a system for automatic termination and complexity proofs of Java, C, Haskell, Prolog, and term rewrite systems (TRSs). To analyze programs in high-level languages, AProVE automatically converts them to TRSs. Then, a wide range of techniques is employed to prove termination and to infer complexity bounds for the resulting TRSs. The generated proofs can be exported to check their correctness using automatic certifiers. For use in software construction, we present an AProVE plug-in for the popular Eclipse software development environment.

show abstract

“…Nevertheless, important first steps were made in proving existence of infinite program computations, see e.g. [16,20,29], even in proving existential (as well as universal) CTL properties [11]. Moreover, bounded model checking tools like CBMC [8] or Klee [7] can be very effective in proving existential reachability properties.…”

Section: Introductionmentioning

confidence: 99%

Solving Existentially Quantified Horn Clauses

Beyene

Popeea

Rybalchenko

2013

Computer Aided Verification

View full text Add to dashboard Cite

Abstract. Temporal verification of universal (i.e., valid for all computation paths) properties of various kinds of programs, e.g., procedural, multi-threaded, or functional, can be reduced to finding solutions for equations in form of universally quantified Horn clauses extended with well-foundedness conditions. Dealing with existential properties (e.g., whether there exists a particular computation path), however, requires solving forall-exists quantified Horn clauses, where the conclusion part of some clauses contains existentially quantified variables. For example, a deductive approach to CTL verification reduces to solving such clauses. In this paper we present a method for solving forall-exists quantified Horn clauses extended with well-foundedness conditions. Our method is based on a counterexample-guided abstraction refinement scheme to discover witnesses for existentially quantified variables. We also present an application of our solving method to automation of CTL verification of software, as well as its experimental evaluation.

show abstract

Proving Non-looping Non-termination Automatically

Abstract: Abstract. We introduce a technique to prove non-termination of term rewrite systems automatically. Our technique improves over previous approaches substantially, as it can also detect non-looping non-termination.

Cited by 18 publications

References 13 publications

Analyzing Program Termination and Complexity Automatically with AProVE

Analyzing Program Termination and Complexity Automatically with AProVE

Proving Termination of Programs Automatically with AProVE

Solving Existentially Quantified Horn Clauses

Contact Info

Product

Resources

About