Section: New Results

Verification of Concurrent Recursive Programs

We have introduced a mathematical model to capture the behavior of concurrent and recursive systems. We have also identified typical properties of these systems that programmers may want to verify. We have come up with a specification language which is powerful enough to express such properties. In fact, we give a framework by which programmers can define their own specification language depending on the specific application as long as the semantics of the operators can be defined in monadic second-order logic. We have shown that checking whether a specified property is satisfiable or whether a given system satisfies a property specified in such a language is decidable with a manageable complexity (double exponential time). The proof technique is so general that it captures the results for various other well studied models. Our results were presented at MFCS'11 [50] .