Forester: From Heap Shapes to Automata Predicates
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F17%3APU123249" target="_blank" >RIV/00216305:26230/17:PU123249 - isvavai.cz</a>
Result on the web
<a href="https://www.fit.vut.cz/research/publication/11414/" target="_blank" >https://www.fit.vut.cz/research/publication/11414/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-662-54580-5_24" target="_blank" >10.1007/978-3-662-54580-5_24</a>
Alternative languages
Result language
angličtina
Original language name
Forester: From Heap Shapes to Automata Predicates
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of TACAS'17
ISBN
978-3-662-54580-5
ISSN
—
e-ISSN
—
Number of pages
4
Pages from-to
365-369
Publisher name
Springer Verlag
Place of publication
Heidelberg
Event location
Uppsala
Event date
Apr 22, 2017
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000440733400024