TOWARDS APPLYING MONA IN ABSTRACT REGULAR TREE MODEL CHECKING

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.