Marjan Sirjani (Reykjavík University)

Constraint Automata: Symbolic Execution or not?

Abstract: Reo is a coordination language that can be used to model
different systems. We propose a technique for symbolic execution of
Reo circuits using Constraint Automata and more specifically
exploiting their data constraints.  As an alternative to constructing
the symbolic execution tree, we propose an algorithm similar to the
algorithms used for converting deterministic finite automata to
regular expressions.  This technique enables us to obtain the
coordination patterns and also finding deadlocks.