A monadic analysis of information flow security with mutable state

Journal of Functional Programming

Volumn 15, Issue 2, 2005, Pages 249-291

  Crary, Karl ^a   Kliger, Aleksey ^a   Pfenning, Frank ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION FLOW; LOGIC DEALS; MUTABLE STATES; SECURITY LEVELS;

COMPUTER PROGRAMMING LANGUAGES; DATA PRIVACY; INFORMATION ANALYSIS; SEMANTICS; THEOREM PROVING;

SECURITY OF DATA;

EID: 17044427985     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796804005441     Document Type: Article

References (19)

1. Abadi, M., Banerjee, A., Heintze, N. and Riecke, J. G. (1999) A core calculus of dependency. Twenty-sixth ACM Symposium on Principles of Programming Languages, pp. 147-160.
2. Harrison, W., Tullsen, M. and Hook, J. (2003) Domain separation by construction. Foundations of Computer Security Workshop (FCS'03).
3. Heintze, N. and Riecke, J. G. (199) The SLam calculus: Programming with secerecy and integrity. Twenty-fifth ACM Symposium on Principles of Programming Languages, pp. 365-377.
4. Hondfy K. and Yoshida, N. (2002) A uniform type structure for secure information flow. Twenty-ninth ACM Symposium on Principles of Programming Languages, pp. 81-92.
5. Huet, G. (1980) Confluent reductions: Abstract properties and applications to term rewriting systems. J. ACM, 27(4), 797-821.
6. Moggi, E. (1989) Computational lambda-calculus and monads. Fourth IEEE Symposium on Logic in Computer Science, pp. 14-23.
7. Moggi, E. (1991) Notions of computation and monads. Infor. & Computation, 93, 55-92.
8. Morrisett, G., Walker, D., Crary, K. and Glew, N. (1999) From System F to typed assembly language. ACM Trans. Program. Lang. & Syst. 21(3), 527-568.
9. Myers, A. C. (1999) JFlow: Practical mostly-static information flow control. Twenty-sixth ACM Symposium on Principles of Programming Languages, pp. 228-241.
10. Pfenning, F. and Davies, R. (2001) A judgmental reconstruction of modal logic. Mathematical Struct. in Comput. Sci. 11(4), 511-540.
11. Pottier, F. and Simonet, V. (2003) Information flow inference for ML. ACM Trans. Program. Lang. & Syst. 25(1), 117-158.
12. Sabelfeld, A. and Myers, A. C. (2003) Language-based information-flow security. IEEE J. Selected Areas in Comm. 21(1), 5-19.
13. Smith, G. and Volpano, D. (1998) Secure information flow in a multi-threaded imperative language. Twenty-fifth ACM Symposium on Principles of Programming Languages, pp. 355-364.
14. Volpano, D., Smith, G. and Irvine, C. (1996) A sound type system for secure flow analysis. J. Comput. Security, 4(3), 167-187.
15. Zdancewic, S. (2002) Programming languages for information security. PhD thesis, Department of Computer Science, Cornell University, Ithaca, New York.
16. Zdancewic, S. (2003) A type system for robust declassification. Nineteenth Mathematical Foundations of Programming Semantics. Electronic Notes in Theoretical Computer Science.
17. Zdancewic, S. and Myers, A. C. (2001a) Robust declassification. Fourteenth IEEE Computer Security Foundations Workshop, pp. 15-23.
18. Zdancewic, S. and Myers, A. C. (2001b) Secure information flow and CPS. Tenth European Symposium on Programming: Lecture Notes in Computer Science 2028, pp. 46-61. Springer-Verlag.
19. Zdancewic, S. and Myers, A. C. (2002) Secure information flow via linear continuations. Higher Order & symbolic Computation, 15(2-3), 209-234.