Skip to main content
Conference ProceedingsOPEN ACCESS

Ultimate Kojak (Competition contribution)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2014) 8413 LNCS 421-423
DOI: 10.1007/978-3-642-54862-8_36
4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Ultimate Kojak is a symbolic software model checker for C programs. It is based on CEGAR and Craig interpolation. The basic algorithm, described in an earlier work [1], was extended to be able to deal with recursive programs using nested word automata and nested (tree) interpolants. © 2014 Springer-Verlag.

Cite

CITATION STYLE

APA

Ermis, E., Nutz, A., Dietsch, D., Hoenicke, J., & Podelski, A. (2014). Ultimate Kojak (Competition contribution). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8413 LNCS, pp. 421–423). Springer Verlag. https://doi.org/10.1007/978-3-642-54862-8_36

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