Abstract
We propose an efficient method to evaluate a large class of history-based policies written as logic programs. To achieve this, we dynamically compute, from a given policy set, a finite subset of the history required and sufficient to evaluate the policies. We maintain this history by monitoring rules and transform the policies into a non history-based form. We further formally prove that evaluating history-based policies can be reduced to an equivalent, but more efficient, evaluation of the non history-based policies together with the monitoring rules.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agrawal, D., Calo, S.B., Lee, K.-W., Lobo, J.: Issues in designing a policy language for distributed management of it infrastructures. In: Integrated Network Management, pp. 30–39 (2007)
Bandara, A.K.: A Formal Approach to Analysis and Refinement of Policies. PhD thesis, Imperial College London (2005)
Bonatti, P.A., Olmedilla, D.: Rule-based policy representation and reasoning for the semantic web. In: Reasoning Web, pp. 240–268 (2007)
Chomicki, J.: Efficient checking of temporal integrity constraints using bounded history encoding. ACM Trans. Database Syst. 20(2), 149–186 (1995)
Craven, R., Lobo, J., Lupu, E., Russo, A., Sloman, M.: Decomposition techniques for policy refinement. In: International Conference on Network and Service Management (2010)
Craven, R., Lobo, J., Ma, J., Russo, A., Lupu, E., Bandara, A., Calo, S., Sloman, M.: Expressive policy analysis with enhanced system dynamicity. In: ASIACCS 2009 (2009)
Gabaldon, A.: Non-markovian control in the situation calculus. In: Eighteenth National Conference on Artificial Intelligence, pp. 519–524. American Association for Artificial Intelligence, Menlo Park (2002)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R.A., Bowen, K. (eds.) Proceedings of the Fifth International Conference on Logic Programming, pp. 1070–1080. The MIT Press, Cambridge (1988)
Gelfond, M., Lobo, J.: Authorization and obligation policies in dynamic systems. In: ICLP, pp. 22–36 (2008)
Gonzalez, G., Baral, C., Gelfond, M.: Alan: An action language for modelling non-markovian domains. Studia Logica 79(1), 115–134 (2005)
Gurevich, Y., Neeman, I.: Dkal: Distributed-knowledge authorization language. In: CSF 2008: Proceedings of the 2008 21st IEEE Computer Security Foundations Symposium, pp. 149–162. IEEE Computer Society, Washington, DC (2008)
Jajodia, S., Samarati, P., Sapino, M.L., Subrahmanian, V.S.: Flexible support for multiple access control policies. ACM Trans. Database Syst. 26(2), 214–260 (2001)
Kolovski, V., Hendler, J., Parsia, B.: Analyzing web access control policies. In: WWW 2007: Proceedings of the 16th International Conference on World Wide Web, pp. 677–686. ACM, New York (2007)
Li, N., Mitchell, J.C., Winsborough, W.H.: Beyond proof-of-compliance: security analysis in trust management. J. ACM 52(3), 474–514 (2005)
Lupu, E., Dulay, N., Sloman, M., Sventek, J., Heeps, S., Strowes, S., Twidle, K., Keoh, S.-L., Schaeffer-Filho, A.: Amuse: autonomic management of ubiquitous e-health systems. Concurr. Comput.: Pract. Exper. 20(3), 277–295 (2008)
OASIS. OASIS eXtensible Access Control Markup Language (XACML) TC (2005)
Yemini, S.A., Kliger, S., Mozes, E., Yemini, Y., Ohsie, D.: High speed and robust event correlation. Communications Magazine 34(5), 82–90 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Lobo, J., Ma, J., Russo, A., Lupu, E., Calo, S., Sloman, M. (2011). Refinement of History-Based Policies. In: Balduccini, M., Son, T.C. (eds) Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning. Lecture Notes in Computer Science(), vol 6565. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20832-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-20832-4_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20831-7
Online ISBN: 978-3-642-20832-4
eBook Packages: Computer ScienceComputer Science (R0)