Towards a Hierarchy of Negative Test Operators for Generative Communication

n/

Adaptable processes

We propose the concept of adaptable processes as a way of overcoming the limitations that process calculi have for describing patterns of dynamic process evolution. Such patterns rely on direct ways of controlling the behavior and location of running processes, and so they are at the heart of the adaptation capabilities present in many modern concurrent systems. Adaptable processes have a location and are sensible to actions of dynamic update at runtime; this allows to express a wide range of evolvability patterns for concurrent processes. We introduce a core calculus of adaptable processes and propose two verification problems for them: bounded and eventual adaptation. While the former ensures that the number of consecutive erroneous states that can be traversed during a computation is bound by some given number k, the latter ensures that if the system enters into a state with errors then a state without errors will be eventually reached. We study the (un)decidability of these two problems in several variants of the calculus, which result from considering dynamic and static topologies of adaptable processes as well as different evolvability patterns. Rather than a specification language, our calculus intends to be a basis for investigating the fundamental properties of evolvable processes and for developing richer languages with evolvability capabilities

How “woke” became weaponized in the culture wars

The term “woke” has its roots in Black culture but has since been removed from this origin and been co-opted a symbol by those who push back against social justice progress. Staci M. Zavattaro writes that for policymakers and activists to affect change, it is important to understand how the social constructions of “woke” and Critical Race Theory, more specifically, have changed

On the Expressiveness of Movement in Pure Mobile Ambients

n/

Relating Session Types and Behavioural Contracts: The Asynchronous Case

We discuss the relationship between session types and behavioural contracts under the assumption that processes communicate asynchronously. We show the existence of a fully abstract interpretation of session types into a fragment of contracts, that maps session subtyping into binary compliance-preserving contract refinement. In this way, the recent undecidability result for asynchronous session subtyping can be used to obtain an original undecidability result for asynchronous contract refinement

On the Serializability of Transactions in JavaSpaces

n/