We develop a novel model for studying agent-environment systems, where the agents are
implemented via feed-forward ReLU neural networks. We provide a semantics and develop …

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 …

We show that the bounded context-switching reachability problem for concurrent finite
systems communicating using unbounded FIFO queues is decidable, where in each context …

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 an approach for reducing the TSO reachability analysis of concurrent programs
to their SC reachability analysis, under some conditions on the explored behaviors. First, we …

We study algorithmic questions for concurrent systems where the transitions are labeled
from a complete, closed semiring, and path properties are algebraic with semiring …

The composition of molybdate-based conversion coatings on zinc–nickel alloy
electrodeposits was examined by extended X-ray absorption fine structure (EXAFS). The …

We address the reachability problem in acyclic networks of pushdown systems. We consider
communication based either on shared memory or on message passing through unbounded …