Program derivation by fixed point computation
Science of Computer Programming
Logic programming and databases
Logic programming and databases
Journal of Logic Programming
Magic templates: a spellbinding approach to logic programs
Journal of Logic Programming
On SDSI's linked local name spaces
Journal of Computer Security
Finite Differencing of Computable Expressions
ACM Transactions on Programming Languages and Systems (TOPLAS)
A logic for SDSI's linked local name spaces
Journal of Computer Security
Distributed credential chain discovery in trust management: extended abstract
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Certificate chain discovery in SPKI?SDSI
Journal of Computer Security
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
DATALOG with Constraints: A Foundation for Trust Management Languages
PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
ConChord: Cooperative SDSI Certificate Storage and Name Resolution
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Beyond Proof-of-Compliance: Safety and Availability Analysis in Trust Management
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
A Logical Language for Expressing Authorizations
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
From datalog rules to efficient programs with time and space guarantees
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
A logical reconstruction of SPKI
Journal of Computer Security - Special issue on CSFW14
Efficient type inference for secure information flow
Proceedings of the 2006 workshop on Programming languages and analysis for security
Journal of Computer Security - Special issue on CSFW15
Improved algorithm complexities for linear temporal logic model checking of pushdown systems
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
A survey of trust in internet applications
IEEE Communications Surveys & Tutorials
Generating Specialized Rules and Programs for Demand-Driven Analysis
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
From datalog rules to efficient programs with time and space guarantees
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
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.