A systematic approach to static access control

ACM Transactions on Programming Languages and Systems

Volumn 27, Issue 2, 2005, Pages 344-382

  Pottier, François ^a   Skalka, Christian ^b,d   Smith, Scott ^c  

^a INRIA ROCQUENCOURT   (France)

^b UNIVERSITY OF VERMONT   (United States)

^c JOHNS HOPKINS UNIVERSITY   (United States)

^d University of Vermont   (United States)

Author keywords

Access control; Stack inspection; Type systems

Indexed keywords

ACCESS CONTROL; STACK INSPECTION; TYPE SYSTEMS;

INSPECTION; PUBLIC POLICY;

CONTROL SYSTEMS;

EID: 27844549441     PISSN: 01640925     EISSN: 01640925     Source Type: Journal    
DOI: 10.1145/1057387.1057392     Document Type: Article

References (46)

1. AIKEN, A. S. AND FÄHNDRICH, M. 1997. Program analysis using mixed term and set constraints. In Static Analysis Symposium (SAS). 114-126. URL: http://www.cs.berkeley.edu/~aiken/publications/papers/sas97.ps.
2. AIKEN, A. S., WIMMERS, E. L., AND LAKSHMAN, T. K. 1994. Soft typing with conditional types. In ACM Symposium on Principles of Programming Languages (POPL). ACM, New York, 163-173. URL: http://http.cs.berkeley.edu/~aiken/ftp/ popl94.ps.
3. BANERJEE, A. AND NAUMANN, D. A. 2001. A simple semantics and static analysis for Java security. Tech. Rep. 2001-1, Stevens Institute of Technology. June. URL: http://guinness.cs.stevens-tech.edu/~naumann/publications/tr2001.ps.
4. BARTOLETTI, M., DEGANO, P., AND FERRARI, G. 2001. Static analysis for stack inspection. In International Workshop on Concurrency and Coordination. Electronic Notes in Theoretical Computer Science, vol. 54. Elsevier Science, Amsterdam, The Netherlands.
5. BESSON, F., DE GRENIER DE LATOUR, T., AND JENSEN, T. 2002. Secure calling contexts for stack inspection. In Proceedigs of the ACM International Conference on Principles and Practice of Declarative Programming (PPDP). ACM, New York, 76-87. URL: http://www.irisa.fr/lande/jensen/ppdp02.pdf.
6. BESSON, F., JENSEN, T. P., LE MÉTAYER, D., AND THORN, T. 2001. Model checking security properties of control flow graphs. Journal of Computer Security 9, 3, 217-250. URL: http://www.irisa.fr/lande/jensen/jcs.pdf.
7. CLEMENTS, J. AND FELLEISEN, M. 2003. A tail-recursive semantics for stack inspections. In Proceedings of the European Symposium on Programming (ESOP). Lecture Notes in Computer Science, vol. 2618. Springer-Verlag, New York, 22-37. URL: http://www.ccs.neu.edu/scheme/pubs/esop2003-cf.ps.gz.
8. ERLINGSSON, Ú. AND SCHNEIDER, F. B. 1999. SASI enforcement of security policies: a retrospective. In Proceedings of the New Security Paradigms Workshop. 87-95. URL: http://www.cs.cornell.edu/fbs/publications/sasiNSPW.ps.
9. FILINSKI, A. 1999. Representing layered monads. In Proceedings of the ACM Symposium on Principles of Programming Languages (POPL). ACM, New York, 175-188. URL: http://www.brics.dk/~andrzej/papers/RLM.ps.gz.
10. FOURNET, C. AND GORDON, A. D. 2002. Stack inspection: Theory and variants. In Proceedings of the ACM Symposium on Principles of Programming Languages (POPL). ACM, New York, 307-318. URL:http://research.microsoft.com/ ~fournet/papers/stack-inspection-theory-and-variants-popl-02.ps.
11. GONG, L. 1998. Java security architecture (JDK1.2). URL: http://java.sun.com/products/jdk/1.2/docs/guide/security/spec/security-spec.doc. html.
12. GONG, L. AND SCHEMERS, R. 1998. Implementing protection domains in the Java Development Kit 1.2. In Proceedings of the Internet Society Symposium on Network and Distributed System Security. 125-134. URL: http://java.sun.com/ people/gong/papers/jdk12impl.ps.gz.
13. GUZMÁN, J. C. AND SUÁREZ, A. 1994. An extended type system for exceptions. In Proceedings of the ACM Workshop on ML and its Applications. Number 2265 in INRIA Research Reports. INRIA, 127-135.
14. HIGUCHI, T. AND OHORI, A. 2003. A static type system for JVM access control. In Proceedings of the ACM International Conference on Functional Programming (ICFP). 227-237. URL: http://www.jaist.ac.jp/~ohori/research/ higuchiOhoriIcfp03.pdf.
15. JENSEN, T., LE MÈTAYER, D., AND THORN, T. 1999. Verifying security properties of control-flow graphs. In Proceedings of the IEEE Symposium on Security and Privacy (S&P). IEEE Computer Society Press, Los Alamitos, Calif., 89-105. URL: http://www.irisa.fr/lande/jensen/papers/SP99.ps.
16. KOVED, L., PISTOIA, M., AND KERSHENBAUM, A. 2002. Access rights analysis for Java. In Proceedings of the ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA). ACM, New York, 359-372. URL: http://www.research.ibm.com/javasec/OOPSLA2002preprint.pdf.
17. LAI, C., GONG, L., KOVED, L., NADALIN, A. J., AND SCHEMERS, R. 1999. User authentication and authorization in the Java platform. In Proceedings of the Annual Computer Security Applications Conference. 285-290. URL: http://java.sun.com/people/gong/papers/jass.pdf.
18. MOGGI, E. 1989. Computational λ-calculus and monads. In Proceedings of the IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press, Los Alamitos, Calif., 14-23. URL: http://www.disi.unige. it/person/MoggiE/ftp/lics89.ps.gz.
19. NAUMOVICH, G. 2002. A conservative algorithm for computing the flow of permissions in Java programs. In Proceedings of the International Symposium on Software Testing and Analysis (ISSTA). 33-43. URL: http://cis.poly.edu/gnaumovi/ papers/permission-analysis.ps.
20. ODERSKY, M., SULZMANN, M., AND WEHR, M. 1999. Type inference with constrained types. Theory Pract. Obj. Syst. 5, 1, 35-55. URL: http://www.comp.nus.edu.sg/~sulzmann/publications/tapos.ps.
21. PESSAUX, F. AND LEROY, X. 2000. Type-based analysis of uncaught exceptions. ACM Trans. Prog. Lang. Syst. 22, 2, 340-377. URL: http://pauillac.inria.fr/~xleroy/publi/exceptions-toplas.ps.gz.
22. PEYTON JONES, S. AND WADLER, P. 1993. Imperative functional programming. In Proceedings of the ACM Symposium on Principles of Programming Languages (POPL). ACM, New York. URL: http://www.research.avayalabs.com/user/wadler/ papers/imperative/imperative.ps.gz.
23. POTTIER, F. 2000. A versatile constraint-based type inference system. Nordic J. Comput. 7, 4 (Nov.), 312-347. URL: http://pauillac.inria.fr/~fpottier/ publis/fpottier-njc-2000.ps.gz.
24. POTTIER, F. 2003. A constraint-based presentation and generalization of rows. In Proceedings of the IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press, Los Alamitos, Calif., 331-340. URL: http://pauillac.inria.fr/~fpottier/publis/fpottier-lics03.ps.gz.
25. POTTIER, F. AND CONCHON, S. 2000. Information flow inference for free. In Proceedings of the ACM International Conference on Functional Programming (ICFP). ACM, New York, 46-57. URL: http://pauillac.inria.fr/~fpottier/publis/ fpottier-conchon-icfp00.ps.gz.
26. POTTIER, F., SKALKA, C., AND SMITH, S. 2001. A systematic approach to static access control. In Proceedings of the European Symposium on Programming (ESOP). Lecture Notes in Computer Science, vol. 2028. Springer-Verlag, New York, 30-45. URL: http://pauillac.inria.fr/~fpottier/publis/fpottier-skalka-smith- esop01.ps.gz.
27. RÉMY, D. 1992a. Extending ML type system with a sorted equational theory. Tech. Rep. 1766, INRIA, Rocquencourt, BP 105, 78153 Le Chesnay Cedex, France. URL: ftp://ftp.inria.fr/INRIA/Projects/cristal/Didier.Remy/eq-theory-on- types.ps.gz.
28. RÉMY, D. 1992b. Projective ML. In Proceedins of the ACM Symposium on LISP and Functional Programming (LFP). ACM, New York, 66-75. URL: ftp://ftp.inria.fr/INRIA/Projects/cristal/Didier.Remy/lfp92.ps.gz.
29. RÉMY, D. 1994. Type inference for records in a natural extension of ML. In Theoretical Aspects of Object-Oriented Programming. Types, Semantics and Language Design, C. A. Gunter and J. C. Mitchell, Eds. MIT Press, Cambridge, Mass. URL: ftp://ftp.inria.fr/INRIA/Projects/cristal/Didier.Remy/taoopl.ps.gz.
30. SCHNEIDER, F. B. 2000. Enforceable security policies. ACM Trans. Inf. Syst. Sec. 3, 1 (Feb.), 1-50. URL: http://www.cs.cornell.edu/fbs/publications/ EnfSecPols.pdf.
31. SIMONET, V. 2003. Type inference with structural subtyping: a faithful formalization of an efficient constraint solver. In Proceedings of the Asian Symposium on Programming Languages and Systems. URL: http://cristal.inria.fr/ ~simonet/publis/simonet-structural-subtyping.ps.gz.
32. SKALKA, C. 2002. Types for programming language-based security. Ph.D. dissertation. The Johns Hopkins University. URL: http://www.cs.uvn.edu/~skalka/ skalka-pubs/skalka-phdthesis.ps.
33. SKALKA, C. AND POTTIER, F. 2002. Syntactic type soundness for HM(X). In Proceedings of the Workshop on Types in Programming (TIP). Electronic Notes in Theoretical Computer Science, vol. 75. URL: http://pauillac.inria.fr/~fpottier/ publis/skalka-fpottier-tip-02.ps.gz.
34. SKALKA, C. AND SMITH, S. 2000. Static enforcement of security with types. In Proceedings of the ACM International Conference on Functional Programming (ICFP). ACM, New York, 34-45. URL: http://www.cs.uvm.edu/~skalka/skalka-pubs/ skalka-smith-icfp00.ps.
35. SPIVEY, M. 1990. A functional theory of exceptions. Sci. Comput. Prog. 14, 25-42.
36. SU, Z. AND AIKEN, A. 2001. Entailment with conditional equality constraints. In Proceedings of the European Symposium on Programming (ESOP). Lecture Notes in Computer Science, vol. 2028. Springer-Verlag, 170-189. URL: http://www.cs.ucdavis.edu/~su/publications/esop01.pdf.
37. SULZMANN, M. 2000. A general framework for Hindley/Milner type systems with constraints. Ph.D. dissertation, Yale University, Department of Computer Science. URL: http://www.comp.nus.edu.sg/~sulzmann/publications/diss.ps.gz.
38. SULZMANN, M., MÜLLER, M., AND ZENGER, C. 1999. Hindley/Milner style type systems in constraint form. Research Report ACRC-99-009, University of South Australia, School of Computer and Information Science. July. URL: http://www.ps.uni-sb.de/~mmueller/papers/hm-constraints.ps.gz.
39. THIEMANN, P. 2001. Enforcing security properties using type specialization. In Proceedings of the European Symposium on Programming (ESOP). Lecture Notes in Computer Science. Springer-Verlag, New York, URL: http://www.informatik.uni-freiburg.de/~thiemann/papers/espps-het.ps.gz.
40. WADLER, P. AND THIEMANN, P. 2003. The marriage of effects and monads. ACM Trans. Comput. Logic 4, 1 (Jan.), 1-32. URL: http://www.research.avayalabs.com/ user/wadler/papers/effectstocl/effectstocl.ps.gz.
41. WADLER, P. L. 1985. How to replace failure by a list of successes. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture (FPCA). Lecture Notes in Computer Science, vol. 201. Springer-Verlag, New York, 113-128.
42. WALKER, D. 2000. A type system for expressive security policies. In Proceedings of the ACM Symposium on Principles of Programming Languages (POPL). 254-267. URL: http://www.cs.cornell.edu/home/walker/papers/sa-popl00_ps.gz.
43. WALLACH, D. S. 1999. A new approach to mobile code security. Ph.D. dissertation, Princeton University. URL: http://www.cs.princeton.edu/sip/pub/ dwallach-dissertation.html.
44. WALLACH, D. S., APPEL, A. W., AND FELTEN, E. W. 2000. SAFKASI: A security mechanism for language-based systems. ACM Trans. Softw. Eng. Method. 9, 4 (Oct.), 341-378. URL: http://www.cs.rice.edu/~dwallach/pub/tosem2000.ps.
45. WRIGHT, A. K. AND CARTWRIGHT, R. 1997. A practical soft type system for Scheme. ACM Trans. Prog. Lang. Syst. 19, 1 (Jan.), 87-152. URL: http://doi.acm.org/10.1145/239912.239917.
46. WRIGHT, A. K. AND FELLEISEN, M. 1994. A syntactic approach to type soundness. Inf. Comput. 115, 1 (Nov.), 38-94. URL: http://www.cs.rice.edu/CS/ PLT/Publications/Scheme/ic94-wf.ps.gz.