Finite-word hyperlanguages

DOI10.1016/J.IC.2022.104944MaRDI QIDQ6186311zbMATH OpenOpenAlexFDO

Authors Borzoo Bonakdarpour, Sarai Sheinvald

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

• scientific article; zbMATH DE number 1048047 (Why is no real title available?)
• A temporal logic for asynchronous hyperproperties
• Automata-theoretic techniques for modal logics of programs
• Bounded model checking for hyperproperties
• Compositional model checking for multi-properties
• Defining liveness
• Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words
• HyperPCTL: A Temporal Logic for Probabilistic Hyperproperties
• Monitoring hyperproperties
• Noninterference for concurrent programs and thread systems
• Program Repair for Hyperproperties
• Reasoning about infinite computations
• Rewriting-based runtime verification for alternation-free HyperLTL
• Synthesizing reactive systems from hyperproperties
• “Sometimes” and “not never” revisited

This page was built for publication: Finite-word hyperlanguages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6186311)