Finite-word hyperlanguages

DOI10.1016/J.IC.2022.104944OpenAlexW4289745775MaRDI QIDQ6186311FDOQ6186311

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

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

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)