3 papers
cs.LO2025
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…
cs.LO2025
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…
cs.LO2024
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…