On flow-sensitive security types

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2006, Pages 79-90

  Hunt, Sebastian ^a   Sands, David ^b  

^a CITY UNIVERSITY   (United Kingdom)

^b CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Flow sensitivity; Information flow; Non interference; Static analysis; Type systems

Indexed keywords

COMPUTER PROGRAMMING; INDEXING (OF INFORMATION); INFORMATION ANALYSIS; SEMANTICS; STATISTICAL METHODS;

FLOW-SENSITIVITY; INFORMATION FLOW; NON-INTERFERENCE; STATIC ANALYSIS; TYPE SYSTEMS;

SECURITY OF DATA;

EID: 33745847182     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1111037.1111045     Document Type: Conference Paper

References (22)

1. [AB04] Torben Amtoft and Anindya Banerjee. Information flow analysis in logical form. In SAS 2004 (11th Static Analysis Symposium), Verona, Italy, August 2004, volume 3148 of LNCS, pages 100-115. Springer-Verlag, 2004.
2. [ADvRF01] Wolfram Amme, Niall Dalton, Jeffery von Ronne, and Michael Franz. SafeTSA: A type safe and referentially secure mobile-code representation based on static single assignment form. In SIGPLAN '01 Conference on Programming Language Design and Implementation, pages 137-147, 2001.
3. [App98] Andrew W. Appel. Modern Compiler Implementation in Java. Cambridge University Press, Cambridge, 1998.
4. [AR80] G. R. Andrews and R. P. Reitman. An axiomatic approach to information flow in programs. ACM TOPLAS, 2(1):56-75, January 1980.
5. [BBL94] J.-P. Banâtre, C. Bryce, and D. Le Métayer. Compile-time detection of information flow in sequential programs. In Proc. European Symp. on Research in Computer Security, volume 875 of LNCS, pages 55-73. Springer-Verlag, 1994.
6. [CC77] P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. ACM Symp. on Principles of Programming Languages, pages 238-252, January 1977.
7. [CC79] P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Conference Record of the Sixth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 269-282, San Antonio, Texas, 1979. ACM Press, New York, NY.
8. +89] Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark K. Wegman, and F. Kenneth Zadeck. An efficient method of computing static single assignment form. In 16th Annual ACM Symposium on Principles of Programming Languages, pages 25-35, 1989.
9. [CH95]. Paul R. Carini and Michael Hind. Flow-sensitive interprocedural constant propagation. In PLDI '95: Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation, pages 23-31. ACM Press, 1995.
10. [CHH02] D. Clark, C. Hankin, and S. Hunt. Information flow for Algol-like languages. Journal of Computer Languages, 28(1):3-28, April 2002.
11. [DD77] D. E. Denning and P. J. Denning. Certification of programs for secure information flow. Comm. of the ACM, 20(7):504-513, July 1977.
12. [DP90] B. Davey and H. Priestley. Introduction to Lattices and Order. Cambridge University Press, 1990.
13. [GRS00] Roberto Giacobazzi, Francesco Ranzato, and Francesca Scozzari. Making abstract interpretations complete. J. ACM, 47(2):361-416, 2000.
14. [GS05] S. Genaim and F. Spoto. Information Flow Analysis for Java Bytecode. In R. Cousot, editor, Proc. of the Sixth International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'05), volume 3385 of Lecture Notes in Computer Science, pages 346-362, Paris, France, January 2005. Springer-Verlag.
15. [HR98] N. Heintze and J. G. Riecke. The SLam calculus: programming with secrecy and integrity. In Proc. ACM Symp. on Principles of Programming Languages, pages 365-377, January 1998.
16. [HS91] S. Hunt and D. Sands. Binding Time Analysis: A New PERspective. In Proceedings of the ACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM'91), pages 154-164, September 1991. ACM SIGPLAN Notices 26(9).
17. [HS05] D. Hedin and D. Sands. Timing aware information flow security for a JavaCard-like bytecode. In First Workshop on Bytecode Semantics, Verification, Analysis and Transformation (BYTECODE '05), 2005. To Appear, ENTCS.
18. [NRH99] F. Nielson, H. Riis Nielson, and C. Hankin. Principles of Program Analysis. Springer-Verlag, 1999.
19. [SM03] A. Sabelfeld and A. C. Myers. Language-based information-flow security. IEEE J. Selected Areas in Communications, 21(1):5-19, January 2003.
20. [SS01] A. Sabelfeld and D. Sands. A per model of secure information flow in sequential programs. Higher Order and Symbolic Computation, 14(1):59-91, March 2001. Earlier version in ESOP'99.
21. [VSI96] D. Volpano, G. Smith, and C. Irvine. A sound type system for secure flow analysis. J. Computer Security, 4(3):167-187, 1996.
22. [Wel02] J. B. Wells. The essence of principal typings. In Proc. International Colloquium on Automata, Languages and Programming, volume 2380 of LNCS, pages 913-925. Springer-Verlag, 2002.