Publication detail

Towards Applying Mona in Abstract Regular Tree Model Checking

ROGALEWICZ, A.

Original Title

Towards Applying Mona in Abstract Regular Tree Model Checking

Type

article in a collection out of WoS and Scopus

Language

English

Original Abstract

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.

Keywords

formal verification, regular tree model checking, automated abstraction

Authors

ROGALEWICZ, A.

RIV year

2005

Released

28. 4. 2005

Publisher

Faculty of Information Technology BUT

Location

Brno

ISBN

80-214-2890-2

Book

Proceedings of the 11th Conference Student EEICT 2005

Edition

Volume 3

Pages from

663

Pages to

667

Pages count

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"
}