Finite-word hyperlanguages

DOI10.1007/978-3-030-68195-1_17OpenAlexW3132613396MaRDI QIDQ2232276

Borzoo Bonakdarpour, Sarai Sheinvald

Publication date: 4 October 2021

Full work available at URL: https://arxiv.org/abs/2201.01670

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Unnamed Item ⋮ Compositional model checking for multi-properties

Cites Work

• Unnamed Item
• Defining liveness
• Automata-theoretic techniques for modal logics of programs
• Reasoning about infinite computations
• Noninterference for concurrent programs and thread systems
• Algorithms for model checking HyperLTL and HyperCTL\(^*\)
• “Sometimes” and “not never” revisited
• HyperPCTL: A Temporal Logic for Probabilistic Hyperproperties
• Verifying hyperliveness

This page was built for publication: Finite-word hyperlanguages