The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
A logic model for electronic contracting
Decision Support Systems
Deontic logic: a concise overview
Deontic logic in computer science
Applications of deontic logic in computer science: a concise overview
Deontic logic in computer science
Derivatives of Regular Expressions
Journal of the ACM (JACM)
Model checking
An axiomatic basis for computer programming
Communications of the ACM
A logic for SDSI's linked local name spaces
Journal of Computer Security
Dynamic Logic
Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
The Prescription and Description of State Based Systems
Temporal Logic in Specification
Alternating Automata: Unifying Truth and Validity Checking for Temporal Logics
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
A Logic for Reasoning about Digital Rights
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Models and Languages for Digital Rights
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
A Logical Reconstruction of SPKI
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Formal languages and their relation to automata
Formal languages and their relation to automata
A Logic for Reasoning about Digital Rights
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Proceedings of the 4th ACM workshop on Digital rights management
Modeling and implementation of digital rights
Journal of Systems and Software
Reputation-based trust management
Journal of Computer Security - Special issue on WITS'03
A framework for concrete reputation-systems with applications to history-based access control
Proceedings of the 12th ACM conference on Computer and communications security
A logical framework for history-based access control and reputation systems
Journal of Computer Security
A formal conceptual model for rights
Proceedings of the 8th ACM workshop on Digital rights management
Nuovo DRM Paradiso: Designing a Secure, Verified, Fair Exchange DRM Scheme
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
Digital rights management architectures
Computers and Electrical Engineering
On the operational semantics of rights expression languages
Proceedings of the nineth ACM workshop on Digital rights management
Nuovo DRM paradiso: towards a verified fair DRM scheme
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
An interoperable usage management framework
Proceedings of the tenth annual ACM workshop on Digital rights management
Service licensing: conceptualization, formalization, and expression
Service Oriented Computing and Applications
A domain specific language for usage management
Proceedings of the 11th annual ACM workshop on Digital rights management
Licensing services: formal analysis and implementation
ICSOC'06 Proceedings of the 4th international conference on Service-Oriented Computing
Nuovo DRM Paradiso: Designing a Secure, Verified, Fair Exchange DRM Scheme
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
A policy language for distributed usage control
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
| Hi-index | 0.00 |
We present a logic for reasoning about licenses, which are "terms of use" for digital resources. The logic provides a language for writing both properties of licenses and specifications that govern a client's actions. We discuss the complexity of checking properties and specifiations written in our logic and propose a technique for verification. A key feature of our approach is that it is essentially parameterized by the language in which the licenses are written, provided that this language can be given a trace-based semantics. We consider two license languages to illustrate this flexibility.