Security policy in a declarative style

PPDP'05 - Proceedings of the Seventh ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Volumn 2005, Issue , 2005, Pages 153-163

  Echahed, R ^a   Prost, F ^a  

^a Leibniz Laboratory   (France)

Author keywords

Confidentiality; Non interference

Indexed keywords

ALGORITHMS; AUTOMATIC TELLER MACHINES; COMPUTER PROGRAMMING; CONSTRAINT THEORY; PROBLEM SOLVING; SECURITY OF DATA;

CONFIDENTIALITY; DECLARATIVE PROGRAMMING SETTING; NON-INTERFERENCE; PASSWORD TESTING;

INFORMATION SCIENCE;

EID: 33746103319     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1069774.1069789     Document Type: Conference Paper

References (34)

1. th Annual ACM SIGPLAN -SIGACT Symposium on Principles of Programming Languages (POPL 2002), pages 33 - 44, Portland, Jan. 2002. ACM Press.
2. 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.).
3. th ACM SIGPLAN - SIGACT Symposium on Principles of Programming Languages (POPL '77), pages 238 - 252, Los Angeles, Jan. 1977. ACM.
4. N. Dershowitz and D. A. Plaisted. Rewriting. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning (in 2 volumes, chapter 9, pages 535 -610. Elsevier and MIT Press, Amsterdam, 2001.
5. R. Echahed and F. Prost. Handling harmless interference (preliminary version). 2003. url: www-leibniz.imag.fr/LesCahiers/Cahier82/ResumCahier82.html.
6. R. Echahed and F. Prost. Handling declared information leakage (extended abstract). In Proceedings of Workshop on Issues in the Theory of Security 2005 (WITS'05), Long Beach, January 2005,
7. R. Echahed, F. Prost, and W. Serwe. Statically assuring secrecy for dynamic concurrent processes. 2003. proceedings of PPDP'03, preliminary version avalaible at http://www-leibniz.imag.fr/LesCahiers/2002/Cahier40/Resum-Cahier40. html.
8. st International Conference on Computational Logic (CL 2000), volume 1861 of Lecture Notes in Artificial Intelligence, pages 300 - 314, London, July 2000. Springer Verlag.
9. 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).
10. W. Fokkink. Introduction to Process Algebra. Texts in Theoretical Computer Science. Springer Verlag, 2000.
11. th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '04), Venice, Italy, Jan. 2004.
12. J. Goguen and J. Meseguer. Security policies and security models. In IEEE Symposium on Security and Privacy, pages 11-20. IEEE Computer Society Press, 1982.
13. J. A. Goguen and J. Meseguer. Unwinding and inference control. In IEEE Symposium on Security and Privacy, pages 75-87, 1984.
14. M. Hennessy and J. Riely. Information flow vs. ressource access in the asynchronous pi-calculus. In Automata, Languages and Programming, 27th International Colloquium, (ICALP'2000), LNCS 1853, pages 415-427. Springer, 2000.
15. nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '05), Long Beach, California, USA, january 2005.
16. H. Mantel and D. Sands. Controlled declassification based on intransitive noninterference. In 2nd ASIAN Symposium on Programming Languages and Systems, 2004.
17. J. Mullins. Nondeterministic admissible interference. Journal of Universal Computer Science, 6(11):1054-1070, November 2000.
18. A. C. Myers, A. Sabelfeld, and S. Zdancewic. Enforcing robust declassification. In 17th IEEE Computer Security Foundations Workshop, pages 172-180, 2004.
19. A. D. Pierro, C. Hankin, and H. Wiklicky. Approximate confinement under uniform attacks. In M. V. Hermenegildo and G. Puebla, editors, SAS'02 - Static Analysis, 9th International Symposium, number 2477 in Lecture Notes in Computer Science, Madrid, Spain, September 2002. Springer.
20. th IEEE Computer Security Foundations Workshop, Cape Breton, Nova, Scotia, Canada, 2002.
21. F. Pottier and V. Simonet. Information flow inference for ML. ACM Transactions on Programming Languages and Systems, 25(1):117-158, January 2003.
22. th Annual IEEE Symposium on Logic in Computer Science (LICS '2000), pages 267 - 276, Santa Barbara, 2000. IEEE Computer Society Press.
23. A. W. Roscoe and M. H. Goldsmith. What is intransitive noninterference ? In Proceedings of the 12th IEEE Computer Security Foundations Workshop (CSFW-18), Mordano, Italy, June 1999.
24. J. Rushby. Noninterference, transitivity, and channel-control security policies. Technical report, Computer Science Laboratory, SRI International, Dec. 1992. Technical Report CSL-92-02.
25. th IEEE Computer Security Foundations Workshop, pages 237 - 238, Cape Breton, Nova Scotia, Canada, June 2001.
26. P. Ryan and S. Schneider. Process algebra and non-interference. In PCSFW: Proceedings of The 12th Computer Security Foundations Workshop. IEEE Computer Society Press, 1999.
27. A. Sabelfeld arid 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.
28. G. Smith and D. Volpano. Secure information flow in a multi-threaded imperative language. In Proc. of the 25th ACM Symposium on Principles of Programming Languages (POPL'98), pages 355-364. ACM, 1998.
29. th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '98), pages 355 - 364, San Diego, Jan. 1998.
30. 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.
31. D. Volpano and G. Smith. Confinements properties for programming languages. SIGACT News, 29(3):33-42, 1998.
32. N. Yoshida and M. Henuessy. Assigning types to processes. In I. C. S. Press, editor, Proc. of IEEE 15th Ann. Symp. on Logic in Computer Science (LICS'2000), pages 334-345, 2000.
33. S. Zdancewic. A type system for robust declassification. In Annual Conference on the Mathematical Foundations of Programming Semantics, 2003.
34. S. Zdancewic and A. Myers. Robust declassification. In Proceedings of 14th IEEE Computer Security Foundations Workshop, pages 15-23, Cape Breton, Nova Scotia, Canada, June 2001., 2001.