Detail publikace

Towards Applying Mona in Abstract Regular Tree Model Checking

ROGALEWICZ, A.

Originální název

Towards Applying Mona in Abstract Regular Tree Model Checking

Typ

článek ve sborníku ve WoS nebo Scopus

Jazyk

angličtina

Originální abstrakt

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.

Klíčová slova

formal verification, regular tree model checking, automated abstraction

Autoři

ROGALEWICZ, A.

Rok RIV

2005

Vydáno

28. 4. 2005

Nakladatel

Faculty of Information Technology BUT

Místo

Brno

ISBN

80-214-2890-2

Kniha

Proceedings of the 11th Conference Student EEICT 2005

Edice

Volume 3

Strany od

663

Strany do

667

Strany počet

5

BibTex

@inproceedings{BUT21502,
  author="Adam {Rogalewicz}",
  title="Towards Applying Mona in Abstract Regular Tree Model Checking",
  booktitle="Proceedings of the 11th Conference Student EEICT 2005",
  year="2005",
  series="Volume 3",
  pages="663--667",
  publisher="Faculty of Information Technology BUT",
  address="Brno",
  isbn="80-214-2890-2"
}