Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikačního výsledku
ROGALEWICZ, A.
Originální název
Towards Applying Mona in Abstract Regular Tree Model Checking
Anglický název
Druh
Stať ve sborníku mimo WoS a Scopus
Originální abstrakt
We consider the problem of automated formal verification ofmodern concurrent software systems. Dealing with such systems, which involveshandling unbounded dynamic instantiation, recursion, etc., naturally leads to aneed of dealing with infinite state spaces. We suppose states of such systemsto be encoded terms with a tree structure and we would like touse the abstract regular tree model checking method for dealing with infinite sets of states.This paper presents an ongoing research on application of abstract regular model checking inthe infinite state systems verification, and possibility to use the Mona GTA library for experiments.
Anglický abstrakt
Klíčová slova
formal verification, regular tree model checking, automated abstraction
Klíčová slova v angličtině
Autoři
Vydáno
28.04.2005
Nakladatel
Faculty of Information Technology BUT
Místo
Brno
ISBN
80-214-2890-2
Kniha
Proceedings of the 11th Conference Student EEICT 2005
Edice
Volume 3
Strany od
663
Strany do
667
Strany počet
5
BibTex
@inproceedings{BUT21502, author="Adam {Rogalewicz}", title="Towards Applying Mona in Abstract Regular Tree Model Checking", booktitle="Proceedings of the 11th Conference Student EEICT 2005", year="2005", series="Volume 3", pages="663--667", publisher="Faculty of Information Technology BUT", address="Brno", isbn="80-214-2890-2" }