The uniied theory of concurrency control and recovery integrates atomicity and isolation within a common framework, thereby avoiding many of the shortcomings resulting from treating them as orthogonal problems. This theory can be applied to the traditional read/write model as well as to semantically rich operations. In this paper, we extend the uniied theory by applying it to generalized proces...

This essay offers an overview of basic aspects and central development in Concurrency Theory based on formal languages. In particular, it focuses on the theory of Process Calculi.

This paper presents indispensable technical results of a general theory that will allow to systematically derive from a given reduction system a behavioral congruence that respects concurrency. The theory is developed in the setting of adhesive categories and is based on the work by Ehrig and König on borrowed contexts; the latter are an instance of relative pushouts, which have been proposed b...

System call interposition allows the kernel security model to be extended. However, when combined with current operating systems, it is open to concurrency vulnerabilities leading to privilege escalation and audit bypass. We discuss the theory and practice of system call wrapper concurrency vulnerabilities, and demonstrate exploit techniques against GSWTK, Systrace, and CerbNG.

We show that three fixed point structures equipped with (sequential) composition, a sum operation, and a fixed point operation share the same valid equations. These are the theories of (context-free) languages, (regular) tree languages, and simulation equivalence classes of (regular) synchronization trees (or processes). The results reveal a close relationship between classical language theory ...

This tutorial provides an overview of the process algebra ACP.

In this paper we address the problem of understanding Concurrency Theory from a combinatorial point view. We are interested in quantitative results and algorithmic tools to refine our classical explosion phenomenon arising concurrency. This is essentially focusing on notion synchronization view combinatorics. As first step, counting number executions simple processes interacting with barriers. ...

Coordinating distributed executions is achieved by two widely used approaches: process groups and transactions. Typically, the two represent a trade-oo in terms of the degrees of consistency and performance. By applying transaction concurrency control techniques to characterize and design process group multicast orderings, we aim to provide aspects of both ends of the trade-oo. In particular, w...

Inmodern computers (or computer networks), calculations are typically no longer perfomed sequentially (one step at a time) but in cooperation between several processors doing parts of the job in parallel. Through concurrency, one aims to save time and memory. To do so, the proper scheduling of processors is a crucial task. Some of the issues involved are to make sure that the calculation does n...