Bounded treewidth, multiple context-free grammars, and downward closures

C. Aiswarya, Pascal Baumann, Prakash Saivasan +2

The reachability problem in multi-pushdown automata (MPDA) has many applications in static analysis of recursive programs. An example is safety verification of multi-threaded recur…