Hoare logics are proof systems that allow one to formally establish properties of computer
programs. Traditional Hoare logics prove properties of individual program executions (such …

Temporal hyperproperties are system properties that relate multiple execution traces. For
(finite-state) hardware, temporal hyperproperties are supported by model checking …

HyperLTL is a temporal logic that can express hyperproperties, ie, properties that relate
multiple execution traces of a system. Such properties are becoming increasingly important …

In recent years they have been numerous works that aim to automate relational verification.
Meanwhile, although Constrained Horn Clauses (CHCs CHCs) empower a wide range of …

We introduce Hyper2LTL, a temporal logic for the specification of hyperproperties that allows
for second-order quantification over sets of traces. Unlike first-order temporal logics for …

Hyperproperties are properties of computational systems that require more than one trace to
evaluate, eg, many information-flow security and concurrency requirements. Where a trace …

Hyperproperties relate multiple executions of a program and are commonly used to specify
security and information-flow policies. Most existing work has focused on the verification of k …

This paper introduces a bounded model checking (BMC) algorithm for hyperproperties
expressed in HyperLTL, which—to the best of our knowledge—is the first such algorithm …

Hyperproperties relate multiple executions of a program and are useful to express common
correctness properties (such as determinism) and security properties (such as non …

Temporal logics for hyperproperties like HyperLTL use trace quantifiers to express
properties that relate multiple system runs. In practice, the verification of such specifications …