Local policies for resource usage analysis

ACM Transactions on Programming Languages and Systems

Volumn 31, Issue 6, 2009, Pages

  Bartoletti, Massimo ^a   Degano, Pierpaolo ^b   Ferrari, Gian Luigi ^b   Zunino, Roberto ^c  

^a UNIVERSITY OF CAGLIARI   (Italy)

^b UNIVERSITY OF PISA   (Italy)

^c UNIVERSITY OF TRENTO   (Italy)

Author keywords

Model checking; Type and effect systems; Usage policies

Indexed keywords

LOCAL POLICIES; RESOURCE USAGE ANALYSIS; RUNTIME MONITORS; RUNTIMES; TYPE AND EFFECT SYSTEMS; USAGE POLICIES;

MODEL CHECKING;

EID: 70349755573     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1552309.1552313     Document Type: Article

References (44)

1. Bartoletti, M. 2009. Usage automata. In Proceedings of the Workshop on Issues in the Theory of Security. Lecture Notes in Computer Science, vol.5511. Springer, Berlin, 52-69.
2. Bartoletti, M., Costa, G., Degano, P., Martinelli,F., and Zunino, R. 2009. Securing Java with local policies. J. Object Technol. 8, 4, 5-32.
3. Bartoletti, M., Degano,P., and Ferrari, G.-L. 2004. Stack inspection and secure program transformations. Int. J. Inform. Secur. 2, 3-4, 187-217.
4. Bartoletti, M., Degano,P., and Ferrari, G.-L. 2005a. Checking risky events is enough for local policies. In Proceedings of the 9th Italian Conference on Theoretical Computer Science (ICTCS). Lecture Notes in Computer Science, vol.3701. Springer, Berlin, 97-112.
5. Bartoletti, M., Degano,P., and Ferrari, G.-L. 2005b. Enforcing secure service composition. In Proceedings of the 18th IEEE Computer Security Foundations Workshop (CSFW-18). IEEE Computer Society, Los Alamitos, 211-223. (Full version to appear in J. Comput. Secur.)
6. Bartoletti, M., Degano,P., and Ferrari, G.-L. 2005c. History-based access control with local policies. in Proceedings of the 8th Foundations of Sof tware Science and Computational Structures (FOSSACS). Lecture Notes in Computer Science, vol.3441. Springer, Berlin, 316-332.
7. Bartoletti, M., Degano,P., and Ferrari, G.-L. 2006. Types and effects for secure service orchestration. in Proceedings of the 19th IEEE Computer Security Foundations Workshop. (CSFW-19). IEEE Computer Society, Los Alamitos, 57-69.
8. Bartoletti, M., Degano, P., Ferrari, G.-L., and Zunino, R. 2007. Types and effects for resource usage analysis. In Proceedings of the 10th Foundations of Sof tware Science and Computational Structures (FOSSACS'07). Lecture Notes in Computer Science, vol.4423. Springer, Berlin, 32-47.
9. Bartoletti, M., Degano, P., Ferrari, G. L., and Zunino, R. 2008. Model checking usage policies. In Proceedings of the 4th Trustworthy Global Computing. Lecture Notes in Computer Science, vol.5474. Springer, Berlin, 19-35.
10. Bartoletti,M. and Zunino, R. 2008. LocUsT: A tool for checking usage policies. Tech. rep. TR-08-107, Dipartimento Informatica, Universita Pisa. http://compass2.di.unipi.it/TR/Files/TR-08-07.pdf.gz.
11. Bauer, L., Ligatti,J., and Walker, D. 2002. More enforceable security policies. In Proceedings of the Workshop on Foundations of Computer Security (FCS).
12. Bauer, L., Ligatti,J., and Walker, D. 2005. Composing security policies with Polymer. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI). ACM, New York, 305-314.
13. Bergstra,J. A. and Klop, J. W. 1985. Algebra of communicating processes with abstraction. Theor. Comput. Sci. 37, 77-121.
14. Besson,F., de Grenier de Latour,T., and Jensen, T. P. 2005. Interfaces for stack inspection. J. Functional Program. 15, 2, 179-217.
15. Besson, F., Jensen, T. P., MEtayer, D. L., and Thorn, T. 2001. Model-checking security properties of control flow graphs. J. Comput. Secur. 9, 3, 217-250.
16. Bradfield, J. C. 1996. On the expressivity of the modal mu-calculus. In Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science (STACS'96). Lecture Notes in Computer Science, vol.1046. Springer, Berlin, 479-490.
17. Chaki, S., Rajamani, S. K., and Rehof , J. 2002. Types as models: Model-checking message-passing programs. In Proceedings of the 29th Annual Symposium on Principles of Programming Languages (POPL). ACM, New York, 45-57.
18. Christensen, S. 1993. Decidability and decomposition in process algebras. Ph.D. thesis, Edinburgh university.
19. Colcombet,T. and Fradet, P. 2000. Enforcing trace properties by program transformation. In Proceedings of the 27th Annual Symposium on Principles of Programming Languages (POPL). ACM, New York, 54-66.
20. Dam, M. 1997. On the decidability of process equivalences for the pi-calculus. Theor. Comput. Sci. 183, 2, 215-228.
21. Erlingsson,U. and Schneider, F. B. 1999. SASI enforcement of security policies: A retrospective. In Proceedings of the Workshop on New Security Paradigms. ACM, New York,87-95.
22. Esparza, J. 1994. On the decidability of model checking for several μl-calculi and Petri nets. In Proceedings of the 19th International Colloquium on Trees in Algebra and Programming (CAAP'94). Lecture Notes in Computer Science, vol.787. Springer, Berlin, 115-129.
23. Fong, P. W. 2004. Access control by tracking shallow execution history. In Proceedings of the IEEE Symposium on Security and Privacy (S&P04). IEEE Computer Society, Los Alamitos, 43-55.
24. Fournet, C. and Gordon, A. D. 2003. Stack inspection: Theory and variants. ACMTrans. Program. Lang. Syst. 25, 3, 360-399.
25. Hamlen, K. W., Morrisett, J. G., and Schneider, F. B. 2006. Computability classes for enforcement mechanisms. ACM Trans. Program. Lang. Syst. 28, 1, 175-205.
26. Igarashi,A. and Kobayashi, N. 2002. Resource usage analysis. In Proceedings of the 29th Annual Symposium on Principles of Programming Languages (POPL). ACM, New York, 331-342.
27. Iwama, F., Igarashi, A., and Kobayashi, N. 2006. Resource usage analysis for a functional language with exceptions. in Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation. ACM, New York, 38-47. (Pubitemid 46946395)
28. Kobayashi, N. 2003. Time regions and effects for resource usage analysis. In Proceedings of the ACM SIGPLAN International Workshop on Types in Languages Design and Implementation (TLDI). ACM, New York, 50-61.
29. Kozen, D. 1983. Results on the propositional μ-calculus. Theor. Comput. Sci. 27, 333-354.
30. Marriott, K., Stuckey,P.J., and Sulzmann, M. 2003. Resource usage verification. In Proceedings of the 1st Asian Symposium on Programming Languages and Systems (APLAS'03). Lecture Notesin Computer Science, vol.2895. Springer, Berlin, 212-229.
31. Mayr, R. 1998. Decidability and complexity of model-checking problems for infinite-state systems. Ph.D. thesis, Technischen Universität München.
32. Milner, R., Parrow,J., and Walker, D. 1992. A calculus of mobile processes, I and II. Inform. Comput. 100, 1, 1-40, 41-77.
33. Necula, G. C. 1997. Proof -carrying code. In Proceedings of the 24th Annual Symposium on Principles of Programming Languages (POPL). ACM, New York, 106-119.
34. Nielson,H.R. and Nielson, F. 1994. Higher-order concurrent programs with finite communication topology. In Proceedings of the 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL). ACM, New York.
35. Schneider, F. B. 2000. Enforceable security policies. ACM Trans. Inform. Syst. Secur. 3, 1, 30-50.
36. Skalka, C. 2005. Trace effects and object orientation. In Proceedings of the 7th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP). ACM, New York, 139-150.
37. Skalka,C. and Smith, S. 2004. History effects and verification. In Proceedings of the 2nd Asian Symposium on Programming Languages and Systems (APLAS04). Lecture Notes in Computer Science, vol.3302. Springer, Berlin, 107-128.
38. Skalka, C., Smith,S., and Horn, D. V. 2008. Types and trace effects of higher-order programs. J. Functional Program. 18, 2, 179-249.
39. Talpin, J.-P. and Jouvelot, P. 1992. Polymorphic type, region and effect inference. J. Functional Program. 2, 3, 245-271.
40. Tan, G., Ou, X., and Walker, D. 2003. Resource usage analysis via scoped methods. In Proceedings of the Foundations of Object-Oriented Languages.
41. Thiemann, P. 2003. Program specialization for execution monitoring. J. Functional Program. 13, 3, 573-600.
42. Walker, D. 2000. A type system for expressive security policies. In Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, 254-267.
43. Wallach,D.S., Appel,A.W., and Felten, E. W. 2000. SAFKASI: A security mechanism for language-based systems. ACM Trans. Sof tw. Eng. Methodol. 9, 4, 341-378.
44. Wang, J., Takata,Y., and Seki, H. 2006. HBAC: A model for history-based access control and its model-checking. In Proceedings of the 11th European Symposium on Research in Computer Security (ESORICS'06). Lecture Notes in Computer Science, vol.4189. Springer, Berlin, 263-278.