Log In Sign Up

Automata and Fixpoints for Asynchronous Hyperproperties

by   Jens Oliver Gutsfeld, et al.

Hyperproperties have received increasing attention in the last decade due to their importance e.g. for security analyses. Past approaches have focussed on synchronous analyses, i.e. techniques in which different paths are compared lockstepwise. In this paper, we systematically study asynchronous analyses for hyperproperties by introducing both a novel automata model (Alternating Asynchronous Parity Automata) and the temporal fixpoint calculus , the first fixpoint calculus that can systematically express hyperproperties in an asynchronous manner and at the same time subsumes the existing logic HyperLTL. We show that the expressive power of both models coincides over fixed path assignments. The high expressive power of both models is evidenced by the fact that decision problems of interest are highly undecidable, i.e. not even arithmetical. As a remedy, we propose approximative analyses for both models that also induce natural decidable fragments.


Distributed Automata and Logic

Distributed automata are finite-state machines that operate on finite di...

On the Validity of Encodings of the Synchronous in the Asynchronous π-calculus

Process calculi may be compared in their expressive power by means of en...

Asynchronous Sessions with Input Races

We propose a calculus for asynchronous multiparty sessions where input c...

Temporal Team Semantics Revisited

In this paper, we study a novel approach to asynchronous hyperproperties...

Countdown μ-calculus

We introduce the countdown μ-calculus, an extension of the modal μ-calcu...

Scalar and Vectorial mu-calculus with Atoms

We study an extension of modal mu-calculus to sets with atoms and we stu...

Verifying Asynchronous Interactions via Communicating Session Automata

The relationship between communicating automata and session types is the...