Word equations are a crucial element in the theoretical foundation of constraint solving over
strings. A word equation relates two words over string variables and constants. Its solution …

This paper is about reachability analysis in a restricted subclass of multi-pushdown
automata. We assume that the control states of an automaton are partially ordered, and all …

This thesis is about an extension of context-free grammars with partial commutation on
nonterminal symbols. In particular, we investigate the subclass with transitive dependence …

As computer systems are becoming ubiquitous and their importance and complexity are
constantly increasing, the importance of verification tools applicable on these systems grows …