Information flow analysis for a typed assembly language with polymorphic stacks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3956 LNCS, Issue , 2006, Pages 37-56

  Bonelli, Eduardo ^a   Compagnoni, Adriana ^b   Medel, Ricardo ^b  

^a UNIVERSIDAD NACIONAL DE LA PLATA   (Argentina)

^b STEVENS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; INFORMATION DISSEMINATION; PROBLEM SOLVING; PROGRAM ASSEMBLERS;

ILLEGAL FLOWS; INFORMATION FLOW; STACK POLYMORPHISM; TYPED ASSEMBLY LANGUAGE (TAL);

INFORMATION ANALYSIS;

EID: 33745821985     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11741060_3     Document Type: Conference Paper

References (30)

1. D. Aspinall and A. B. Compagnoni. Heap bounded assembly language. Journal of Automated Reasoning, Special Issue on Proof-Carrying Code, 31(3-4):261-302, 2003.
2. A. Banerjee and D. Naumann. Secure information flow and pointer confinement in a Java-like language. In Proceedings of Fifteenth IEEE Computer Security Foundations - CSFW, pages 253-267, June 2002.
3. G. Barthe, A. Basu, and T. Rezk. Security types preserving compilation. In Proceedings of VMCAI'04, volume 2937 of Lecture Notes in Computer Science. Springer-Verlag, 2004.
4. D. Bell and L. LaPadula. Secure computer systems: Mathematical foundations and model. Technical Report Technical Report MTR 2547 v2, MITRE, November 1973.
5. K. Biba. Integrity considerations for secure computer systems. Technical Report ESD-TR-76-372, USAF Electronic Systems Division, Bedford, MA, April 1977.
6. E. Bonelli, A. Compagnoni, and R. Medel. Information flow analysis for a typed assembly language with polymorphic stacks. http://www.cs.stevens.edu/~rmedel/siftalTechReport.ps, 2005.
7. E. Bonelli, A. Compagnoni, and R. Medel. SIFTAL: A typed assembly language for secure information flow analysis. http://www.cs.stevens.edu/~rmedel/techReport.ps, 2005.
8. T. Chothia, D. Duggan, and J. Vitek. Type-based distributed access control. In Proc. of IEEE Computer Security Foundations Workshop, Asilomar, California, 2003.
9. K. Crary, A. Kliger, and F. Pfenning. A monadic analysis of information flow security with mutable state. Technical Report CMU-CS-03-164, Carnegie Mellon University, September 2003.
10. D. E. Denning. A lattice model of secure information flow. Communications of the ACM, 19(5):236-242, May 1976.
11. D. E. Denning and P. J. Denning. Certification of programs for secure information flow. Communications of the ACM, 20(7):504-513, July 1977.
12. R. J. Feiertag, K. N. Levitt, and L. Robinson. Proving multilevel security of a system design. In 6th ACM Symp. Operating System Principles, pages 57-65, November 1977.
13. J. A. Goguen and J. Meseguer. Security policy and security models. In Proceedings of the Symposium on Security and Privacy, pages 11-20. IEEE Press, 1982.
14. D. Hedin and D. Sands. Timing aware information flow security for a JavaCard-like bytecode. In Proceedings of the First Workshop on Bytecode Semantics, Verification, Analysis and Transformation (Bytecode SOUS), volume 141(1) of Electronic Notes in Theoretical Computer Science, pages 163-182, December 2005.
15. R. Medel, A. Compagnoni, and E. Bonelli. A typed assembly language for noninterference. In M. Coppo, E. Lodi, and G. M. Pinna, editors, Ninth Italian Conference on Theoretical Computer Science - ICTCS 2005, volume 3701 of LNCS, pages 360-374, Certosa di Pontignano, Siena (Italy), October 2005. Springer.
16. G. Morrisett, K. Crary, N. Glew, and D. Walker. Stack-based typed assembly language. In Second International Workshop on Types in Compilation, pages 95117, Kyoto, March 1998.
17. Published in Xavier Leroy and Atsushi Ohori, editors, Lecture Notes in Computer Science, volume 1473, pages 28-52. Springer-Verlag, 1998.
18. G. Morrisett, D. Walker, K. Crary, and N. Glew. Prom System F to Typed Assembly Language. A CM Transactions on Programming Languages and Systems, 21(3):528-569, May 1999.
19. This is the expanded version of a paper that appeared in Twenty-Fifth ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 85-97, San Diego, CA, USA, January 1998.
20. A. Myers and A. Sabelfeld. A model for delimited information release. In International Symposium on Soware Security, volume 3233 of LNCS, Tokyo, Japan, 2003.
21. A. Myers, A. Sabelfeld, and S. Zdancewic. Enforcing robust declassification. 7th IEEE Computer Security Foundations Workshop, 2004.
22. G. Necula. Compiling with Proofs. PhD thesis, Carnegie Mellon University, September 1998.
23. P. G. Neumman, R. J. Feiertag, K. N. Levitt, and L. Robinson. Software development and proofs of multi-level security. In Proceedings of the 2nd International Conference on Software Engineering, pages 421-428. IEEE Computer Society, October 1976.
24. A. Sabelfeld and A. Myers. Language-based information-flow security. IEEE Journal on Selected Areas in Communications, 21(1), 2003.
25. F. Smith, D. Walker, and G. Morrisett. Alias types. In Gert Smolka, editor, Ninth European Symposium on Programming, volume 1782 of LNCS, pages 366381. Springer-Verlag, April 2000.
26. D. M. Volpano and G. Smith. A type-based approach to program security. In TAPSOFT, pages 607-621, 1997.
27. H. Xi and R. Harper. A dependently typed assembly language. Technical Report OGI-CSE-99-008, Oregon Graduate Institute of Science and Technology, July 1999.
28. D. Yu and N. Islam. A typed assembly language for confidentiality. Personal Communication, July 2005.
29. S. Zdancewic and A. Myers. Robust declassification. In Proc. of 14th IEEE Computer Security Foundations Workshop, pages 15-23, Cape Breton, Canada, June 2001.
30. S. Zdancewic and A. Myers. Secure information flow via linear continuations. Higher Order and Symbolic Computation, 15(2-3), 2002.