메뉴 건너뛰기




Volumn , Issue , 2004, Pages 190-199

Efficient and flexible access control via logic program specialisation

Author keywords

Cogen Approach; Database Access Control; Datalog; Partial Deduction; Program Transformation

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING LANGUAGES; DATABASE SYSTEMS; LOGIC PROGRAMMING; MATHEMATICAL MODELS; SEMANTICS; WORLD WIDE WEB;

EID: 11244317663     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1014007.1014026     Document Type: Conference Paper
Times cited : (12)

References (23)
  • 1
    • 11244252943 scopus 로고    scopus 로고
    • Protecting deductive databases from unauthorized retrieval and update requests
    • S. Barker. Protecting deductive databases from unauthorized retrieval and update requests. Journal of Data and Knowledge Engineering, 23(3):231-285, 2002.
    • (2002) Journal of Data and Knowledge Engineering , vol.23 , Issue.3 , pp. 231-285
    • Barker, S.1
  • 3
    • 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. A CM Trans. on Information and System Security, 6(4):501-546, 2003.
    • (2003) A CM Trans. on Information and System Security , vol.6 , Issue.4 , pp. 501-546
    • Barker, S.1    Stuckey, P.2
  • 4
    • 0032153903 scopus 로고    scopus 로고
    • An access control model supporting periodicity constraints and temporal reasoning
    • E. Bertino, C. Bettini, E. Ferrari, and P. Samarati. An access control model supporting periodicity constraints and temporal reasoning. ACM TODS, 23(3):231-285, 1998.
    • (1998) ACM TODS , vol.23 , Issue.3 , pp. 231-285
    • Bertino, E.1    Bettini, C.2    Ferrari, E.3    Samarati, P.4
  • 6
    • 11244283283 scopus 로고    scopus 로고
    • Information security 2000
    • A. Briney. Information security 2000. Information Security, pages 40-68, 2000.
    • (2000) Information Security , pp. 40-68
    • Briney, A.1
  • 7
    • 0000826543 scopus 로고
    • Negation as failure
    • H. Gallaire and J. Minker, editors, Plenum
    • K. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Databases, pages 293-322. Plenum, 1978.
    • (1978) Logic and Databases , pp. 293-322
    • Clark, K.1
  • 10
    • 0000146309 scopus 로고
    • Partial evaluation of a computation process - An approach to a compiler-compiler
    • Y. Futamura. Partial evaluation of a computation process - an approach to a compiler-compiler. Systems, Computers, Controls, 2(5):45-50, 1971.
    • (1971) Systems, Computers, Controls , vol.2 , Issue.5 , pp. 45-50
    • Futamura, Y.1
  • 11
    • 0442330459 scopus 로고    scopus 로고
    • Representing agent contracts with exceptions using xml rules, ontologies and process descriptions
    • B. Grosof and T. Poon. Representing agent contracts with exceptions using xml rules, ontologies and process descriptions. In WWW 2003, pages 340-349, 2003.
    • (2003) WWW 2003 , pp. 340-349
    • Grosof, B.1    Poon, T.2
  • 12
    • 0001619596 scopus 로고    scopus 로고
    • Flexible support for multiple access control policies
    • S. Jajodia, P. Samarati, M. Sapino, and V. 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.4
  • 13
    • 84972085882 scopus 로고
    • Partial evaluation, self-application and types
    • M. S. Paterson, editor, LNCS 443, Springer-Verlag
    • N. D. Jones. Partial evaluation, self-application and types. In M. S. Paterson, editor, Automata, Languages and Programming, LNCS 443, pages 639-659, Springer-Verlag, 1990.
    • (1990) Automata, Languages and Programming , pp. 639-659
    • Jones, N.D.1
  • 15
    • 34547157574 scopus 로고    scopus 로고
    • Specializing interpreters using offline partial deduction
    • M. Bruynooghe and K.-K. Lau, editors, LNCS 3049, Springer-Verlag
    • M. Leuschel, S. Craig, M. Bruynooghe, and W. Vanhoof. Specializing interpreters using offline partial deduction. In M. Bruynooghe and K.-K. Lau, editors, Program Development in Computational Logic, LNCS 3049, pages 341-376. Springer-Verlag, 2004.
    • (2004) Program Development in Computational Logic , pp. 341-376
    • Leuschel, M.1    Craig, S.2    Bruynooghe, M.3    Vanhoof, W.4
  • 17
    • 0032142718 scopus 로고    scopus 로고
    • Creating specialised integrity checks through partial evaluation of meta-interpreters
    • M. Leuschel and D. D. Schreye. Creating specialised integrity checks through partial evaluation of meta-interpreters. JLP, 36(1):149-193, 1998.
    • (1998) JLP , vol.36 , Issue.1 , pp. 149-193
    • Leuschel, M.1    Schreye, D.D.2
  • 18
    • 84957807647 scopus 로고    scopus 로고
    • On Jones-optimal specialization for strongly typed languages
    • W. Taha, editor, LNCS 1924, Springer-Verlag
    • H. Makholm. On Jones-optimal specialization for strongly typed languages. In W. Taha, editor, Semantics, Applications, and Implementation of Program Generation, LNCS 1924, pages 129-148. Springer-Verlag, 2000.
    • (2000) Semantics, Applications, and Implementation of Program Generation , pp. 129-148
    • Makholm, H.1
  • 20
    • 0001599027 scopus 로고
    • On the declarative semantics of deductive databases and logic programming
    • J. Minker, editor, Morgan-Kaufmann
    • T. Przymusinski. On the declarative semantics of deductive databases and logic programming. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 193-216. Morgan-Kaufmann, 1988.
    • (1988) Foundations of Deductive Databases and Logic Programming , pp. 193-216
    • Przymusinski, T.1


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