Type-based Information Flow Analysis for a Low-level Language

Computer Software

Volumn 20, Issue 2, 2003, Pages 118-137

  Kobayashi, Naoki ^a   Shirane, Keita ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85024737217     PISSN: 02896540     EISSN: None     Source Type: Journal    
DOI: 10.11309/jssst.20.118     Document Type: Article

References (22)

1. Abadi, M., Banerjee, A., Heintze N. and Rieck, J.G. : A core calculus of dependency, Proc. of POPL, pp. 147-169, 1999.
2. Agat, J. : Transforming out timing leaks, Proc. of POPL, pp. 40-53, 2000.
3. Denning, D.E. and Denning, P.J. : Certification of programs for secure information flow, Comm. of the ACM, Vol. 20, No. 7, pp. 504-513, 1977.
4. Heintze, N. and Riecke, J. : The slam calculus: programming with secrecy and integrity, Proc. of POPL, pp. 365-377, 1998.
5. Honda, K. Vasconcelos, V. and Yoshida, N. : Secure information flow as typed process behaviour, Proc. of European Symposium on Programming (ESOP) 2000, Vol. 1782 of LNCS, pp. 180-199, Springer-Verlag, 2000.
6. Honda, K. and Yoshida, N. : A uniform type structure for secure information flow, Proc. of POPL, pp. 81-92, 2002.
7. Igarashi, A. and Kobayashi, N. : Type reconstruction for linear pi-calculus with I/O subtyping, Info. Comput., Vol. 161, pp. 1-44, 2000.
8. Masuhara, H. and Yonezawa, A. : A portable approach to dynamic optimization in run-time specialization, New Generation Computing, Vol. 20, No. 1, pp. 101-124, 2002.
9. Mogensen, T. : Types for 0, 1 or many uses, Implementation of Functional Languages, Vol. 1467 of LNCS, pp. 112-122, 1998.
10. Morrisett, J.G., Walker, D., Crary, K. and Glew, N. : From system F to typed assembly language, ACM Trans. Prog. Lang. Syst., Vol. 21, No. 3, pp. 527-568, 1999.
11. Muchnick, S.S. : Advanced Compiler Design Implementation, Morgan Kaufmann Publishers, 1997.
12. Myers, A.C. : JFlow: Practical mostly-static information flow control, Proc. of POPL, pp. 228-241, 1999.
13. Necula, G.C. : Proof-carrying code, Proc. of POPL, pp. 106-119, 1997.
14. Nielson, F., Nielson, H.R. and Hankin, C. : Principles of Program Analysis, Springer-Verlag, 1999.
15. Pottier, F. and Simonet, V. : Information flow inference for ML, Proc. of POPL, pp. 319-330, 2002.
16. Rehof, J. and Mogensen, T. : Tractable constraints in finite semilattices, Science of Computer Programming, Vol. 35, No. 2, pp. 191-221, 1999.
17. Smith, G. and Volpano, D. : Secure information flow in a multi-threaded imperative language, Proc. of POPL, pp. 355-364, 1998.
18. Stata, R. and Abadi, M. : A type system for java bytecode subroutines, ACM Trans. Prog. Lang. Syst., Vol. 21, No. 1, pp. 90-137, 1999.
19. Volpano, D. and Smith, G. : Eliminating covert flows with minimum typings, Proc. 10th IEEE Computer Security Foundations Workshop, pp. 156-168, 1997.
20. Volpano, D. and Smith, G. : Verifying secrets and relative secrecy, Proc. of POPL, pp. 268-276, 2000.
21. Volpano, D., Smith, G. and Irvine, C. : A sound type system for secure flow analysis, Journal of Computer Security, Vol. 4, No. 3, pp. 167-187, 1996.
22. Zdancewic, S. and Myers, A.C. : Secure information flow via linear continuations, Higher-Order and Symbolic Computation, 2002, To appear. A preliminary version appeared in Proceedings of ESOP 2001, Springer LNCS 2028, pp. 46-61.