Ultimate Automizer with Two-track Proofs

(Competition Contribution)
  • Matthias Heizmann
  • Daniel Dietsch
  • Marius Greitschus
  • Jan Leike
  • Betim Musa
  • Claus Schätzle
  • Andreas Podelski
Conference paper

DOI: 10.1007/978-3-662-49674-9_68

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9636)
Cite this paper as:
Heizmann M. et al. (2016) Ultimate Automizer with Two-track Proofs. In: Chechik M., Raskin JF. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2016. Lecture Notes in Computer Science, vol 9636. Springer, Berlin, Heidelberg

Abstract

Ultimate Automizer is a software verification tool that implements an automata-based approach for the analysis of safety and liveness problems. The version that participates in this year’s competition is able to analyze non-reachability, memory safety, termination, and overflow problems. In this paper we present the new features of our tool as well as the instructions how to install and use it.

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  • Matthias Heizmann
    • 1
  • Daniel Dietsch
    • 1
  • Marius Greitschus
    • 1
  • Jan Leike
    • 2
  • Betim Musa
    • 1
  • Claus Schätzle
    • 1
  • Andreas Podelski
    • 1
  1. 1.University of FreiburgFreiburg im BreisgauGermany
  2. 2.The Australian National UniversityCanberraAustralia

Personalised recommendations