Reasoning About Information Flow Security of Separation Kernels with Channel-based Communication

October 17, 2015 Β· Declared Dead Β· πŸ› International Conference on Tools and Algorithms for Construction and Analysis of Systems

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Yongwang Zhao, David Sann, Fuyuan Zhang, Yang Liu arXiv ID 1510.05091 Category cs.SE: Software Engineering Cross-listed cs.CR Citations 18 Venue International Conference on Tools and Algorithms for Construction and Analysis of Systems Last Checked 4 months ago
Abstract
Assurance of information flow security by formal methods is mandated in security certification of separation kernels. As an industrial standard for separation kernels, ARINC 653 has been complied with by mainstream separation kernels. Security of functionalities defined in ARINC 653 is thus very important for the development and certification of separation kernels. This paper presents the first effort to formally specify and verify separation kernels with ARINC 653 channel-based communication. We provide a reusable formal specification and security proofs for separation kernels in Isabelle/HOL. During reasoning about information flow security, we find some security flaws in the ARINC 653 standard, which can cause information leakage, and fix them in our specification. We also validate the existence of the security flaws in two open-source ARINC 653 compliant separation kernels.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Software Engineering

Died the same way β€” πŸ‘» Ghosted