Detail výsledku

Towards Efficient Shape Analysis with Tree Automata

HOLÍK, L.; HRUŠKA, M. Towards Efficient Shape Analysis with Tree Automata. In Proceedings International Conference on Networked Systems. Lecture Notes in Computer Science. Lecture notes in Computer Science. Cham: Springer Verlag, 2021. no. 12754, p. 206-214. ISSN: 0302-9743.
Typ
článek ve sborníku konference
Jazyk
angličtina
Autoři
Holík Lukáš, doc. Mgr., Ph.D., UITS (FIT)
Hruška Martin, Ing., Ph.D., UITS (FIT)
Abstrakt

We discuss our proposal of a formalism for representing classes of graphs based on tree automata. We aim at a formalism and an entailment algorithm that could be used in verification of pointer programs, that would be efficient, have well defined completeness guarantees, and be general. We believe that building the formalism on top of tree automata will make it possible to use existing advanced tree automata implementation techniques. We sketch the basic ideas behind the formalism and an entailment decision procedure, and outline some related research challenges.

Klíčová slova

Formal verification, shape analysis, tree automata

Rok
2021
Strany
206–214
Časopis
Lecture Notes in Computer Science, č. 12754, ISSN 0302-9743
Sborník
Proceedings International Conference on Networked Systems
Řada
Lecture notes in Computer Science
Konference
International Conference on Networked Systems 2021
Vydavatel
Springer Verlag
Místo
Cham
DOI
10.1007/978-3-030-91014-3_14
UT WoS
000891773700014
EID Scopus
2-s2.0-85121865277
BibTeX 
@inproceedings{BUT176373,
  author="Lukáš {Holík} and Martin {Hruška}",
  title="Towards Efficient Shape Analysis with Tree Automata",
  booktitle="Proceedings International Conference on Networked Systems",
  year="2021",
  series="Lecture notes in Computer Science",
  journal="Lecture Notes in Computer Science",
  number="12754",
  pages="206--214",
  publisher="Springer Verlag",
  address="Cham",
  doi="10.1007/978-3-030-91014-3\{_}14",
  issn="0302-9743"
}
Projekty
Automaty v rozhodovacích procedurách a verifikaci, GAČR, Standardní projekty, GA19-24397S, GA19-24397S, zahájení: 2019-01-01, ukončení: 2021-12-31, řešení
Spolehlivé, bezpečné a efektivní počítačové systémy, VUT, Vnitřní projekty VUT, FIT-S-20-6427, zahájení: 2020-03-01, ukončení: 2023-02-28, ukončen
Výzkumné skupiny
Výzkumná skupina automatizované analýzy a verifikace - VeriFIT (VZ VERIFIT)
Pracoviště
Ústav inteligentních systémů (UITS)
Nahoru