Term rewriting for access control

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

Volumn 4127 LNCS, Issue , 2006, Pages 179-193

  Barker, Steve ^a   Fernández, Maribel ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; DATA PRIVACY; MATHEMATICAL MODELS; HIERARCHICAL SYSTEMS; SECURITY OF DATA;

ACCESS CONTROL; DISCRETIONARY MODELS; ROLE-BASED ACCESS CONTROL (RBAC); ACCESS CONTROL LISTS; ACCESS CONTROL MODELS; ACCESS CONTROL POLICIES; ROLE-BASED ACCESS CONTROL MODEL; SUPPORT FOR SECURITIES; TERM REWRITING; TERM REWRITING SYSTEMS;

SECURITY OF DATA; ACCESS CONTROL;

EID: 33746684330     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11805588_13     Document Type: Conference Paper

References (33)

1. M. Abadi and A. Gordon. A calculus for cryptographic protocols: The spi calculus. In Proc. 4th ACM Conf. on Computer and Communication Security, pages 36-47, 1997.
2. T. Abbes, A. Bouhoula, and M. Rusinowitch. Protocol analysis in intrusion detection using decision tree. In Proc. ITCC'04, pages 404-408, 2004.
3. J. Abendroth and C. Jensen. A unified security mechanism for networked applications. In SAC2003, pages 351-357, 2003.
4. E. Albert, M. Hanus, F. Huch, J. Oliver, and G. Vidal. Operational semantics for declarative multi-paradigm languages. Journal of Symbolic Computation, 2004.
5. F. Baader and T. Nipkow. Term rewriting and all that. Cambridge University Press, 1998.
6. S. Barker. Data protection by logic programming. In Proc. 1st International Conference on Computational Logic, volume 1861 of LNAI, pages 1300-1314. Springer-Verlag, 2000.
7. S. Barker. Protecting deductive databases from unauthorized retrieval and update requests. Journal of Data and Knowledge Engineering, 23(3):231-285, 2002.
8. S. Barker, M. Leuschel, and M. Varea. Efficient and flexible access control via jones optimality logic program specialisation. HOSC, To Appear, 2006.
9. S. Barker and P. Stuckey. Flexible access control policy specification with constraint logic programming. ACM Trans. on Information and System Security, 6(4):501-546, 2003.
10. G. Barthe, G. Dufay, M. Huisman, and S. Melo de Sousa. Jakarta: a toolset to reason about the JavaCard platform. In Proceedings of e-SMART'01, volume 2140 of Lecture Notes in Computer Science. Springer-Verlag, 2002.
11. E. Bertino, B. Catania, E. Ferrari, and P. Perlasca. A system to specify and manage multipolicy access control models. In Proc. IEEE 3rd International Workshop on Policies for Distributed Systems and Networks (POLICY 2002), 2002.
12. E. Bertino, B. Catania, E. Ferrari, and P. Perlasca. A logical framework for reasoning about access control models. In SACMAT, pages 41-52, 2001.
13. P. Borovansky, C. Kirchner, H. Kirchner, and P-E. Moreau. ELAN from a rewriting logic point of view. Theoretical Computer Science, 285:155-185, 2002.
14. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and C. Talcott. The Maude 2.0 system. In Rewriting Techniques and Applications (RTA 2003), number 2706 in Lecture Notes in Computer Science, pages 76-87. Springer-Verlag, 2003.
15. N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science: Formal Methods and Semantics, volume B. North-Holland, 1989.
16. S. De Capitani di Vimercati, S. Paraboschi, and P. Samarati. Access control: principles and solutions. Softw., Pract. Exper., 33(5):397-421, 2003.
17. R. Echahed and F. Prost. Security policy in a declarative style. In Proc. 7th ACM-SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP'05). ACM Press, 2005.
18. M. Fernández. Programming Languages and Operational Semantics: An Introduction. King's College Publications, 2004.
19. M. Fernández and J.-P. Jouannaud. Modular termination of term rewriting systems revisited. In Recent Trends in Data Type Specification. Proc. 10th. Workshop on Specification of Abstract Data Types (ADT'94), number 906 in LNCS, 1995.
20. G. Feuillade, T. Genet, and V. Viet Triem Tong. Reachability Analysis over Term Rewriting Systems. JAR, 33 (3-4):341-383, 2004.
21. M. Hanus. A unified computation model for functional and logic programming. In Proc. 24st ACM Symposium on Principles of Programming Languages (POPL'97), ACM Press, 1997.
22. S. Jajodia, P. Samarati, M. Sapino, and V.S. Subrahmaninan. Flexible support for multiple access control policies. ACM TODS, 26(2):214-260, 2001.
23. C. Kirchner, H. Kirchner, and M. Vittek. ELAN user manual. Nancy (France), 1995. Technical Report 95-R-342, CRIN.
24. J.-W. Klop. Term Rewriting Systems. In S. Abramsky, Dov.M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2. Oxford University Press, 1992.
25. J.-W. Klop, V. van Oostrom, and F. van Raamsdonk. Combinatory reduction systems, introduction and survey. Theoretical Computer Science, 121:279-308, 1993.
26. M. Koch, L. Mancini, and F. Parisi-Presicce. A graph based formalism for rbac. In SACMAT, pages 129-187, 2004.
27. Butler W. Lampson. Protection. SIGOPS Oper. Syst. Rev., 8(1):18-24, 1974.
28. K. Marriott and P.J. Stuckey. Programming with Constraints: an Introduction. MIT Press, 1998.
29. Richard Mayr and Tobias Nipkow. Higher-order rewrite systems and their confluence. Theoretical Computer Science, 192:3-29, 1998.
30. M.H.A. Newman. On theories with a combinatorial definition of equivalence. Annals of Mathematics, 43(2):223-243, 1942.
31. J. Park and R. Sandhu. The uconabc usage control model. ACM Trans. Inf. Syst. Secur., 7(1): 128-174, 2004.
32. R. Sandhu, D. Ferraiolo, and R. Kuhn. The NIST model for role-based access control: Towards a unified standard. In Proc. 4th ACM Workshop on Role-Based Access Control, pages 47-61, 2000.
33. The XSB System Version 2.7.1, Programmer's Manual, 2005.