Skip to main content
Conference ProceedingsOPEN ACCESS

FORESTER: From heap shapes to automata predicates

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2017) 10206 LNCS 365-369
DOI: 10.1007/978-3-662-54580-5_24
5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper describes the participation of Forester in the SV-COMP 2017 competition on software verification. We briefly present the verification procedure used by Forester, the architecture of Forester, and changes in Forester done since the previous year of SV-COMP, in particular the fully-automatically refinable abstraction for hierarchical forest automata.

Cite

CITATION STYLE

APA

Holík, L., Hruška, M., Lengál, O., Rogalewicz, A., Šimáček, J., & Vojnar, T. (2017). FORESTER: From heap shapes to automata predicates. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10206 LNCS, pp. 365–369). Springer Verlag. https://doi.org/10.1007/978-3-662-54580-5_24

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