Skip to main content
Conference ProceedingsOPEN ACCESS

ULTIMATE AUTOMIZER with array interpolation (Competition contribution)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2015) 9035 455-457
DOI: 10.1007/978-3-662-46681-0_43
16Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Ultimate Automizer is a software verification tool that is able to analyze reachability of an error label, memory safety, and termination of C programs. For all three tasks, our tool follows an automatabased approach where interpolation is used to compute proofs for traces. The interpolants are generated via a new scheme that requires only the post operator, unsatisfiable cores and live variable analysis. This new scheme enables our tool to use the SMT theory of arrays in combination with interpolation.

Cite

CITATION STYLE

APA

Heizmann, M., Dietsch, D., Leike, J., Musa, B., & Podelski, A. (2015). ULTIMATE AUTOMIZER with array interpolation (Competition contribution). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9035, pp. 455–457). Springer Verlag. https://doi.org/10.1007/978-3-662-46681-0_43

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