Attributes | Values |
---|
rdf:type
| |
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 ongoing research 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>
- 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 ongoing research 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> (en)
- Č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> (cs)
|
Title
| - Towards Applying Mona in Abstract Regular Tree Model Checking
- Towards Applying Mona in Abstract Regular Tree Model Checking (en)
- Cesta k použití Mony pro abstract regular tree model checking (cs)
|
skos:prefLabel
| - Towards Applying Mona in Abstract Regular Tree Model Checking
- Towards Applying Mona in Abstract Regular Tree Model Checking (en)
- Cesta k použití Mony pro abstract regular tree model checking (cs)
|
skos:notation
| - RIV/00216305:26230/05:PU56410!RIV06-GA0-26230___
|
http://linked.open.../vavai/riv/strany
| |
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| - P(GA102/04/0780), P(GP102/03/D211)
|
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/00216305:26230/05:PU56410
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - formal verification, regular tree model checking, automated abstraction (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...v/mistoKonaniAkce
| |
http://linked.open...i/riv/mistoVydani
| |
http://linked.open...i/riv/nazevZdroje
| - Proceedings of the 11th Conference Student EEICT 2005
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...iv/tvurceVysledku
| |
http://linked.open...vavai/riv/typAkce
| |
http://linked.open.../riv/zahajeniAkce
| |
number of pages
| |
http://purl.org/ne...btex#hasPublisher
| - Vysoké učení technické v Brně. Fakulta informačních technologií
|
https://schema.org/isbn
| |
http://localhost/t...ganizacniJednotka
| |
is http://linked.open...avai/riv/vysledek
of | |