Finite-word hyperlanguages

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

Authors: 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)

Cites Work

• “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
• Algorithms for model checking HyperLTL and HyperCTL\(^*\)
• Title not available (Why is that?)
• HyperPCTL: A Temporal Logic for Probabilistic Hyperproperties
• Verifying hyperliveness

Cited In (7)

• Finite language forbidding-enforcing systems
• Compositional model checking for multi-properties
• LANGUAGES WITH A FINITE ANTIDICTIONARY: SOME GROWTH QUESTIONS
• Deciding hyperproperties combined with functional specifications
• Realizable and context-free hyperlanguages
• Title not available (Why is that?)
• Second-order hyperproperties

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 Q2232276)