Ultimate Automizer with Unsatisfiable Cores
UltimateAutomizer is an automatic software verification tool for C programs. This tool is a prototype implementation of an automata-theoretic approach that allows a modular verification of programs. Furthermore, this is the first implementation of a novel interpolation technique where interpolants are not obtained from an interpolating theorem prover but from a combination of a live variable analysis, interprocedural predicate transformers and unsatisfiable cores.
Unable to display preview. Download preview PDF.
- 1.Dietsch, D.: STALIN: A plugin-based modular framework for program analysis. Bachelor Thesis, Albert-Ludwigs-Universität, Freiburg, Germany (2008)Google Scholar
- 5.Leike, J.: Ranking function synthesis for linear lasso programs. Master’s thesis, University of Freiburg, Germany (2013)Google Scholar
- 6.Leino, K.R.M.: This is Boogie 2. Manuscript working draft, Microsoft Research, Redmond, WA, USA (June 2008), http://research.microsoft.com/en-us/um/people/leino/papers/krml178.pdf
- 7.Lindenmann, M.: A simple but sufficient memory model for ultimate. Master’s thesis, University of Freiburg, Germany (2012)Google Scholar
- 8.Musa, B.: Trace abstraction with unsatisfiable cores. Bachelor’s thesis, University of Freiburg, Germany (2013)Google Scholar
- 9.Reps, T.W., Horwitz, S., Sagiv, S.: Precise interprocedural dataflow analysis via graph reachability. In: POPL 1995, pp. 49–61. ACM (1995)Google Scholar
- 10.Schilling, C.: Minimization of nested word automata. Master’s thesis, University of Freiburg, Germany (2013)Google Scholar
- 11.Wissert, S.: Adaptive block encoding for recursive control flow graphs. Master’s thesis, University of Freiburg, Germany (2013)Google Scholar