Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions
Abstract elided by the publisher.
Related papers
- "Sometimes" and "Not Never" Revisited: On Branching Versus Linear Time POPL 1983
- Verifying Asynchronous Hyperproperties in Reactive Systems OOPSLA 2025
- A constraint-based approach to solving games on infinite graphs POPL 2014
- Measurement-Based Verification of Quantum Markov Chains CAV 2024
- Coinductive Proofs for Temporal Hyperliveness POPL 2025
- Specification and Efficient Monitoring Beyond STL TACAS 2019
- Software Verification of Hyperproperties Beyond k-Safety CAV 2022
- On Expansion and Resolution in CEGAR Based QBF Solving CAV 2017