Mitigating covert channels based on analysis of the potential for communication

DOI10.1016/j.tcs.2016.06.022zbMath1348.68164OpenAlexW2470754857MaRDI QIDQ530557

Jason Jaskolka, Ridha Khedri

Publication date: 1 August 2016

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

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

zbMATH Keywords

formal verificationformal methodscommunicating concurrent Kleene algebracovert channelsinformation confidentialitypotential for communication

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• RelView
• Maude

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Concurrent Kleene algebra and its foundations
• A theory of transformation monoids: combinatorics and representation theory
• Modeling concurrency with partial orders
• A calculus of communicating systems
• A calculus of mobile processes. I
• Computing transformation semigroups
• Monoids, acts and categories. With applications to wreath products and graphs. A handbook for students and researchers
• Concurrent Kleene Algebra
• Foundations of Concurrent Kleene Algebra
• Process algebra for synchronous communication
• “Sometimes” and “not never” revisited
• Guarded commands, nondeterminacy and formal derivation of programs
• Formal verification of parallel programs
• Some Properties of Predicate Transformers
• Communicating sequential processes
• An information-theoretic and game-theoretic study of timing channels
• Developments in Concurrent Kleene Algebra
• Endowing Concurrent Kleene Algebra with Communication Actions
• Information Security