Enforcing security and safety models with an information flow analysis tool
- 14 November 2004
- journal article
- conference paper
- Published by Association for Computing Machinery (ACM) in ACM SIGAda Ada Letters
- Vol. XXIV (4) , 39-46
- https://doi.org/10.1145/1046191.1032305
Abstract
Existing security models require that information of a given security level be prevented from ``leaking'' into lower-security information. High-security applications must be demonstrably free of such leaks, but such demonstration may require substantial manual analysis. Other authors have argued that the natural way to enforce these models automatically is with information-flow analysis, but have not shown this to be practicable for general purpose programming languages in current use. Modern safety-critical systems can contain software components with differing safety integrity levels, potentially operating in the same address space. This case poses problems similar to systems with differing security levels; failure to show separation of data may require the entire system to be validated at the higher integrity level. In this paper we show how the information flow model enforced by the SPARK Examiner provides support for enforcing these security and safety models. We describe an extension to the SPARK variable annotations which allows the specification of a security or safety level for each state variable, and an extension to the SPARK analysis which automatically enforces a given information flow policy on a SPARK program.Keywords
This publication has 5 references indexed in Scilit:
- Language-based information-flow securityIEEE Journal on Selected Areas in Communications, 2003
- Correctness by construction: developing a commercial secure systemIEEE Software, 2002
- Is proof more cost-effective than testing?IEEE Transactions on Software Engineering, 2000
- Information-flow and data-flow analysis of while-programsACM Transactions on Programming Languages and Systems, 1985
- On the security of public key protocolsIEEE Transactions on Information Theory, 1983