Information flow analysis in logical form

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

Volumn 3148, Issue , 2004, Pages 100-115

  Amtoft, Torben ^a   Banerjee, Anindya ^a  

^a Sunflower Networking Group   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RECONFIGURABLE HARDWARE; STATIC ANALYSIS;

ABSTRACT INTERPRETATIONS; IMPERATIVE LANGUAGES; INFORMATION FLOW ANALYSIS; LOGICAL FORMS; PROGRAM VARIABLES; STATIC CHECKING; STRONGEST POSTCONDITIONS; THEOREM PROVERS;

COMPUTER CIRCUITS;

EID: 35048839749     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27864-1_10     Document Type: Article

References (29)

1. Martín Abadi, Anindya Banerjee, Nevin Heintze, and Jon G. Riecke. A core calculus of dependency. In ACM Symposium on Principles of Programming Languages (POPL), pages 147-160, 1999.
2. Torben Amtoft and Anindya Banerjee. Information flow analysis in logical form. Technical Report CIS TR 2004-3, Kansas State University, April 2004.
3. G. R. Andrews and R. P. Reitman. An axiomatic approach to information flow in programs. ACM Transactions on Programming Languages and Systems, 2(1):56-75, January 1980.
4. Anindya Banerjee and David A. Naumann. Secure information flow and pointer confinement in a Java-like language. In IEEE Computer Security Foundations Workshop (CSFW), pages 253-270. IEEE Computer Society Press, 2002.
5. Gilles Barthe, Pedro R. D'Argenio, and Tamara Rezk. Secure information flow by self-composition. In IEEE Computer Security Foundations Workshop (CSFW), 2004. To appear.
6. David Clark, Chris Hankin, and Sebastian Hunt. Information flow for Algol-like languages. Computer Languages, 28(1):3-28, 2002.
7. Ellis S. Cohen. Information transmission in sequential programs. In Richard A. DeMillo, David P. Dobkin, Anita K. Jones, and Richard J. Lipton, editors, Foundations of Secure Computation, pages 297-335. Academic Press, 1978.
8. Patrick Cousot and Radhia Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In ACM Symposium on Principles of Programming Languages (POPL), pages 238-252. ACM Press, New York, NY, 1977.
9. Patrick Cousot and Radhia Cousot. Automatic synthesis of optimal invariant assertions: mathematical foundations. In Proceedings of the ACM Symposium on Artificial Intelligence and Programming Languages, SIGPLAN Notices, volume 12, pages 1-12. ACM Press, August 1977.
10. Ádám Darvas, Reiner Hähnle, and Dave Sands. A theorem proving approach to analysis of secure information flow. Technical Report 2004-01, Department of Computing Science, Chalmers University of Technology and Goteborg University, 2004. A fuller version of a paper appearing in Workshop on Issues in the Theory of Security, 2003.
11. Dorothy Denning and Peter Denning. Certification of programs for secure information flow. Communications of the ACM, 20(7):504-513, 1977.
12. Roberto Giacobazzi and Isabella Mastroeni. Abstract non-interference: Parameterizing non-interference by abstract interpretation. In ACM Symposium on Principles of Programming Languages (POPL), pages 186-197, 2004.
13. J. Goguen and J. Meseguer. Security policies and security models. In Proc. IEEE Symp. on Security and Privacy, pages 11-20, 1982.
14. Nevin Heintze and Jon G. Riecke. The SLam calculus: programming with secrecy and integrity. In ACM Symposium on Principles of Programming Languages (POPL), pages 365-377, 1998.
15. Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, and Gregoire Sutre. Software verification with Blast. In Tenth International Workshop on Model Checking of Software (SPIN), volume 2648 of Lecture Notes in Computer Science, pages 235-239. Springer-Verlag, 2003.
16. Sebastian Hunt and David Sands. Binding time analysis: A new PERspective. In Partial Evaluation and Semantics-Based Program Manipulation (PEPM '91), volume 26 (9) of Sigplan Notices, pages 154-165, 1991.
17. Samin Ishtiaq and Peter W. O'Hearn. BI as an assertion language for mutable data structures. In ACM Symposium on Principles of Programming Languages (POPL), pages 14-26, 2001.
18. Rajeev Joshi and K. Rustan M. Leino. A semantic approach to secure information flow. Science of Computer Programming, 37:113-138, 2000.
19. Daryl McCullough. Specifications for multi-level security and a hook-up. In IEEE Symposium on Security and Privacy, April 27-29, 1987, pages 161-166, 1987.
20. Flemming Nielson, Hanne Riis Nielson, and Chris Hankin. Principles of Program Analysis. Springer-Verlag, 1999. Web page at www.imm.dtu.dk/riis/PPA/ ppa.html.
21. Peter O'Hearn, John Reynolds, and Hongseok Yang. Local reasoning about programs that alter data structures. In Computer Science Logic, volume 2142 of LNCS, pages 1-19. Springer, 2001.
22. Peter O'Hearn, Hongseok Yang, and John Reynolds. Separation and information hiding. In ACM Symposium on Principles of Programming Languages (POPL), pages 268-280, 2004.
23. Peter Ørbæk and Jens Palsberg. Trust in the λ-calculus. Journal of Functional Programming, 7(6):557-591, November 1997.
24. François Pottier and Vincent Simonet. Information flow inference for ML. ACM Transactions on Programming Languages and Systems, 25(1):117-158, January 2003.
25. John C. Reynolds. Separation logic: a logic for shared mutable data structures. In IEEE Symposium on Logic in Computer Science (LICS), pages 55-74. IEEE Computer Society Press, 2002.
26. Andrei Sabelfeld and Andrew Myers. A model for delimited information release. In Proceedings of the International Symposium on Software Security (ISSS'03), 2004. To appear.
27. Andrei Sabelfeld and Andrew C. Myers. Language-based information-flow security. IEEE J. Selected Areas in Communications, 21(1):5-19, January 2003.
28. Andrei Sabelfeld and David Sands. A Per model of secure information flow in sequential programs. Higher-order and Symbolic Computation, 14(1):59-91, 2001.
29. Dennis Volpano and Geoffrey Smith. A type-based approach to program security. In Proceedings of TAPSOFT'97, number 1214 in Lecture Notes in Computer Science, pages 607-621. Springer-Verlag, 1997.