Proving Termination of Programs Automatically with AProVE

Giesl, Jürgen; Brockschmidt, Marc; Emmes, Fabian; Frohn, Florian; Fuhs, Carsten; Otto, Carsten; Plücker, Martin; Schneider–Kamp, Peter; Ströder, Thomas; Swiderski, Stephanie; Thiemann, René

doi:10.1007/978-3-319-08587-6_13

Cited by 79 publications

(61 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…c181f40 [18], Ultimate Automizer v.0.1.23 [22], and HipTNT+ v.1.0 [30]. The rest of the section summarizes three sets of experiments.…”

Section: Discussionmentioning

confidence: 99%

“…This distinguishes our work from most of the related approaches [7,18,20,23,30,32,36,39,40]. The key insight, adapted from [14,16], is that the syntactical structures that appear in the program give rise to a formal grammar, from which many candidates could be sampled.…”

Section: Introductionmentioning

confidence: 99%

“…We have evaluated FreqTerm on a range of terminating and nonterminating programs taken from SVCOMP 1 and on large-scale benchmarks arising from Event-Condition-Action systems 2 (ECA). Compared to state-ofthe-art termination analyzers [18,22,30], FreqTerm exhibits a competitive runtime, and achieves several orders of magnitude performance improvement while proving non-termination of ECAs.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Syntax-Guided Termination Analysis

Fedyukovich

Zhang

Gupta

2018

Computer Aided Verification

View full text Add to dashboard Cite

Abstract. We present new algorithms for proving program termination and non-termination using syntax-guided synthesis. They exploit the symbolic encoding of programs and automatically construct a formal grammar for symbolic constraints that are used to synthesize either a termination argument or a non-terminating program refinement. The constraints are then added back to the program encoding, and an offthe-shelf constraint solver decides on their fitness and on the progress of the algorithms. The evaluation of our implementation, called FreqTerm, shows that although the formal grammar is limited to the syntax of the program, in the majority of cases our algorithms are effective and fast. Importantly, FreqTerm is competitive with state-of-the-art on a wide range of terminating and non-terminating benchmarks, and it significantly outperforms state-of-the-art on proving non-termination of a class of programs arising from large-scale Event-Condition-Action systems.

show abstract

“…c181f40 [18], Ultimate Automizer v.0.1.23 [22], and HipTNT+ v.1.0 [30]. The rest of the section summarizes three sets of experiments.…”

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Syntax-Guided Termination Analysis

Fedyukovich

Zhang

Gupta

2018

Computer Aided Verification

View full text Add to dashboard Cite

show abstract

“…To evaluate our approach, we compare our tool against state-ofthe-art systems, i.e. T2 [7], ULTIMATE [25] and AProVE [20]. The last tool is the recent winner for several categories of problems in the annual Termination Competition 2014 (TermCOMP'14) [45] and the Termination category in the Competition on Software Verification 2015 (SV-COMP'15) [44].…”

Section: Methodsmentioning

confidence: 99%

Termination and non-termination specification inference

Qin

Chin

2015

SIGPLAN Not.

View full text Add to dashboard Cite

Techniques for proving termination and non-termination of imperative programs are usually considered as orthogonal mechanisms. In this paper, we propose a novel mechanism that analyzes and proves both program termination and non-termination at the same time. We first introduce the concept of second-order termination constraints and accumulate a set of relational assumptions on them via a Hoare-style verification. We then solve these assumptions with case analysis to determine the (conditional) termination and nontermination scenarios expressed in some specification logic form. In contrast to current approaches, our technique can construct a summary of terminating and non-terminating behaviors for each method. This enables modularity and reuse for our termination and non-termination proving processes. We have tested our tool on sample programs from a recent termination competition, and compared favorably against state-of-the-art termination analyzers.

show abstract

“…AProVE [7] and Ultimate [10] competed on termination analysis for Java programs. During the writing of this paper, the authors of Ultimate, CBMC, and CPAChecker [3] were actively working on tools for Java (and we would like to thank them for their test cases and examples) but none of them was available for a direct comparison with JayHorn.…”

Section: Related Workmentioning

confidence: 99%

JayHorn: A Framework for Verifying Java programs

Kahsai

Rümmer

Sanchez

et al. 2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Building a competitive program verifiers is becoming cheaper. On the front-end side, openly available compiler infrastructure and optimization frameworks take care of hairy problems such as alias analysis, and break down the subtleties of modern languages into a handful of simple instructions that need to be handled. On the back-end side, theorem provers start providing full-fledged model checking algorithms, such as PDR, that take care looping control-flow. In this spirit, we developed JayHorn, a verification framework for Java with the goal of having as few moving parts as possible. Most steps of the translation from Java into logic are implemented as bytecode transformations, with the implication that their soundness can be tested easily. From the transformed bytecode, we generate a set of constrained Horn clauses that are verified using state-of-the-art Horn solvers. We report on our implementation experience and evaluate JayHorn on benchmarks.

show abstract

Proving Termination of Programs Automatically with AProVE

Cited by 79 publications

References 31 publications

Syntax-Guided Termination Analysis

Syntax-Guided Termination Analysis

Termination and non-termination specification inference

JayHorn: A Framework for Verifying Java programs

Contact Info

Product

Resources

About