Skip to main content
Conference ProceedingsOPEN ACCESS

Ultimate automizer with two-track proofs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2016) 9636 950-953
DOI: 10.1007/978-3-662-49674-9_68
15Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Heizmann, M., Dietsch, D., Greitschus, M., Leike, J., Musa, B., Schätzle, C., & Podelski, A. (2016). Ultimate automizer with two-track proofs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9636, pp. 950–953). Springer Verlag. https://doi.org/10.1007/978-3-662-49674-9_68

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free