A Theorem Proving Approach to Analysis of Secure Information Flow
- 1 January 2005
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Proving Abstract Non-interferencePublished by Springer Nature ,2004
- A Program Logic for Handling Java Card’s Transaction MechanismPublished by Springer Nature ,2003
- Information flow inference for MLACM Transactions on Programming Languages and Systems, 2003
- Eliminating covert flows with minimum typingsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Information flow inference for MLPublished by Association for Computing Machinery (ACM) ,2002
- A Per Model of Secure Information Flow in Sequential ProgramsHigher-Order and Symbolic Computation, 2001
- Dynamic LogicPublished by MIT Press ,2000
- A semantic approach to secure information flowScience of Computer Programming, 2000
- JFlowPublished by Association for Computing Machinery (ACM) ,1999
- Certification of programs for secure information flowCommunications of the ACM, 1977