Towards Applying Mona in Abstract Regular Tree Model Checking
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F05%3APU56410" target="_blank" >RIV/00216305:26230/05:PU56410 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Towards Applying Mona in Abstract Regular Tree Model Checking
Original language description
We consider the problem of automated formal verification of<br> modern concurrent software systems. Dealing with such systems, which involves<br> handling unbounded dynamic instantiation, recursion, etc., naturally leads to a<br> need of dealing with infinite state spaces. We suppose states of such systems<br> to be encoded terms with a tree structure and we would like to<br> use the abstract regular tree model checking method for dealing with infinite sets of states.<br> This paper presents an ongoingresearch on application of abstract regular model checking in<br> the infinite state systems verification, and possibility to use the Mona GTA library for experiments.<br> <br>
Czech name
Cesta k použití Mony pro abstract regular tree model checking
Czech description
Článek zkoumá možnosti použití knihovny pro praci s guided tree automaty (součást projektu Mona) pro implementaci techniky abstract regular tree model checking.<br> <br>
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2005
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 11th Conference Student EEICT 2005
ISBN
80-214-2890-2
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
663-667
Publisher name
Faculty of Information Technology BUT
Place of publication
Brno
Event location
Brno
Event date
Apr 28, 2005
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—