This HTML5 document contains 44 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n8http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n14http://purl.org/net/nknouf/ns/bibtex#
n6http://localhost/temp/predkladatel/
n7http://linked.opendata.cz/resource/domain/vavai/projekt/
n5http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n9http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26230%2F05%3APU56410%21RIV06-GA0-26230___/
n11http://linked.opendata.cz/ontology/domain/vavai/
n3https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n21http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n18http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216305%3A26230%2F05%3APU56410%21RIV06-GA0-26230___
rdf:type
n11:Vysledek skos:Concept
dcterms: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> 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>
dcterms:title
Cesta k použití Mony pro abstract regular tree model checking Towards Applying Mona in Abstract Regular Tree Model Checking Towards Applying Mona in Abstract Regular Tree Model Checking
skos:prefLabel
Cesta k použití Mony pro abstract regular tree model checking Towards Applying Mona in Abstract Regular Tree Model Checking Towards Applying Mona in Abstract Regular Tree Model Checking
skos:notation
RIV/00216305:26230/05:PU56410!RIV06-GA0-26230___
n4:strany
663-667
n4:aktivita
n10:P
n4:aktivity
P(GA102/04/0780), P(GP102/03/D211)
n4:dodaniDat
n18:2006
n4:domaciTvurceVysledku
n5:4978536
n4:druhVysledku
n16:D
n4:duvernostUdaju
n20:S
n4:entitaPredkladatele
n9:predkladatel
n4:idSjednocenehoVysledku
546961
n4:idVysledku
RIV/00216305:26230/05:PU56410
n4:jazykVysledku
n17:eng
n4:klicovaSlova
formal verification, regular tree model checking, automated abstraction
n4:klicoveSlovo
n21:automated%20abstraction n21:regular%20tree%20model%20checking n21:formal%20verification
n4:kontrolniKodProRIV
[693620A36BA0]
n4:mistoKonaniAkce
Brno
n4:mistoVydani
Brno
n4:nazevZdroje
Proceedings of the 11th Conference Student EEICT 2005
n4:obor
n19:JC
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
1
n4:projekt
n7:GP102%2F03%2FD211 n7:GA102%2F04%2F0780
n4:rokUplatneniVysledku
n18:2005
n4:tvurceVysledku
Rogalewicz, Adam
n4:typAkce
n8:CST
n4:zahajeniAkce
2005-04-28+02:00
s:numberOfPages
5
n14:hasPublisher
Vysoké učení technické v Brně. Fakulta informačních technologií
n3:isbn
80-214-2890-2
n6:organizacniJednotka
26230