Mainstream programming idioms intensively rely on state mutation, sharing, and concurrency. Designing type systems for handling and disciplining such idioms is challenging, due to long known conflicts between internal nondeterminism, linearity, and control effects such as exceptions. In this paper, we present the first type system that accommodates non-deterministic and abortable behaviors in t...

For a class L of languages let PDL[L] be an extension of Propositional Dynamic Logic which allows programs to be in a language of L rather than just to be regular. If L contains a non-regular language, PDL[L] can express non-regular properties, in contrast to pure PDL. For regular, visibly pushdown and deterministic context-free languages, the separation of the respective PDLs can be proven by ...

The parallel-functional language Eden has a non-deterministic construct, the process abstraction merge, which interleaves a set of input lists to produce a single non-deterministic list. Its non-deterministic behaviour is a consequence of its reactivity: it immediately copies to the output list any value appearing at any of the input lists. This feature is essential in reactive systems and very...

ion is always possible in the class of nondeterministic systems The more you abstract, the more non-determinism you generate Two remarks

Although Plotkin’s parallel-or is inherently deterministic, it has a non-deterministic interpretation in games based on (prime) event structures – in which an event has a unique causal history – because they do not directly support disjunctive causality. General event structures can express disjunctive causality and have a more permissive notion of determinism, but do not support hiding. We sho...

Reactive and real-time systems often require temporal and logical safety, concurrency and determinism. Several asynchronous and strong synchronous answers have been proposed to this problem. However , asynchronous languages such as CSP or CCS force the user to choose between determinism and concurrency, for they base concur-rency on asynchronous implementation models where processes non-determi...

End-to-end voting schemes have been researched significantly over the past two decades and aim to establish voter verifiable elections. Many of these schemes rely on non-deterministic inputs, such as the randomness used in encryption, for several tasks in the voting process. Karlof et al. show that the randomness in a scheme by Neff enables potential malicious subliminal channels. We revist the...