Ultimate Taipan: Trace Abstraction and Abstract Interpretation

(Competition Contribution)
  • Marius Greitschus
  • Daniel Dietsch
  • Matthias Heizmann
  • Alexander Nutz
  • Claus Schätzle
  • Christian Schilling
  • Frank Schüssele
  • Andreas Podelski
Conference paper

DOI: 10.1007/978-3-662-54580-5_31

Part of the Lecture Notes in Computer Science book series (LNCS, volume 10206)
Cite this paper as:
Greitschus M. et al. (2017) Ultimate Taipan: Trace Abstraction and Abstract Interpretation. In: Legay A., Margaria T. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2017. Lecture Notes in Computer Science, vol 10206. Springer, Berlin, Heidelberg

Abstract

Ultimate Taipan is a software model checker for C programs. It is based on a CEGAR variant, trace abstraction [7], where program abstractions, counterexample selection and abstraction refinement are based on automata. Ultimate Taipan constructs path programs from counterexamples and computes fixpoints for those path programs using abstract interpretation. If the fixpoints are strong enough to prove the path program to be correct, they are guaranteed to be loop invariants for the path program. If they are not strong enough, Ultimate Taipan uses an interpolating SMT solver to obtain state assertions from the original counterexample, thus guaranteeing progress.

Copyright information

© Springer-Verlag GmbH Germany 2017

Authors and Affiliations

  • Marius Greitschus
    • 1
  • Daniel Dietsch
    • 1
  • Matthias Heizmann
    • 1
  • Alexander Nutz
    • 1
  • Claus Schätzle
    • 1
  • Christian Schilling
    • 1
  • Frank Schüssele
    • 1
  • Andreas Podelski
    • 1
  1. 1.University of FreiburgFreiburg im BreisgauGermany

Personalised recommendations