Publication Details

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. p. 206-214. ISSN: 0302-9743.
Czech title
Za efektivní analýzou tvaru pomocí stromových automatů
Type
conference paper
Language
English
Authors
Holík Lukáš, doc. Mgr., Ph.D. (DITS)
Hruška Martin, Ing., Ph.D. (Automata@FIT)
Keywords

Formal verification, shape analysis, tree automata

Abstract

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.

Published
2021
Pages
206–214
Journal
Lecture Notes in Computer Science, no. 12754, ISSN 0302-9743
Proceedings
Proceedings International Conference on Networked Systems
Series
Lecture notes in Computer Science
Publisher
Springer Verlag
Place
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"
}
Back to top