Advertisement

Ultimate Automizer with Unsatisfiable Cores

(Competition Contribution)
  • Matthias Heizmann
  • Jürgen Christ
  • Daniel Dietsch
  • Jochen Hoenicke
  • Markus Lindenmann
  • Betim Musa
  • Christian Schilling
  • Stefan Wissert
  • Andreas Podelski
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8413)

Abstract

Ultimate Automizer 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.

Keywords

Graph Reachability Demonstration Category Predicate Transformer Software Model Check Unsatisfiable Core 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Dietsch, D.: STALIN: A plugin-based modular framework for program analysis. Bachelor Thesis, Albert-Ludwigs-Universität, Freiburg, Germany (2008)Google Scholar
  2. 2.
    Heizmann, M., et al.: Ultimate automizer with SMTInterpol. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 641–643. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  3. 3.
    Heizmann, M., Hoenicke, J., Leike, J., Podelski, A.: Linear ranking for linear lasso programs. In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 365–380. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  4. 4.
    Heizmann, M., Hoenicke, J., Podelski, A.: Software model checking for people who love automata. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 36–52. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  5. 5.
    Leike, J.: Ranking function synthesis for linear lasso programs. Master’s thesis, University of Freiburg, Germany (2013)Google Scholar
  6. 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. 7.
    Lindenmann, M.: A simple but sufficient memory model for ultimate. Master’s thesis, University of Freiburg, Germany (2012)Google Scholar
  8. 8.
    Musa, B.: Trace abstraction with unsatisfiable cores. Bachelor’s thesis, University of Freiburg, Germany (2013)Google Scholar
  9. 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. 10.
    Schilling, C.: Minimization of nested word automata. Master’s thesis, University of Freiburg, Germany (2013)Google Scholar
  11. 11.
    Wissert, S.: Adaptive block encoding for recursive control flow graphs. Master’s thesis, University of Freiburg, Germany (2013)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Matthias Heizmann
    • 1
  • Jürgen Christ
    • 1
  • Daniel Dietsch
    • 1
  • Jochen Hoenicke
    • 1
  • Markus Lindenmann
    • 1
  • Betim Musa
    • 1
  • Christian Schilling
    • 1
  • Stefan Wissert
    • 1
  • Andreas Podelski
    • 1
  1. 1.University of FreiburgGermany

Personalised recommendations