Information flow in systems with schedulers. II: Refinement

DOI10.1016/j.tcs.2013.01.002zbMath1292.68037OpenAlexW2130436861MaRDI QIDQ383362

Ron van der Meyden, Chenyi Zhang

Publication date: 4 December 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.01.002

zbMATH Keywords

information flow securitysynchronous systems with schedulers

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• FDR2

Cites Work

• Prespecification in data refinement
• A single complete rule for data refinement
• Information flow in systems with schedulers. I: Definitions
• A Proof System for Information Flow Security
• The Complexity of Synchronous Notions of Information Flow Security
• Preserving Secrecy Under Refinement
• Bisimulation for Demonic Schedulers
• The Shadow Knows: Refinement of Ignorance in Sequential Programs
• Data Refinement
• Action Refinement in Process Algebra and Security Issues
• Refinement of actions and equivalence notions for concurrent systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item