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
Conference paper

DOI: 10.1007/978-3-642-54862-8_35

Volume 8413 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Heizmann M. et al. (2014) Ultimate Automizer with Unsatisfiable Cores. In: Ábrahám E., Havelund K. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2014. Lecture Notes in Computer Science, vol 8413. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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