Abstract
People often need to reason about policy changes before they are adopted. For example, suppose a website manager knows that users want to enter her site without going through the welcome page. To decide whether or not to permit this, the wise manager will consider the consequences of modifying the policies (e.g., would this allow users to bypass advertisements and legal notices?). Similiarly, people often need to compare policy sets. For example, consider a person who wants to buy health insurance. Before choosing a provider, the customer will want to compare the different policies. In other words, the customer wants to reason about the effect of choosing one policy set over another. We introduce a logic, based on propositional dynamic logic, in which these tasks can be done. We give a sound and complete axiomatization for our logic, and also show that it is decidable. More precisely, the satisfiability problem is decidable in nondeterministic exponential time.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Chomicki, J., Lobo, J., Naqvi, S.: A logic programming approach to conflict resolution in policy management. In: Principles of Knowledge Representation and Reasoning: Proc. Ninth International Conference (KR 2000), pp. 121–132 (2000)
ContentGuard. XrML: Extensible rights Markup Language (2001), Available from http://www.xrml.org
Csirmaz, L.: Multi-level permission. Technical Report 90-25, DIMACS (1990)
DeTreville, J.: Binder, a logic-based security language. In: Proceedings of the 2002 IEEE Symposium on Research in Security and Privacy, pp. 95–103. IEEE Computer Society Press, Los Alamitos (2002)
Fisher, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. Journal of Computer and System Sciences 18(2), 194–211 (1979)
Garcia-Molina, H., Ullman, J.D., Widom, J.: Database Systems: The Complete Book. Prentice-Hall, Englewood Cliffs (2002)
Glasgow, J., MacEwen, G., Panangaden, P.: A logic for reasoning about security. ACM Transactions on Computer Systems 10(3), 226–264 (1992)
Halpern, J.Y., Weissman, V.: Using first-order logic to reason about policies. In: Proceedings of the 16th IEEE Computer Security Foundations Workshop, pp. 187–201. IEEE Computer Society Press, Los Alamitos (2003)
Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. The MIT Press, Cambridge (2000)
Hughes, G., Cresswell, M.: An Introduction to Modal Logic. Methuen (1972)
Iannella, R.: Open Digital Rights Language (ODRL) version 1.1, Available from http://www.w3.org/TR/odrl (2002)
Ioannidis, Y., Sellis, T.: Supporting inconsistent rules in database systems. Journal of Intelligent Information Systems 1(3/4), 243–270 (1992)
Jajodia, S., Samarati, P., Sapino, M.L., Subrahmanian, V.S.: Flexible support for multiple access control policies. ACM Transactions on Database Systems 26(2), 214–260 (2001)
Jim, T.: SD3: A trust management system with certified evaluation. In: Proceedings of the 2001 IEEE Symposium on Research in Security and Privacy, pp. 106–115. IEEE Computer Society Press, Los Alamitos (2001)
Kozen, D., Parikh, R.: An elementary proof of the completeness of PDL. Theoretical Computer Science 14, 113–118 (1981)
Li, N., Grosof, B.N., Feigenbaum, J.: Delegation Logic: A logic-based approach to distributed authorization. ACM Transaction on Information and System Security (TISSEC) 6(1), 128–171 (2003)
Li, N., Mitchell, J.C.: Datalog with constraints: A foundation for trust management languages. In: Dahl, V., Wadler, P. (eds.) PADL 2003. LNCS, vol. 2562, pp. 58–73. Springer, Heidelberg (2002)
Li, N., Mitchell, J.C., Winsborough, W.H.: Design of a role-based trust-management framework. In: Proceedings of the 2002 IEEE Symposium on Research on Security and Privacy, pp. 114–130 (2002)
McCarty, L.T.: Permissions and obligations. In: Proceedings of IJCAI 1983, pp. 287–294 (1983)
Mendelson, E.: Introduction to Mathematical Logic. Van Nostrand, NewYork (1964)
van der Meyden, R.: The dynamic logic of permission. Journal of Logic and Computation 6(3), 465–479 (1996)
Meyer, J.-J.C.: A different approach to deontic logic: Deontic logic viewed as a variant of dynamic logic. Notre Dame Journal of Formal Logic 29(1), 109–136 (1988)
Meyer, J.-J.C., Weigand, H., Wieringa, R.: A specification language for static, dynamic and deontic integrity constraints. In: Demetrovics, J., Thalheim, B. (eds.) Mathematical Fundamentals of Database Systems. LNCS, vol. 346. Springer, Heidelberg (1989)
Pfleeger, C.: Security in Computing, 2nd edn. Prentice-Hall, Englewood Cliffs (1997)
Pratt, V.: Process logic. In: Conference Record of the Sixth Annual ACM Symposium on Principles of Programming Languages, pp. 93–100. ACM Press, New York (1979)
Pratt, V.R.: A practical decision method for propositional dynamic logic. In: Proceedings of the 10th Symposium on Theory of Computing, pp. 326–337. ACM Press, New York (1978)
Pucella, R., Weissman, V.: A logic for reasoning about digital rights. In: Proceedings of the 15th IEEE Computer Security Foundations Workshop, pp. 282–294. IEEE Computer Society Press, Los Alamitos (2002)
Segerberg, K.: A completeness theorem in the modal logic of programs. Notices AMS 24(6), A–552 (1977)
Wieringa, R.J., Meyer, J.-J.C.: Applications of deontic logic in computer science: A concise overview. In: Meyer, J.-J.C., Wieringa, R.J. (eds.) Deontic Logic in Computer Science: Normative System Specification, ch. 2, pp. 17–40. John Wiley & Sons, Chichester (1993)
von Wright, G.H.: Deontic logic. Mind 60, 1–15 (1951)
von Wright, G.H.: An essay in deontic logic and the general theory of action. In: Acta Phiiosophica Fennica, vol. 21, North Holland, Amsterdam (1968)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pucella, R., Weissman, V. (2004). Reasoning about Dynamic Policies. In: Walukiewicz, I. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2004. Lecture Notes in Computer Science, vol 2987. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24727-2_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-24727-2_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21298-0
Online ISBN: 978-3-540-24727-2
eBook Packages: Springer Book Archive