Pith. Sign in

RECORD

Prophecies all the Way: Game-based Model-Checking for HyperQPTL beyond $\forall^*\exists^*$

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Sarah Winter, Martin Zimmermann

Logic in Computer Science · Submitted 11 Apr 2025

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim Here, we employ imperfect information-games to extend the game-based approach to full HyperQPTL, which features arbitrary quantifier prefixes and quantification over propositions and can express every $\omega$-regular hyperproperty.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2504.08575 (version 4)
Pith IDKRRRTXRR, Pith's permanent record of this paper and its review
CitationMartin Zimmermann, Sarah Winter. "Prophecies all the Way: Game-based Model-Checking for HyperQPTL beyond $\forall^*\exists^*$." arXiv:2504.08575 (2025). https://pith.science/paper/KRRRTXRR
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 3,777 input tokens.

What the abstract itself states, as probabilities: claims first 0.14 · states limitation 0.13 · human participants 0.02 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.21 · compares with prior results 0.89 · mentions code or data availability 0.04.

The abstract, sentence by sentence

arXiv listing abstract v4. Results and the main claim are underlined; .

Model-checking HyperLTL, a temporal logic expressing properties of sets of traces with applications to information-flow based security and privacy, has a decidable, but TOWER-complete, model-checking problem. While the classical model-checking algorithm for full HyperLTL is automata-theoretic, more recently, a game-based alternative for the $\forall^*\exists^*$-fragment has been presented. Here, we employ imperfect information-games to extend the game-based approach to full HyperQPTL, which features arbitrary quantifier prefixes and quantification over propositions and can express every $\omega$-regular hyperproperty. As a byproduct of our game-based algorithm, we obtain finite-state implementations of Skolem functions via transducers with lookahead that explain satisfaction or violation of HyperQPTL properties.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Model-checking HyperLTL, a temporal logic expressing properties of sets of traces with applications to information-flow based security and privacy, has a decidable, but TOWER-complete, model-checking problem. background 1.00 0.05 0.04 asserted 1.00
s1 While the classical model-checking algorithm for full HyperLTL is automata-theoretic, more recently, a game-based alternative for the $\forall^*\exists^*$-fragment has been presented. background 0.99 0.05 0.04 asserted 1.00
s2 Here, we employ imperfect information-games to extend the game-based approach to full HyperQPTL, which features arbitrary quantifier prefixes and quantification over propositions and can express every $\omega$-regular hyperproperty. contribution 0.89 0.94 0.70 asserted 1.00
s3 As a byproduct of our game-based algorithm, we obtain finite-state implementations of Skolem functions via transducers with lookahead that explain satisfaction or violation of HyperQPTL properties. result 0.85 0.94 0.18 asserted 1.00

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from proof or derivation 0.97.

What was examined, and what was not

sources read
  • arXiv listing abstract v4
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

Model-checking HyperLTL, a temporal logic expressing properties of sets of traces with applications to information-flow based security and privacy, has a decidable, but TOWER-complete, model-checking problem. While the classical model-checking algorithm for full HyperLTL is automata-theoretic, more recently, a game-based alternative for the $\forall^*\exists^*$-fragment has been presented. Here, we employ imperfect information-games to extend the game-based approach to full HyperQPTL, which features arbitrary quantifier prefixes and quantification over propositions and can express every $\omega$-regular hyperproperty. As a byproduct of our game-based algorithm, we obtain finite-state implementations of Skolem functions via transducers with lookahead that explain satisfaction or violation of HyperQPTL properties.

Human review

How Pith checks papers → · Full audit of this paper →

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.