@inproceedings{f9429583d61842ae82e266867b41c864,
title = "Efficient trust management policy analysis from rules",
abstract = "This paper describes a systematic method for deriving efficient algorithms and precise time complexities from extended Datalog rules as it is applied to the analysis of trust management policies specified in SPKI/SDSI, a well-known trust management framework designed to facilitate the development of secure and scalable distributed computing systems. The approach of expressing policy analysis problems as extended Datalog rules is much simpler than previous techniques for analysis of SPKI/SDSI policies. Our method also derives better, more precise time complexities than before in addition to generating complete algorithms and data structures. The method is general, with many applications beyond policy analysis. It extends our previous method for Datalog to handle list constructors, external functions, and queries.",
keywords = "Access control, Algorithm, Policy analysis, Security, Time complexity",
author = "Katia Hristova and Tekle, \{K. Tuncay\} and Liu, \{Yanhong A.\}",
year = "2007",
doi = "10.1145/1273920.1273950",
language = "English",
isbn = "1595937692",
series = "PPDP'07: Proceedings of the 9th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming",
pages = "211--220",
booktitle = "PPDP'07",
note = "9th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP'07 ; Conference date: 14-07-2007 Through 16-07-2007",
}