Ultimate Automizer with SMTInterpol

(Competition Contribution)
  • Matthias Heizmann
  • Jürgen Christ
  • Daniel Dietsch
  • Evren Ermis
  • Jochen Hoenicke
  • Markus Lindenmann
  • Alexander Nutz
  • Christian Schilling
  • Andreas Podelski
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7795)

Abstract

UltimateAutomizer is an automatic software verification tool for C programs. This tool is the first implementation of trace abstraction, which is an automata-theoretic approach to software verification. The implemented algorithm uses nested interpolants in its interprocedural program analysis. The interpolating SMT solver SMTInterpol is used to compute Craig interpolants.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM 56(3), 16:1–16:43 (2009)Google Scholar
  2. 2.
    Beyer, D., Cimatti, A., Griggio, A., Keremoglu, M.E., Sebastiani, R.: Software model checking via large-block encoding. In: FMCAD, pp. 25–32. IEEE (2009)Google Scholar
  3. 3.
    Christ, J., Hoenicke, J., Nutz, A.: Proof Tree Preserving Interpolation. In: Piterman, N., Smolka, S. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 126–140. Springer, Heidelberg (2013)Google Scholar
  4. 4.
    Dietsch, D.: STALIN: A plugin-based modular framework for program analysis. Bachelor Thesis, Albert-Ludwigs-Universität, Freiburg, Germany (2008)Google Scholar
  5. 5.
    Heizmann, M., Hoenicke, J., Podelski, A.: Refinement of Trace Abstraction. In: Palsberg, J., Su, Z. (eds.) SAS 2009. LNCS, vol. 5673, pp. 69–85. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  6. 6.
    Heizmann, M., Hoenicke, J., Podelski, A.: Nested interpolants. In: Hermenegildo, M.V., Palsberg, J. (eds.) POPL, pp. 471–482. ACM (2010)Google Scholar
  7. 7.
    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
  8. 8.
    Reps, T.W., Horwitz, S., Sagiv, S.: Precise interprocedural dataflow analysis via graph reachability. In: POPL 1995, pp. 49–61. ACM (1995)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Matthias Heizmann
    • 1
  • Jürgen Christ
    • 1
  • Daniel Dietsch
    • 1
  • Evren Ermis
    • 1
  • Jochen Hoenicke
    • 1
  • Markus Lindenmann
    • 1
  • Alexander Nutz
    • 1
  • Christian Schilling
    • 1
  • Andreas Podelski
    • 1
  1. 1.University of FreiburgGermany

Personalised recommendations