Statically Assuring Secrecy for Dynamic Concurrent Processes

Proceedings of the ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Volumn 5, Issue , 2003, Pages 91-101

  Echahed, Rachid ^a   Prost, Frédéric ^a   Serwe, Wendelin ^b  

^a CNRS   (France)

^b CAMPUS DE BEAULIEU   (France)

Author keywords

Abstract interpretation; Noninterference; Safety

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; DATA PRIVACY; INTERNET; SOFTWARE ENGINEERING;

ABSTRACT INTERPRETATION; DYNAMIC CONCURRENT PROCESSES;

SECURITY OF DATA;

EID: 1242288174     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/888251.888261     Document Type: Conference Paper

References (29)

1. th ACM SIGPLAN - SIGACT Symposium on Principles of Programming Languages (POPL 2000), pages 40-53, Boston, Jan. 2000. ACM.
2. rd European Symposium on Research in Computer Security (ESORICS 94), volume 875 of Lecture Notes in Computer Science, pages 55-73, Brighton, Nov. 1994. Springer Verlag.
3. th IEEE Computer Security Foundations Workshop, Cape Breton, 2002.
4. D. E. Bell and L. J. LaPadula. Secure computer systems: Mathematical foundations. Technical Report ESD-TR-73-278 (Vol. I - III), MITRE Corporation, Bedford, Apr. 1974.
5. G. Boudol and I. Castellani. Noninterference for concurrent programs and thread systems. Theoretical Computer Science, 281(1):109-130, 2002. Special issue: "Merci, Maurice, A mosaic in honour of Maurice Nivat" (P.-L. Curien, Ed.).
6. th ACM SIGPLAN - SIGACT Symposium on Principles of Programming Languages (POPL '77), pages 238-252, Los Angeles, Jan. 1977. ACM.
7. D. E. Denning and P. J. Denning. Certification of programs for secure information flow. Communications of the ACM, 20(7):504-513, July 1977.
8. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, chapter 6, pages 243-320. Elsevier, Amsterdam, 1990.
9. A. Di Pierro, C. Hankin, and H. Wiklicky. Probabilistic confinement in a declarative framework. Electronic Notes in Theoretical Computer Science, 48, 2001.
10. th IEEE Computer Security Foundations Workshop, Cape Breton, June 2002.
11. st International Conference on Computational Logic (CL 2000), volume 1861 of Lecture Notes in Artificial Intelligence, pages 300-314, London, July 2000. Springer Verlag.
12. R. Echahed and W. Serwe. Integrating action definitions into concurrent declarative programming. Electronic Notes in Theoretical Computer Science, 64, Sept. 2002. special issue: selected papers of the International Workshop on Functional and (Constraint) Logic Programming (WFLP 2001).
13. th International Colloquium on Automata, Languages and Programming (ICALP 2000), volume 1853 of Lecture Notes in Computer Science, pages 354-372, Geneva, July 2000. Springer Verlag.
14. W. Fokkink. Introduction to Process Algebra. Texts in Theoretical Computer Science. Springer Verlag, 2000.
15. J. W. Gray, III. Probabilistic interference. In Proceedings of the 1990 IEEE Symposium on Security and Privacy, pages 170-179, Oakland, May 1990. IEEE Computer Society Press.
16. th ACM SIGPLAN - SIGACT Symposium on Principles of Programming Languages (POPL '99), pages 228-241, San Antonio, Jan. 1999.
17. th Annual IEEE Symposium on Logic in Computer Science (LICS '2000), pages 267-276, Santa Barbara, 2000. IEEE Computer Society Press.
18. th International Andrei Ershov Memorial Conference (PSI 2001), volume 2244 of Lecture Notes in Computer Science, pages 225-239, Akademgorodok, July 2001. Springer Verlag.
19. th International Symposium on Static Analysis (SAS 2002), volume 2477 of Lecture Notes in Computer Science, pages 376-394, Madrid, Sept. 2002. Springer Verlag.
20. A. Sabelfeld and A. C. Myers. Language-based information-flow security. IEEE Journal on Selected Areas in Communications, special issue on Design and Analysis Techniques for Security Assurance, 2002. to appear.
21. th IEEE Computer Security Foundations Workshop, pages 200-214, Cambridge, July 2000.
22. W. Serwe. On Concurrent Functional-Logic Programming, thèse de doctorat, Institut National Polytechnique de Grenoble, Mar. 2002.
23. th IEEE Computer Security Foundations Workshop, pages 115-125, Cape Breton, June 2001. IEEE Computer Society Press.
24. G. Smith. Weak probabilistic bisimulation for secure information flow. In Proceedings of the Workshop on Issues in the Theory of Security (WITS '02), Portland, Jan. 2002.
25. th1 ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '98), pages 355-364, San Diego, Jan. 1998.
26. G. Smith, D. M. Volpano, and C. Irvine. A sound type system for secure flow analysis. Journal of Computer Security, 4(3):167-187, 1996.
27. D. M. Volpano and G. Smith. Probabilistic noninterference in a concurrent language. Journal of Computer Security, 7(2, 3):231-253, Nov. 1999.
28. th International Conference on Foundations of Software Science and Computer Structures (FoSSaCs 2002), volume 2303 of Lecture Notes in Computer Science, pages 417-434. Springer Verlag, Apr. 2002.
29. th International Symposium on Static Analysis (SAS 2002), volume 2477 of Lecture Notes in Computer Science, pages 360-375, Madrid, Sept. 2002. Springer Verlag.