1. F. Baader, D.L. McGuinness, D. Nardi & P.F. Patel-Schneider (2003): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press.
  2. S. Gianvecchio & H. Wang (2007): Detecting Covert Timing Channels: An Entropy-Based Approach. In: Proceedings of the 14th ACM Conference on Computer and Communications Security, CCS '07. ACM, pp. 307–316, doi:10.1145/1315245.1315284.
  3. J. Giles & B. Hajek (2002): An Information-Theoretic and Game-Theoretic Study of Timing Channels. IEEE Transactions on Information Theory 48(9), pp. 2455–2477, doi:10.1109/TIT.2002.801405.
  4. J.R. Giles & B. Hajek (1999): The Jamming Game for Timing Channels. In: Proceedings of the 1999 Information Theory and Networking Workshop, pp. 35, doi:10.1109/ITNW.1999.814345.
  5. J.W. Gray III (1991): Toward a Mathematical Foundation for Information Flow Security. In: Proceedings of the 1991 IEEE Computer Society Symposium on Research in Security and Privacy, pp. 21–34, doi:10.1109/RISP.1991.130769.
  6. U. Hebisch & H.J. Weinert (1993): Semirings: Algebraic Theory and Applications in Computer Science. Series in Algebra 5. World Scientific.
  7. L. Hélouët & A. Roumy (2010): Covert Channel Detection Using Information Theory. In: K. Chatzikokolakis & V. Cortier: Proceedings of 8th International Workshop on Security Issues in Concurrency, SecCo 2010, pp. 34–51, doi:10.4204/EPTCS.51.3.
  8. C.A.R. Hoare, B. Möller, G. Struth & I. Wehrman (2009): Concurrent Kleene Algebra. In: M. Bravetti & G. Zavattaro: Proceedings of the 20th International Conference on Concurrency Theory, LNCS 5710. Springer Berlin / Heidelberg, pp. 399–414, doi:10.1007/978-3-642-04081-8_27.
  9. C.A.R. Hoare, B. Möller, G. Struth & I. Wehrman (2009): Foundations of Concurrent Kleene Algebra. In: R. Berghammer, A. Jaoua & B. Möller: Relations and Kleene Algebra in Computer Science, LNCS 5827. Springer Berlin / Heidelberg, pp. 166–186, doi:10.1007/978-3-642-04639-1_12.
  10. C.A.R. Hoare, B. Möller, G. Struth & I. Wehrman (2010): Concurrent Kleene Algebra and its Foundations. Technical Report CS-10-04. University of Sheffield, Department of Computer Science, Sheffield, UK. Available:
  11. C.A.R. Hoare, B. Möller, G. Struth & I. Wehrman (2011): Concurrent Kleene Algebra and its Foundations. Journal of Logic and Algebraic Programming 80(6), pp. 266 – 296, doi:10.1016/j.jlap.2011.04.005.
  12. J. Jaskolka (2010): Modeling, Analysis, and Detection of Information Leakage via Protocol-Based Covert Channels. McMaster University, Hamilton, ON, Canada.
  13. J. Jaskolka & R. Khedri (2011): Exploring Covert Channels. In: Proceedings of the 44th Hawaii International Conference on System Sciences, HICSS-44, pp. 1–10, doi:10.1109/HICSS.2011.201.
  14. J. Jaskolka, R. Khedri & K.E. Sabri (2011): A Formal Test for Detecting Information Leakage via Covert Channels. In: Proceedings of the 7th Annual Cyber Security and Information Intelligence Research Workshop, CSIIRW7, pp. 1–4, doi:10.1145/2179298.2179343.
  15. J. Jaskolka, R. Khedri & Q. Zhang (2012): On the Necessary Conditions for Covert Channel Existence: A State-of-the-Art Survey. Procedia Computer Science 10, pp. 458 – 465, doi:10.1016/j.procs.2012.06.059.
  16. J. Jaskolka, R. Khedri & Q. Zhang (2013): Foundations of Communicating Concurrent Kleene Algebra. Technical Report CAS-13-07-RK. McMaster University, Hamilton, ON, Canada. Available:
  17. J. Jaskolka, R. Khedri & Q. Zhang (2014): Endowing Concurrent Kleene Algebra with Communication Actions. In: P. Höfner, P. Jipsen, W. Kahl & M.E. Müller: Proceedings of the 14th International Conference on Relational and Algebraic Methods in Computer Science, LNCS 8428. Springer International Publishing Switzerland, pp. 19–36, doi:10.1007/978-3-319-06251-8_2.
  18. D. Johnson, P. Lutz & B. Yuan (2010): Behavior-Based Covert Channel in Cyberspace. In: Proceedings of the 4th International ISKE Conference on Intelligent Decision Making Systems, pp. 311–318, doi:10.1142/9789814295062_0049.
  19. M.H. Kang & I.S. Moskowitz (1993): A Pump for Rapid, Reliable, Secure Communication. In: Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 119–129, doi:10.1145/168588.168604.
  20. R.A. Kemmerer (1983): Shared Resource Matrix Methodology: An Approach to Identifying Storage and Timing Channels. ACM Transactions on Computer Systems 1(3), pp. 256–277, doi:10.1145/357369.357374.
  21. R.A. Kemmerer & P.A. Porras (1991): Covert Flow Trees: A Visual Approach to Analyzing Covert Storage Channels. IEEE Transactions on Software Engineering 17(11), pp. 1166–1185, doi:10.1109/32.106972.
  22. M. Kilp, U. Knauer & A.V. Mikhalev (2000): Monoids, Acts And Categories With Applications to Wreath Products and Graphs: A Handbook for Students and Researchers. De Gruyter Expositions in Mathematics Series 29. Walter de Gruyter, doi:10.1515/9783110812909.
  23. G. Lowe (2002): Quantifying Information Flow. In: Proceedings of the 15th IEEE Computer Security Foundations Workshop, CSFW-15. IEEE Computer Society, pp. 18–31, doi:10.1109/CSFW.2002.1021804.
  24. K. Martin, I.S. Moskowitz & G. Allwein (2006): Algebraic Information Theory For Binary Channels. Electronic Notes in Theoretical Computer Science 158, pp. 289–306, doi:10.1016/j.entcs.2006.04.015.
  25. J.K. Millen (1987): Covert Channel Capacity. In: Proceedings of the 1987 Symposium on Security and Privacy, pp. 60–66.
  26. J.K. Millen (1989): Finite-State Noiseless Covert Channels. In: Proceedings of the Computer Security Foundations Workshop II, pp. 81–86, doi:10.1109/CSFW.1989.40590.
  27. R. Milner (1989): Communication and Concurrency. Prentice-Hall International Series in Computer Science. Prentice Hall.
  28. I.S. Moskowitz & M.H. Kang (1994): Covert Channels - Here to Stay?. In: Computer Assurance, COMPASS '94 Safety, Reliability, Fault Tolerance, Concurrency and Real Time, Security, pp. 235–243, doi:10.1109/CMPASS.1994.318449.
  29. K.E. Sabri, R. Khedri & J. Jaskolka (2009): Verification of Information Flow in Agent-Based Systems. In: G. Babin, P. Kropf & M. Weiss: Proceedings of the 4th International MCETECH Conference on e-Technologies, LNBIP 26. Springer Berlin / Heidelberg, pp. 252–266, doi:10.1007/978-3-642-01187-0_22.
  30. S. Shieh & A.L.P. Chen (1999): Estimating and Measuring Covert Channel Bandwidth in Multilevel Secure Operating Systems. Journal of Information Science and Engineering 15(1), pp. 91–106.
  31. U.S.A. Department of Defense (1985): Trusted Computer System Evaluation Criteria (TCSEC). Defense Department Rainbow Series (Orange Book) DoD 5200.28-STD. Department of Defense / National Computer Security Center, Fort George G. Meade, MD, USA.
  32. U.S.A. Department of Homeland Security (2009): A Roadmap for Cybersecurity Research. Department of Homeland Security Science and Technology Directorate, Washington, DC, USA.
  33. Z. Wang & R.B. Lee (2005): New Constructive Approach to Covert Channel Modeling and Channel Capacity Estimation. In: J. Zhou, J. Lopez, R.H. Deng & F. Bao: Proceedings of 8th International Conference on Information Security, LNCS 3650. Springer Berlin / Heidelberg, pp. 498–505, doi:10.1007/11556992_37.

Comments and questions to:
For website issues: