Synthesis of opaque systems with static and dynamic masks
DOI10.1007/S10703-012-0141-9zbMath1247.68161OpenAlexW2001653139MaRDI QIDQ453510
Franck Cassez, Jérémy Dubreil, Hervé Marchand
Publication date: 27 September 2012
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-012-0141-9
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Borel determinacy
- A characterization of the minimum cycle mean in a digraph
- The complexity of mean payoff games on graphs
- Concurrent secrets
- Automated verification of selected equivalences for security protocols
- Test Generation for Network Security Rules
- Preserving Secrecy Under Refinement
- Dynamic Observers for the Synthesis of Opaque Systems
- On the synthesis of strategies in infinite games
- Supervisory Control for Opacity
- Characterizing intransitive noninterference for 3-domain security policies with observability
This page was built for publication: Synthesis of opaque systems with static and dynamic masks