Ultimate Automizer with Two-track Proofs

Heizmann, Matthias; Dietsch, Daniel; Greitschus, Marius; Leike, Jan; Musa, Betim; Schätzle, Claus; Podelski, Andreas

doi:10.1007/978-3-662-49674-9_68

Cited by 18 publications

(11 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We also compared FuncTion against the tools participating to SV-COMP 2016 : AProVE [34], SeaHorn [21,38] and UAutomizer [22]. We did not compare with other tools such as T2 [6] and 2LS [9] since FuncTion does not yet support the input format of T2 and bit-precise integer semantics (like 2LS does).…”

Section: Implementation and Experimental Evaluationmentioning

confidence: 99%

“…UAutomizer [22] is a software model checker based on an automata-theoretic approach to software verification [23]. Similarly to Terminator, it reduces proving termination to proving that no program state is repeatedly visited (and it is not covered by the current termination argument), and composes termination arguments by repeatedly invoking a ranking function synthesis tool [28].…”

Section: Related Workmentioning

confidence: 99%

“…We combined these improvements to obtain an implementation of the abstract domain which subsumes the previous implementation. We provide experimental evidence in comparison with state-of-the-art tools [34,21,22] showing a considerable improvement in precision at a minor cost in performance.…”

Section: Introductionmentioning

confidence: 98%

See 2 more Smart Citations

Precise Widening Operators for Proving Termination by Abstract Interpretation

Courant

Urban

2017

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

FuncTion is a static analyzer designed for proving conditional termination of C programs by means of abstract interpretation. Its underlying abstract domain is based on piecewise-defined functions, which provide an upper bound on the number of program execution steps until termination as a function of the program variables. In this paper, we fully parameterize various aspects of the abstract domain, gaining a flexible balance between the precision and the cost of the analysis. We propose heuristics to improve the fixpoint extrapolation strategy (i.e., the widening operator) of the abstract domain. In particular we identify new widening operators, which combine these heuristics to dramatically increase the precision of the analysis while offering good cost compromises. We also introduce a more precise, albeit costly, variable assignment operator and the support for choosing between integer and rational values for the piecewise-defined functions. We combined these improvements to obtain an implementation of the abstract domain which subsumes the previous implementation. We provide experimental evidence in comparison with state-of-the-art tools showing a considerable improvement in precision at a minor cost in performance.

show abstract

Section: Implementation and Experimental Evaluationmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Precise Widening Operators for Proving Termination by Abstract Interpretation

Courant

Urban

2017

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

show abstract

“…In order to solve these instances efficiently, we propose a greedy algorithm that finds suboptimal solutions (Section 5.1). As a proof of concept, we implemented the algorithm and evaluated it in the context of the automata-based software verifier Ultimate Automizer [24,26] (Section 5.2).…”

Section: Our Approachmentioning

confidence: 99%

Minimization of Visibly Pushdown Automata Using Partial Max-SAT

Heizmann

Schilling

Tischner

2017

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

Abstract. We consider the problem of state-space reduction for nondeterministic weakly-hierarchical visibly pushdown automata (Vpa). Vpa recognize a robust and algorithmically tractable fragment of context-free languages that is natural for modeling programs. We define an equivalence relation that is sufficient for language-preserving quotienting of Vpa. Our definition allows to merge states that have different behavior, as long as they show the same behavior for reachable equivalent stacks. We encode the existence of such a relation as a Boolean partial maximum satisfiability (PMax-Sat) problem and present an algorithm that quickly finds satisfying assignments. These assignments are sub-optimal solutions to the PMax-Sat problem but can still lead to a significant reduction of states. We integrated our method in the automata-based software verifier Ultimate Automizer and show performance improvements on benchmarks from the software verification competition SV-COMP.

show abstract

“…Our method is based on a reduction to termination analysis for sequential programs: we translate a π-calculus process P to a sequential program S P , so that if S P is terminating, so is P . The reduction allows us to use powerful, mature methods and tools for termination analysis of sequential programs [17,14,24,21,7].…”

Section: Introductionmentioning

confidence: 99%

Termination Analysis for the $π$-Calculus by Reduction to Sequential Program Termination

Shoshi¹,

Ishikawa²,

Kobayashi³

et al. 2021

Preprint

View full text Add to dashboard Cite

We propose an automated method for proving termination of π-calculus processes, based on a reduction to termination of sequential programs: we translate a π-calculus process to a sequential program, so that the termination of the latter implies that of the former. We can then use an off-the-shelf termination verification tool to check termination of the sequential program. Our approach has been partially inspired by Deng and Sangiorgi's termination analysis for the π-calculus, and checks that there is no infinite chain of communications on replicated input channels, by converting such a chain of communications to a chain of recursive function calls in the target sequential program. We have implemented an automated tool based on the proposed method and confirmed its effectiveness.

show abstract

Ultimate Automizer with Two-track Proofs

Cited by 18 publications

References 6 publications

Precise Widening Operators for Proving Termination by Abstract Interpretation

Precise Widening Operators for Proving Termination by Abstract Interpretation

Minimization of Visibly Pushdown Automata Using Partial Max-SAT

Termination Analysis for the $π$-Calculus by Reduction to Sequential Program Termination

Contact Info

Product

Resources

About