We address the model checking problem of omega-regular linear-time properties for shared memory concurrent programs modeled as multi-pushdown systems. We consider here boolean programs with a finiteâ€¦ (More)

We study the computational and descriptional complexity of the following transformation: Given a one-counter automaton (OCA) A, construct a nondeterministic finite automaton (NFA) B that recognizesâ€¦ (More)

Multipushdown systems (MPDS) are formal models of multi-threaded recursive programs. They are turing powerful and hence one considers underapproximation techniques in their analysis. We study the useâ€¦ (More)

This paper addresses the reachability problem for pushdown systems communicating via shared memory. It is already known that this problem is undecidable. It turns out that undecidability holds evenâ€¦ (More)

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 problem that isâ€¦ (More)

We study the size and the complexity of computing<lb>finite state automata (FSA) representing and approximating<lb>the downward and the upward closure of Petri net languages<lb>with coverability asâ€¦ (More)

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 with converse andâ€¦ (More)

We address the model checking problem for shared memory concurrent programs modeled as multi-pushdown systems. We consider here boolean programs with a finite number of threads and recursiveâ€¦ (More)

In this paper, we consider asynchronous programs consisting of multiple threads running in parallel. Each of the thread is equipped with a multi-set. The threads can create tasks and post them ontoâ€¦ (More)