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

We study the reactive synthesis problem for hyperproperties given as formulas of the
temporal logic HyperLTL. Hyperproperties generalize trace properties, ie, sets of traces, to …

Hyperproperties are properties that describe the correctness of a system as a relation
between multiple executions. Hyperproperties generalize trace properties and include …

Hyperproperties are increasingly popular in verifying security policies and synthesis of
control for dynamic systems. Hyperproperties generalize trace properties to enable …

Verifying hyperproperties at runtime is a challenging problem as hyperproperties, such as
non-interference and observational determinism, relate multiple computation traces with …

Hyperproperties are commonly used in computer security to define information-flow policies
and other requirements that reason about the relationship between multiple computations. In …

Hyperproperties are system properties that relate multiple computation paths in a system
and are commonly used to, eg, define information-flow policies. In this paper, we study a …

Dependency quantified Boolean formulas (DQBF) is a logic admitting existential
quantification over Boolean functions, which allows us to elegantly state synthesis problems …

Smart contracts are small but highly security-critical programs that implement wallets, token
systems, auctions, crowd funding systems, elections, and other multi-party transactions on …

We present a detailed description, analysis, and evaluation of the clausal abstraction
approach for solving quantified Boolean formulas (QBF). The clausal abstraction algorithm …