Two new logics for verification of hyperproperties are proposed. Hyperproperties
characterize security policies, such as noninterference, as a property of sets of computation …

We present an automata-based algorithm for checking finite state systems for
hyperproperties specified in HyperLTL and HyperCTL^*. For the alternation-free fragments …

HyperLTL is an extension of linear-time temporal logic for the specification of
hyperproperties, ie, temporal properties that relate multiple computation traces. HyperLTL …

We address the problem of program verification for information flow policies by means of
symbolic execution and model checking. Noninterference-like security policies are …

We present a generic partition refinement algorithm that quotients coalgebraic systems by
behavioural equivalence, an important task in reactive verification; coalgebraic generality …

Hyperproperties generalize trace properties by expressing relations between multiple
computations. Hyperpropertes include policies from information-flow security, like …

Cyber-physical systems are processing large amounts of sensitive information, but are
increasingly often becoming the target of cyber attacks. Thus, it is essential to verify the …

We focus on the control and the synthesis of secure timed systems which are modelled as
timed automata. The security property that the system must satisfy is a non-interference …

We present a generic partition refinement algorithm that quotients coalgebraic systems by
behavioural equivalence, an important task in system analysis and verification. Coalgebraic …

We present a new method for model-based mutation-driven test case generation. Mutants
are generated by making small syntactical modifications to the model or source code of the …