2 citations · 3 across the 7 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
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★ 1 cited
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…
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…