From coupling relations to mated invariants for checking information flow

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4189 LNCS, Issue , 2006, Pages 279-296

  Naumann, David A ^a  

^a STEVENS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); COMPUTER SYSTEMS PROGRAMMING; INFORMATION DISSEMINATION; INVARIANCE; OBJECT ORIENTED PROGRAMMING;

AUTOMATED PROGRAM VERIFIERS; INFORMATION FLOW; INVARIANTS;

DATA FLOW ANALYSIS;

EID: 33750232981     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11863908_18     Document Type: Conference Paper

References (32)

1. T. Amtoft, S. Bandhakavi, and A. Banerjee. A logic for information flow in object-oriented programs. In ACM Symposium on Principles of Programming Languages (POPL), 2006.
2. T. Amtoft and A. Banerjee. Information flow analysis in logical form. In Static Analysis Symposium (SAS), 2004.
3. A. Banerjee and D. A. Naumann. Ownership confinement ensures representation independence for object-oriented programs. Journal of the ACM, 52(6):894-960, Nov. 2005.
4. A. Banerjee and D. A. Naumann. Stack-based access control for secure information flow. Journal of Functional Programming, 15(2): 131-177, 2005.
5. A. Banerjee and D. A. Naumann. A logical account of secure declassification (extended abstract). Submitted, 2006.
6. M. Barnett, K. R. M. Leino, and W. Schulte. The Spec# programming system: An overview. In G. Barthe, L. Burdy, M. Huisman, J.-L. Lanet, and T. Muntean, editors, Construction and Analysis of Safe, Secure, and Interoperable Smart Devices, International Workshop (CASSIS 2004), Revised Selected Papers, volume 3362 of LNCS, pages 49-69. Springer, 2005.
7. G. Barthe, P. R. D'Argenio, and T. Rezk. Secure information flow by self-composition. In IEEE Computer Security Foundations Workshop (CSFW), pages 100-114, 2004.
8. G. Barthe and T. Rezk. Non-interference for a JVM-like language. In M. Fähndrich, editor, Proceedings of TLDI'05, pages 103-112. ACM Press, 2005.
9. N. Benton. Simple relational correctness proofs for static analyses and program transformations. In ACM Symposium on Principles of Programming Languages (POPL), pages 14-25, 2004.
10. E. S. Cohen. Information transmission in sequential programs. In A. K. J. Richard A. DeMillo, David P. Dobkin and R. J. Lipton, editors, Foundations of Secure Computation, pages 297-335. Academic Press, 1978.
11. A. Darvas, R. Hähnle, and D. Sands. A theorem proving approach to analysis of secure information flow. In D. Hutter and M. Ullmann, editors, Proc. 2nd International Conference on Security in Pervasive Computing, volume 3450 of LNCS, pages 193-209. Springer, 2005.
12. A. Darvas and P. Müller. Reasoning about method calls in JML specifications. In ECOOP workshop on Formal Techniques for Java-like Programs, 2005.
13. W.-P. de Roever and K. Engelhardt. Data Refinement: Model-Oriented Proof Methods and their Comparison. Cambridge University Press, 1998.
14. D. E. Denning. Cryptography and Data Security. Addison-Wesley, 1982.
15. G. Dufay, A. Felty, and S. Matwin. Privacy-sensitive information flow with JML. In Conference on Automated Deduction (CADE), 2005.
16. D. Gries. Data refinement and the tranform. In M. Broy, editor, Program Design Calculi. Springer, 1993. International Summer School at Marktoberdorf.
17. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In ACM Symposium on Principles of Programming Languages (POPL), pages 58-70, 2002.
18. B. Jacobs and E. Poll. Java program verification at Nijmegen: Developments and perspective. Technical Report NIII-R0318, Computing Science Institute, University of Nijmegen, 2003. In International Symposium on Software Security, volume 3233, of LNCS, pages 134-153. Springer, 2003.
19. G. T. Leavens, Y. Cheon, C. Clifton, C. Ruby, and D. R. Cok. How the design of JML accommodates both runtime assertion checking and formal verification. In F. S. de Boer, M. M. Bonsangue, S. Graf, and W.-P. de Roever, editors, Formal Methods for Components and Objects (FMCO 2002), volume 2852 of LNCS, pages 262-284. Springer, 2003.
20. P. Müller, A. Poetzsch-Heffter, and G. T. Leavens. Modular invariants for layered object structures. Technical Report 424, Department of Computer Science, ETH Zurich, 2004.
21. A. C. Myers. JFlow: Practical mostly-static information flow control. In ACM Symposium on Principles of Programming Languages (POPL), pages 228-241, 1999.
22. D. A. Naumann. Verifying a secure information flow analyzer. In J. Hurd and T. Melham, editors, 18th International Conference on Theorem Proving in Higher Order Logics TPHOLS, volume 3603 of LNCS pages 211-226. Springer, 2005.
23. D. A. Naumann and M. Barnett. Towards imperative modules: Reasoning about invariants and sharing of mutable state. To appear in Theoretical Computer Science, 2006.
24. F. Pottier and V. Simonet. Information flow inference for ML. ACM Transactions on Programming Languages and Systems, 25(1):117-158, Jan. 2003.
25. J.C.Reynolds. The Craft of Programming. Prentice-Hall, 1981.
26. J. C. Reynolds. Separation logic: a logic for shared mutable data structures. In IEEE Logic in Computer Science (LICS), pages 55-74, 2002.
27. A. Sabelfeld and A. C. Myers. Language-based information-flow security. IEEE J. Selected Areas in Communications, 21(1):5-19, Jan. 2003.
28. A. Sabelfeld and D. Sands. A per model of secure information flow in sequential programs. Higher-order and Symbolic Computation, 14(1):59-91, 2001.
29. A. Sabelfeld and D. Sands. Dimensions and principles of declassification. In IEEE Computer Security Foundations Workshop (CSFW), 2005.
30. T. Terauchi and A. Aiken. Secure information flow as a safety problem. In 12th International Static Analysis Symposium (SAS), volume 3672 of LNCS, pages 352-367. Springer, 2005.
31. D. Volpano and G. Smith. A type-based approach to program security. In Proceedings of TAPSOFT'97, volume 1214 in LNCS, pages 607-621. Springer, 1997.
32. H. Yang. Relational separation logic. Theoretical Comput. Sci., 2004. To appear.