"80-214-2890-2" . . "26230" . . "1"^^ . . "RIV/00216305:26230/05:PU56410" . "[693620A36BA0]" . . . "546961" . "1"^^ . . "663-667" . "5"^^ . "\u010Cl\u00E1nek zkoum\u00E1 mo\u017Enosti pou\u017Eit\u00ED knihovny pro praci s guided tree automaty (sou\u010D\u00E1st projektu Mona) pro implementaci techniky abstract regular tree model checking.

"@cs . "Vysok\u00E9 u\u010Den\u00ED technick\u00E9 v Brn\u011B. Fakulta informa\u010Dn\u00EDch technologi\u00ED" . . . "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.

" . . "Cesta k pou\u017Eit\u00ED Mony pro abstract regular tree model checking"@cs . . "Rogalewicz, Adam" . . "Brno" . "2005-04-28+02:00"^^ . . . "Brno" . "RIV/00216305:26230/05:PU56410!RIV06-GA0-26230___" . "Cesta k pou\u017Eit\u00ED Mony pro abstract regular tree model checking"@cs . "Proceedings of the 11th Conference Student EEICT 2005" . "Towards Applying Mona in Abstract Regular Tree Model Checking"@en . "P(GA102/04/0780), P(GP102/03/D211)" . . "formal verification, regular tree model checking, automated abstraction"@en . . "Towards Applying Mona in Abstract Regular Tree Model Checking" . "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.

"@en . . . "Towards Applying Mona in Abstract Regular Tree Model Checking" . "Towards Applying Mona in Abstract Regular Tree Model Checking"@en .