Result Details

Harnessing Forest Automata for Verification of Heap Manipulating Programs

ŠIMÁČEK, J. Harnessing Forest Automata for Verification of Heap Manipulating Programs. Brno: Faculty of Information Technology BUT, 2012. 128 p.

Type

dissertation

Language

English

Authors

Šimáček Jiří, Ing., Ph.D.

Keywords

pointers, heaps, verification, shape analysis, regular model checking,
finite tree automata, antichains, simulations, language inclusion

Published

2012

Pages

128

Publisher

Faculty of Information Technology BUT

Place

Brno

BibTeX

@misc{BUT192865,
  author="Jiří {Šimáček}",
  title="Harnessing Forest Automata for Verification of Heap Manipulating Programs",
  year="2012",
  pages="128",
  publisher="Faculty of Information Technology BUT",
  address="Brno",
  url="https://www.fit.vut.cz/research/publication/10181/"
}

Files

pdf simacek_thesis_final.pdf 892 kB

Research groups

Automated Analysis and Verification Research Group - VeriFIT (RG VERIFIT)

Departments

Department of Intelligent Systems (DITS)