1 citations · 3 across the 7 of their papers we have counts for
3 papers · 1 filter
Nested Words for Order-2 Pushdown Systems
C. Aiswarya, Paul Gastin, Prakash Saivasan
We study linear time model checking of collapsible higher-order pushdown systems (CPDS) of order 2 (manipulating stack of stacks) against MSO and PDL (propositional dynamic logic w…
On the Complexity of Bounded Context Switching
Peter Chini, Jonathan Kolberg, Andreas Krebs +2
Bounded context switching (BCS) is an under-approximate method for finding violations to safety properties in shared memory concurrent programs. Technically, BCS is a reachability…
Complexity of regular abstractions of one-counter languages
Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman +3
We study the computational and descriptional complexity of the following transformation: Given a one-counter automaton (OCA) A, construct a nondeterministic finite automaton (NFA)…