35 citations · 151 across the 21 of their papers we have counts for
Showing 2016 · cs.FLShow all
2 papers · 2 filters
cs.FL2016★ 4 cited
On parametrized verification of asynchronous, shared-memory pushdown systems
Marie Fortin, Anca Muscholl, Igor Walukiewicz
We consider the model of parametrized asynchronous shared-memory pushdown systems, as introduced in [Hague'11]. In a series of recent papers it has been shown that reachability in…
cs.FL2016★ 1 cited
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable
Lorenzo Clemente, Paweł Parys, Sylvain Salvati +1
A non-deterministic recursion scheme recognizes a language of finite trees. This very expressive model can simulate, among others, higher-order pushdown automata with collapse. We…