Achieving information flow security through precise control of effects

Proceedings of the Computer Security Foundations Workshop

Volumn , Issue , 2005, Pages 16-30

  Harrison, William L ^a   Hook, James ^b  

^a University of Missouri   (United States)

^b Portland State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; MATHEMATICAL MODELS;

INFORMATION FLOW SECURITY; INTERDOMAIN COMMUNICATION; MONAD TRANSFORMER; MONADIC ENCAPSULATION;

SECURITY OF DATA;

EID: 28144451172     PISSN: 10636900     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (49)

1. M. Abadi, A. Banerjee, N. Heintze, and J. Riecke. A core calculus of dependency. In Proceedings of the Twenty-sixth ACM Symposium on Principles of Programming Languages, San Antonio, Texas, pages 147-160, January 1999.
2. D. Alexander, W. Arbaugh, M. Hicks, P. Kakkar, A. Keromytis, J. Moore, C. Gunder, S. Nettles, and J. Smith. The switchware active network architecture. IEEE Network, May/June 1998.
3. D. Bell and L. LaPadula. Secure computer systems: Mathematical foundations and model. Technical Report M74-244, The MITRE Corp., Bedford MA, May 1973.
4. W. R. Bevier. Kit: A study in operating system verification. IEEE Transactions on Software Engineering, 15(11):1382-1396, 1989.
5. R. Bird. Introduction to Functional Programming using Haskell, Prentice-Hall Series in Computer Science. Prentice-Hall Europe, London, UK, second edition, 1998.
6. K. Birman, R. Constable, M. Hayden, C. Kreitz, O. Rodeh, R. van Renesse, and W. Vogels. The Horus and Ensemble projects: Accomplishments and limitations. In Proceedings of the DARPA Information Survivability Conference & Exposition (DISCEX '00), 2000.
7. K. Claessen. A poor man's concurrency monad. Journal of Functional Programming, 9(3):313-323, 1999.
8. D. Espinosa. Semantic Lego, PhD thesis, Columbia University, 1995.
9. J. A. Goguen and J. Meseguer. Security policies and security models. In Proceedings of the 1982 Symposium on Security and Privacy (SSP '82), pages 11-20, Los Alamitos, Ca., USA, Apr. 1990. IEEE Computer Society Press.
10. R. Harper, P. Lee, and F. Pfenning. The Fox project: Advanced language technology for extensible systems. Technical Report CMU-CS-98-107, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, January 1998.
11. W. Harrison. Haskell implementations of the monadic separation kernels for CSFW 2005. Available from www.cs.missouri.edu/~harrison/CSFW05.
12. W. Harrison. Modular Compilers and Their Correctness Proofs. PhD thesis, University of Illinois at Urbana-Champaign, 2001.
13. W. Harrison and S. Kamin. Metacomputation-based compiler architecture. In 5th International Conference on the Mathematics of Program Construction, Ponte de Lima, Portugal, volume 1837 of Lecture Notes in Computer Science, pages 213-229. Springer-Verlag, 2000.
14. N. Heintze and J. Riecke. The SLam calculus: programming with secrecy and integrity. In ACM, editor, Proceedings of the Twenty-fifth ACM Symposium on Principles of Programming Languages, pages 365-377, New York, NY, USA, 1998. ACM Press.
15. R. Joshi and K. Leino. A semantic approach to secure information flow. Science of Computer Programming, 37(1-3): 113-138, May 2000.
16. B. Lampson. A note on the confinement problem. In Communications of the ACM, pages 613-615. ACM press, Oct. 1973.
17. P. Li and S. Zdancewic. Downgrading policies and relaxed noninterference. In POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT sysposium on Principles of programming languages, pages 158-170, 2005.
18. S. Liang. Modular Monadic Semantics and Compilation, PhD thesis, Yale University, 1998.
19. S. Liang, P. Hudak, and M. Jones. Monad transformers and modular interpreters. In 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1995, pages 333-343, New York, NY, USA, 1995. ACM Press.
20. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer Verlag, 1991.
21. E. McCauley and P. Drongowski. KSOS - the design of a secure operating system. In Proceedings of the American Federation of Information Processing Societies (AFIPS) National Computer Conference, volume 48, pages 345-353, 1979.
22. D. McCullough. Noninterference and the composability of security properties. In P roc. IEEE Symposium on Security and Privacy, pages 177-187, 1988.
23. J. McLean. A general theory of composition for trace sets closed under selective interleaving functions. In Proceedings of the IEEE Symposium on Research in Security and Privacy, pages 79-93, 1994.
24. M. Mizuno and D. Schmidt. A security flow control algorithm and its denotational semantics correctness proof. Formal Aspects of Computing, 4(6A):727-754, 1992.
25. E. Moggi. An abstract view of programming languages. Technical Report ECS-LFCS-90-113, Dept. of Computer Science, Edinburgh Univ., 1990.
26. E. Moggi. Notions of computation and monads. Information and Computation, 93(1):55-92, 1991.
27. P. Neumann, R. Boyer, R. Feiertag, K. Levitt, and L. Robinson. A provably secure operating system: The system, its applications, and proof. Technical Report CSL-116, SRI, May 1980.
28. P. W. O'Hearn, H. Yang, and J. C. Reynolds. Separation and information hiding. In Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 268-280. ACM Press, 2004.
29. J. Palsberg and P. Ørbæk. Trust in the lambda-calculus. Journal of Functional Programming, 7(6):557-591, November 1997.
30. N. Papaspyrou. A resumption monad transformer and its applications in the semantics of concurrency. In Proceedings of the 3rd Panhellenic Logic Symposium, Anogia, Crete, 2001.
31. N. S. Papaspyrou. A Resumption Monad Transformer and its Applications in the Semantics of Concurrency. In Proceedings of the 3rd Panhellenic Logic Symposium, Anogia, Crete, July 17-22, 2001.
32. S. Peyton Jones, editor. Haskell 98 Language and Libraries, the Revised Report. Cambridge University Press, Apr. 2003.
33. F. Pettier and S. Conchon. Information flow inference for free. In Proceedings of the Fifth ACM SIGPLAN international conference on Functional programming (ICFP 99), pages 46-57, 2000.
34. F. Pettier and V. Simonet. Information flow inference for ML. In Proceedings of the 29th ACM Symposium on Principles of Programming Languages, pages 319-330, Portland, Oregon, Jan. 2002.
35. Programatica Home Page. www.cse.ogi.edu/PacSoft/projects/programatica.
36. J. Reynolds. Separation logic: a logic for shared mutable data structures. In Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS '02), 2002.
37. J. C. Reynolds. The Craft of Programming. Prentice Hall, Englewood Cliffs, 1981.
38. J. C. Reynolds. Types, abstraction and parametric polymorphism. In R. E. A. Mason, editor, Information Processing 83, pages 513-523. North-Holland, 1983.
39. W. A. Roscoe. Theory and Practice of Concurrency. Prentice-Hall, 1998.
40. J. Rushby. Design and verification of secure systems. In Proceedings of the ACM Symposium on Operating System Principles, volume 15, pages 12-21, 1981.
41. th International Symposium on Programming, pages 352-362, Berlin, 1982. Springer-Verlag.
42. A. Sabelfeld and A. Myers. Language-based information-flow security. IEEE Journal on Selected Areas in Communications, 21(1), Jan. 2003.
43. J. Shapiro, J. Smith, and D. Farber. EROS: a fast capability system. In Proceedings of the 17th ACM Symposium on Operating Systems Principles (SOSP'99), pages 170-185, Charleston, South Carolina, 1999.
44. G. Smith. A new type system for secure information flow. In 14th IEEE Computer Security Foundations Workshop (CSFW '01), pages 115-125. IEEE Computer Society Press, 2001.
45. G. Smith and D. Volpano. Secure information flow in a multi-threaded imperative language. In Proceedings of the 25th ACM Symposium on Principles of Programming Languages, San Diego, California, pages 355-364, New York, Jan. 1998.
46. S. Tse and S. Zdancewic. Translating dependency into parametricity. In Proceedings of the Ninth ACM SIGPLAN International Conference on Functional Programming (ICFP 04), pages 115-125, 2004.
47. B. Walker, R. Kemmerer, and G. Popek. Specification and verification of the UCLA Unix security kernel. Communications of the ACM, 23(2):118-131, 1980.
48. A. Zakinthinos and E. Lee. A general theory of security properties. In Proceedings of the 1997 IEEE Symposium on Security and Privacy, pages 94-102. IEEE Computer Society, 1997.
49. S. Zdancewic and A. Myers. Robust declassification. In Proceedings of 14th IEEE Computer Security Foundations Workshop, Cape Breton, Nova Scotia, Canada, pages 15-23, June 2001.