Arrows for secure information flow

Theoretical Computer Science

Volumn 411, Issue 19, 2010, Pages 1974-1994

  Li, Peng ^a   Zdancewic, Steve ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Arrows; Combinators; Haskell; Information flow; Security; Type systems

Indexed keywords

ANALYSIS TECHNIQUES; BASE LANGUAGE; COMBINATORS; CONTROL-FLOW; DYNAMIC SECURITY; EMBEDDED SECURITY; FORMAL PROOFS; HASKELL; HASKELL IMPLEMENTATION; HASKELL PROGRAMMING LANGUAGE; INFORMATION FLOW CONTROL; INFORMATION FLOW SECURITY; INFORMATION FLOWS; POLICY FRAMEWORK; RUNTIMES; SECURE INFORMATION FLOW;

FLOW CONTROL; LINGUISTICS; SECURITY OF DATA;

QUERY LANGUAGES;

EID: 77949484835     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.01.025     Document Type: Article

References (19)

1. M. Abadi, A. Banerjee, N. Heintze, J. Riecke, A core calculus of dependency, in: Proc. 26th ACM Symp. on Principles of Programming Languages, POPL, San Antonio, TX, 1999, pp. 147-160.
2. Chapman R., and Hilton A. Enforcing security and safety models with an information flow analysis tool. ACM SIGAda Ada Letters XXIV 4 (2004) 39-46
3. Hughes J. Generalising monads to arrows. Science of Computer Programming 37 (2000) 67-111
4. P. Li, S. Zdancewic, Encoding information flow in Haskell, in: Proceedings of the 19th IEEE Computer Security Foundations Workshop, CSFW'06, 2006.
5. S. Liang, P. Hudak, M. Jones, Monad transformers and modular interpreters, in: Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1995, pp. 333-343.
6. A.C. Myers, JFlow: Practical mostly-static information flow control, in: Proc. 26th ACM Symp. on Principles of Programming Languages, POPL, San Antonio, TX, 1999, pp. 228-241.
7. Myers A.C., and Liskov B. Protecting privacy using the decentralized label model. ACM Transactions on Software Engineering and Methodology 9 4 (2000) 410-442
8. A.C. Myers, N. Nystrom, L. Zheng, S. Zdancewic, Jif: Java information flow, software release. Located at http://www.cs.cornell.edu/jif, 2001.
9. Paterson R. A new notation for arrows. International Conference on Functional Programming (Sep.2001), ACM Press 229-240
10. Paterson R. Arrows and computation. In: Gibbons J., and de Moor O. (Eds). The Fun of Programming (2003), Palgrave 201-222
11. S. Peyton Jones, L. Augustsson, D. Barton, Haskell 98 language and libraries (the revised report), 2002. http://www.haskell.org/report.
12. F. Pottier, V. Simonet, Information flow inference for ML, in: Proc. 29th ACM Symp. on Principles of Programming Languages, POPL, Portland, OR, 2002.
13. Sabelfeld A., and Myers A.C. Language-based information-flow security. IEEE Journal on Selected Areas in Communications 21 1 (2003) 5-19
14. A. Sabelfeld, D. Sands, Dimensions and principles of declassification, in: Proceedings of the 18th IEEE Computer Security Foundations Workshop, CSFW'05, 2005, pp. 255-269.
15. V. Simonet, Flow Caml in a nutshell. in: Hutton, G. (Ed.), Proceedings of the first APPSEM-II Workshop, Nottingham, United Kingdom, 2003, pp. 152-165.
16. S. Tse, S. Zdancewic, Run-time principals in information-flow type systems, in: Proc. IEEE Symposium on Security and Privacy, 2004.
17. S. Tse, S. Zdancewic, Translating dependency into parametricity, in: ACM International Conference on Functional Programming, 2004.
18. P. Wadler, Monads for functional programming, in: Proceedings of the Marktoberdorf Summer School on Program Design Calculi, 1992.
19. L. Zheng, A.C. Myers, Dynamic security labels and noninterference, in: Proceedings of the Second Workshop on Formal Aspects in Security and Trust, FAST2004, 2004.