A theorem proving approach to analysis of secure information flow

Lecture Notes in Computer Science

Volumn 3450, Issue , 2005, Pages 193-209

  Darvas, Ádám ^a   Hähnle, Reiner ^b   Sands, David ^b  

^a ETH ZURICH   (Switzerland)

^b CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); COMPUTATIONAL METHODS; COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER SOFTWARE; FORMAL LOGIC; JAVA PROGRAMMING LANGUAGE; SECURITY OF DATA; THEOREM PROVING;

DOMAIN-SPECIFIC LOGICS; INFORMATION FLOW; REAL PROGRAMMING LANGUAGES; SOFTWARE VERIFICATION;

INFORMATION RETRIEVAL;

EID: 24644445710     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-32004-3_20     Document Type: Conference Paper

References (19)

1. Ádám Darvas, R. Hähnle, and D. Sands, A theorem proving approach to analysis of secure information flow. Technical Report 2004-01, Department of Computing Science, Chalmers University of Technology and Göteborg University, 2004.
2. W. Ahrendt, T. Baar, B. Beckert, R. Bubel, M. Giese, R. Hähnle, W. Menzel, W. Mostowski, A. Roth, S. Schlager, and P. H. Schmitt. The KeY tool. Software and System Modeling, 2004. Online First issue, to appear in print.
3. G. Barthe, P. R. D'Argenio, and T. Rezk. Secure information flow by self-composition. In Proc. 17th IEEE Comp. Sec. Founds. Workshop, 2004.
4. B. Beckert. A dynamic logic for the formal verification of Java Card programs. In Java on Smart Cards: Programming and Security, pages 6-24, 2001.
5. B. Beckert and W. Mostowski. A program logic for handling Java Card's transaction mechanism. In Proc. FASE, pages 246-260, April 2003.
6. E. S. Cohen. Information transmission in sequential programs. In Foundations of Secure Computation, pages 297-335. Academic Press, 1978.
7. D. E. Denning and P. J. Denning. Certification of programs for secure information flow. Commun. ACM, 20(7):504-513, July 1977.
8. D. L. Detlefs, G. Nelson, and J. B. Saxe. A theorem prover for program checking. Research report 178, Compaq SRC, 2002.
9. R. Giacobazzi and I. Mastroeni. Proving abstract non-interference. In Conf. of the European Association for Computer Science Logic, pages 280-294, 2004.
10. D. Harel, D. Kozen, and J. Tiuryn. Dynamic Logic. MIT Press, 2000.
11. R. Joshi and K. R. M. Leino. A semantic approach to secure information flow. Science of Computer Programming, 37(1-3):113-138, 2000.
12. J. Jürjens. UMLsec: Extending UML for secure systems development. In Proc. U ML, pages 412-425, 2002.
13. A. C. Myers. JFlow: Practical mostly-static information flow control. In Proc. POPL, pages 228-241, Jan. 1999.
14. F. Pottier and V. Simonet. Information flow inference for ML. In Proc. POPL, pages 319-330, Jan. 2002.
15. F. Pottier and V. Simonet. Information flow inference for ML. ACM Trans. on Progr. Langs. and Systems, 25(1):117-158, Jan. 2003.
16. A. Sabelfeld and A. C. Myers. Language-based information-flow security. IEEE J. Selected Areas in Communication, 21(1), Jan. 2003.
17. A. Sabelfeld and D. Sands. A per model of secure information flow in sequential programs. Higher-Order and Symbolic Computation, 14(1):59-91, March 2001.
18. K. Stenzel. Verification of JavaCard programs. Technical report 2001-5, Institut für Informatik, Universität Augsburg, Germany, 2001.
19. D. Volpano and G. Smith. Eliminating covert flows with minimum typings. Proc. IEEE Comp. Sec. Founds. Workshop, pages 156-168, June 1997.