2 citations · 3 across the 7 of their papers we have counts for
7 papers
Logics for Context-free Hyperproperties
Dietrich Kuske, Sarah Winter, Martin Zimmermann
We introduce a novel logic for the specification of context-free hyperproperties, which capture, e.g., the flow of information in security-critical recursive systems. Intuitively,…
The Complexity of Asynchronous HyperLTL
Gaëtan Regaud, Martin Zimmermann
Hyperproperties express, e.g., information-flow properties of systems, which involves the simultaneous reasoning about multiple execution traces of a system. Consequently, HyperLTL…
The Complexity of Generalized HyperLTL with Stuttering and Contexts
Gaëtan Regaud, Martin Zimmermann
We settle the complexity of satisfiability and model-checking for generalized HyperLTL with stuttering and contexts, an expressive logic for the specification of asynchronous hyper…
The Complexity of Generalized HyperLTL with Stuttering and Contexts
Gaëtan Regaud, Martin Zimmermann
We settle the complexity of satisfiability, finite-state satisfiability, and model-checking for generalized HyperLTL with stuttering and contexts, an expressive logic for the speci…
The Complexity of Fragments of Second-Order HyperLTL
Gaëtan Regaud, Martin Zimmermann
We settle the complexity of satisfiability, finite-state satisfiability, and model-checking for several fragments of second-order HyperLTL, which extends HyperLTL with quantificati…
The Complexity of HyperQPTL
Gaëtan Regaud, Martin Zimmermann
HyperQPTL and HyperQPTL are expressive specification languages for hyperproperties, properties that relate multiple executions of a system. Tight complexity bounds are known fo…
The Complexity of Second-order HyperLTL
Hadar Frenkel, Gaëtan Regaud, Martin Zimmermann
We determine the complexity of second-order HyperLTL satisfiability, finite-state satisfiability, and model-checking: All three are equivalent to truth in third-order arithmetic. W…