Publication Details

Towards Applying Mona in Abstract Regular Tree Model Checking

ROGALEWICZ Adam. Towards Applying Mona in Abstract Regular Tree Model Checking. In: Proceedings of the 11th Conference Student EEICT 2005. Volume 3. Brno: Faculty of Information Technology BUT, 2005, pp. 663-667. ISBN 80-214-2890-2.
Czech title
Cesta k použití Mony pro abstract regular tree model checking
Type
conference paper
Language
english
Authors
Rogalewicz Adam, doc. Mgr., Ph.D. (DITS FIT BUT)
Keywords

formal verification, regular tree model checking, automated abstraction

Abstract

We consider the problem of automated formal verification of
modern concurrent software systems. Dealing with such systems, which involves
handling unbounded dynamic instantiation, recursion, etc., naturally leads to a
need of dealing with infinite state spaces. We suppose states of such systems
to be encoded terms with a tree structure and we would like to
use 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 in
the infinite state systems verification, and possibility to use the Mona GTA library for experiments.

Published
2005
Pages
663-667
Proceedings
Proceedings of the 11th Conference Student EEICT 2005
Series
Volume 3
Conference
STUDENT EEICT 2005, Brno, CZ
ISBN
80-214-2890-2
Publisher
Faculty of Information Technology BUT
Place
Brno, CZ
BibTeX 
@INPROCEEDINGS{FITPUB7793,
   author = "Adam Rogalewicz",
   title = "Towards Applying Mona in Abstract Regular Tree Model Checking",
   pages = "663--667",
   booktitle = "Proceedings of the 11th Conference Student EEICT 2005",
   series = "Volume 3",
   year = 2005,
   location = "Brno, CZ",
   publisher = "Faculty of Information Technology BUT",
   ISBN = "80-214-2890-2",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/7793"
}
Back to top