메뉴 건너뛰기




Volumn , Issue , 2008, Pages 217-225

A rewriting framework for the composition of access control policies

Author keywords

Access control; Distributed systems; Security policies; Term rewriting

Indexed keywords

COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER PROGRAMMING; CONTROL SYSTEMS; FORMAL LANGUAGES; FORMAL LOGIC; PROGRAMMING THEORY; SECURITY SYSTEMS; XML;

EID: 57549084474     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1389449.1389476     Document Type: Conference Paper
Times cited : (21)

References (34)
  • 2
    • 57549112765 scopus 로고    scopus 로고
    • Rewrite systems with abstraction and β-rule: Types, approximants and normalization
    • Proc. of ESOP'96, of
    • S. van Bakel, F. Barbanera, and M. Fernández. Rewrite systems with abstraction and β-rule: Types, approximants and normalization. In Proc. of ESOP'96, volume 1058 of Lecture Notes in Computer Science. Springer, 1996.
    • (1996) Lecture Notes in Computer Science. Springer , vol.1058
    • van Bakel, S.1    Barbanera, F.2    Fernández, M.3
  • 3
    • 0011111917 scopus 로고    scopus 로고
    • Normalization results for typeable rewrite systems
    • S. van Bakel and M. Fernández. Normalization results for typeable rewrite systems. Inf. and Comp., 133(2):73-116, 1997.
    • (1997) Inf. and Comp , vol.133 , Issue.2 , pp. 73-116
    • van Bakel, S.1    Fernández, M.2
  • 4
    • 19244381332 scopus 로고
    • Logic programming and knowledge representation
    • C. Baral and M. Gelfond. Logic programming and knowledge representation. JLP, 19/20:73-148, 1994.
    • (1994) JLP , vol.19-20 , pp. 73-148
    • Baral, C.1    Gelfond, M.2
  • 5
    • 0030408303 scopus 로고    scopus 로고
    • Intersection type assignment systems with higher-order algebraic rewriting
    • F. Barbanera and M. Fernández. Intersection type assignment systems with higher-order algebraic rewriting. Theoretical Computer Science, 170:173-207, 1996.
    • (1996) Theoretical Computer Science , vol.170 , pp. 173-207
    • Barbanera, F.1    Fernández, M.2
  • 8
    • 3042584122 scopus 로고    scopus 로고
    • Flexible access control policy specification with constraint logic programming
    • 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.
    • (2003) ACM Trans, on Information and System Security , vol.6 , Issue.4 , pp. 501-546
    • Barker, S.1    Stuckey, P.2
  • 10
    • 0035790640 scopus 로고    scopus 로고
    • A logical framework for reasoning about access control models
    • ACM
    • E. Bertino, B. Catania, E. Ferrari, and P. Perlasca. A logical framework for reasoning about access control models. In Proc. of SACMAT '01, pages 41-52. ACM, 2001.
    • (2001) Proc. of SACMAT '01 , pp. 41-52
    • Bertino, E.1    Catania, B.2    Ferrari, E.3    Perlasca, P.4
  • 14
    • 0026173872 scopus 로고
    • Polymorphic rewriting conserves algebraic strong normalization
    • V. Breazu-Tannen and J. Gallier. Polymorphic rewriting conserves algebraic strong normalization. Theoretical Computer Science, 83(1), 1991.
    • (1991) Theoretical Computer Science , vol.83 , Issue.1
    • Breazu-Tannen, V.1    Gallier, J.2
  • 15
    • 3042982103 scopus 로고
    • Polymorphic rewriting conserves algebraic confluence
    • V. Breazu-Tannen and J. Gallier. Polymorphic rewriting conserves algebraic confluence. Inform, and Comput., 82:3-28, 1992.
    • (1992) Inform, and Comput , vol.82 , pp. 3-28
    • Breazu-Tannen, V.1    Gallier, J.2
  • 17
    • 84972495850 scopus 로고
    • An extension of the basic functionality theory for the λ-calculus
    • M. Coppo and M. Dezani-Ciancaglini. An extension of the basic functionality theory for the λ-calculus. Notre Dame Journal of Formal Logic, 21(4):685-693, 1980.
    • (1980) Notre Dame Journal of Formal Logic , vol.21 , Issue.4 , pp. 685-693
    • Coppo, M.1    Dezani-Ciancaglini, M.2
  • 19
    • 0346024763 scopus 로고
    • Adding algebraic rewriting to the untyped lambda calculus
    • Proc. of RTA'9l, of, Como, Italy
    • D. J. Dougherty. Adding algebraic rewriting to the untyped lambda calculus. In Proc. of RTA'9l, volume 488 of Lecture Notes in Computer Science, Como, Italy, 1991.
    • (1991) Lecture Notes in Computer Science , vol.488
    • Dougherty, D.J.1
  • 20
    • 33749558954 scopus 로고    scopus 로고
    • Specifying and reasoning about dynamic access-control policies
    • Proc. of IJCAR '06, of, Springer
    • D. J. Dougherty, Kathi Fisler, and Shriram Krishnamurthi. Specifying and reasoning about dynamic access-control policies. In Proc. of IJCAR '06, volume 4130 of Lecture Notes in Computer Science, pages 632-646. Springer, 2006.
    • (2006) Lecture Notes in Computer Science , vol.4130 , pp. 632-646
    • Dougherty, D.J.1    Fisler, K.2    Krishnamurthi, S.3
  • 22
    • 33746103319 scopus 로고    scopus 로고
    • Security policy in a declarative style
    • ACM Press
    • R. Echahed and F. Prost. Security policy in a declarative style. In Proc. of PPDP'05. ACM Press, 2005.
    • (2005) Proc. of PPDP'05
    • Echahed, R.1    Prost, F.2
  • 23
    • 57549107161 scopus 로고    scopus 로고
    • P. Hudak, J. Peterson, and J. Fasel. A gentle introduction to Haskell 98. http://www.haskell.org/tutorial/, 1999.
    • P. Hudak, J. Peterson, and J. Fasel. A gentle introduction to Haskell 98. http://www.haskell.org/tutorial/, 1999.
  • 24
    • 0001619596 scopus 로고    scopus 로고
    • Flexible support for multiple access control policies
    • S. Jajodia, P. Samarati, M. Sapino, and VS. Subrahmaninan. Flexible support for multiple access control policies. ACM TODS, 26(2):214- 260, 2001.
    • (2001) ACM TODS , vol.26 , Issue.2 , pp. 214-260
    • Jajodia, S.1    Samarati, P.2    Sapino, M.3    Subrahmaninan, V.S.4
  • 27
    • 0026852341 scopus 로고
    • Confluence of the lambda calculus with left-linear algebraic rewriting
    • F. Müller. Confluence of the lambda calculus with left-linear algebraic rewriting. Inform. Processing Letters, 41 (6):293-299, 1992.
    • (1992) Inform. Processing Letters , vol.41 , Issue.6 , pp. 293-299
    • Müller, F.1
  • 29
    • 0031071781 scopus 로고    scopus 로고
    • The definition of Extended ML: A gentle introduction
    • D. Sannella S. Kahrs and A. Tarlecki. The definition of Extended ML: A gentle introduction. Theoretical Computer Science, 173(2):445-484, 1997.
    • (1997) Theoretical Computer Science , vol.173 , Issue.2 , pp. 445-484
    • Sannella, D.1    Kahrs, S.2    Tarlecki, A.3
  • 34
    • 3142523600 scopus 로고    scopus 로고
    • A prepositional policy algebra for access control
    • D. Wijesekera and S. Jajodia. A prepositional policy algebra for access control. ACM Trans. Inf. Syst. Secur., 6(2):286-325, 2003.
    • (2003) ACM Trans. Inf. Syst. Secur , vol.6 , Issue.2 , pp. 286-325
    • Wijesekera, D.1    Jajodia, S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.