We consider the class of finite-state programs executed by an unbounded number of
replicated threads communicating via shared variables. The thread-state reachability …

We define a new class of languages defined by multi-stack automata that forms a robust
subclass of context-sensitive languages, with decidable emptiness and closure under …

Context-bounded analysis has been shown to be both efficient and effective at finding bugs
in concurrent programs. According to its original definition, context-bounded analysis …

In order to make multithreaded programming manageable, programmers often follow a
design principle where they break the problem into tasks which are then solved …

Abstract Analysis of recursive programs in the presence of concurrency and shared memory
is undecidable. In previous work, Qadeer and Rehof [23] showed that context-bounded …

We propose a general formal model of isolated hierarchical parallel computations, and
identify several fragments to match the concurrency constructs present in real-world …

We show the diagonal problem for higher-order pushdown automata (HOPDA), and hence
the simultaneous unboundedness problem, is decidable. From recent work by Zetzsche this …

We introduce asynchronous dynamic pushdown networks (ADPN), a new model for
multithreaded programs in which pushdown systems communicate via shared memory …

We present a new algorithm for checking probabilistic noninterference in concurrent
programs. The algorithm, named RLSOD, is based on the Low-Security Observational …

We propose a general analysis method for recursive, concurrent programs that track
effectively procedure calls and return in a concurrent context, even in the presence of …