Finite-word hyperlanguages

DOI10.1016/j.ic.2022.104944OpenAlexW4289745775MaRDI QIDQ6186311

Sarai Sheinvald, Borzoo Bonakdarpour

Publication date: 2 February 2024

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2022.104944

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• A temporal logic for asynchronous hyperproperties
• Defining liveness
• Automata-theoretic techniques for modal logics of programs
• Reasoning about infinite computations
• Noninterference for concurrent programs and thread systems
• Monitoring hyperproperties
• Bounded model checking for hyperproperties
• Compositional model checking for multi-properties
• Program Repair for Hyperproperties
• Rewriting-Based Runtime Verification for Alternation-Free HyperLTL
• “Sometimes” and “not never” revisited
• Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words
• Synthesizing reactive systems from hyperproperties
• HyperPCTL: A Temporal Logic for Probabilistic Hyperproperties

This page was built for publication: Finite-word hyperlanguages