Publication Details

Towards Applying Mona in Abstract Regular Tree Model Checking

ROGALEWICZ, A. Towards Applying Mona in Abstract Regular Tree Model Checking. In Proceedings of the 11th Conference Student EEICT 2005. Volume 3. Brno: Faculty of Information Technology BUT, 2005. p. 663-667. ISBN: 80-214-2890-2.

Czech title

Cesta k použití Mony pro abstract regular tree model checking

Type

conference paper

Language

English

Authors

Rogalewicz Adam, doc. Mgr., Ph.D. (DITS)

Keywords

formal verification, regular tree model checking, automated abstraction

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.

Published

2005

Pages

663–667

Proceedings

Proceedings of the 11th Conference Student EEICT 2005

Series

Volume 3

Conference

STUDENT EEICT 2005, Brno, CZ

ISBN

80-214-2890-2

Publisher

Faculty of Information Technology BUT

Place

Brno

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