{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:30:42Z","timestamp":1761597042112,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540748342"},{"type":"electronic","value":"9783540748359"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74835-9_38","type":"book-chapter","created":{"date-parts":[[2007,9,7]],"date-time":"2007-09-07T14:03:08Z","timestamp":1189173788000},"page":"578-593","source":"Crossref","is-referenced-by-count":19,"title":["Modular Access Control Via Strategic Rewriting"],"prefix":"10.1007","author":[{"given":"Daniel J.","family":"Dougherty","sequence":"first","affiliation":[]},{"given":"Claude","family":"Kirchner","sequence":"additional","affiliation":[]},{"given":"H\u00e9l\u00e8ne","family":"Kirchner","sequence":"additional","affiliation":[]},{"given":"Anderson","family":"Santana de Oliveira","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(99)00207-8","volume":"236","author":"T. Arts","year":"2000","unstructured":"Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science\u00a0236, 133\u2013178 (2000)","journal-title":"Theoretical Computer Science"},{"key":"38_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and all That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and all That. Cambridge University Press, Cambridge (1998)"},{"key":"38_CR3","unstructured":"Balland, E., Brauner, P., Kopetz, R., Moreau, P.-E., Reilles, A.: Tom Manual. LORIA, Nancy (France), version 2.4 edn. (October 2006)"},{"key":"38_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/11784180_7","volume-title":"Algebraic Methodology and Software Technology","author":"E. Balland","year":"2006","unstructured":"Balland, E., Kirchner, C., Moreau, P.-E.: Formal islands. In: Johnson, M., Vene, V. (eds.) AMAST 2006. LNCS, vol.\u00a04019, pp. 51\u201365. Springer, Heidelberg (2006)"},{"key":"38_CR5","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1145\/1065010.1065047","volume-title":"PLDI","author":"L. Bauer","year":"2005","unstructured":"Bauer, L., Ligatti, J., Walker, D.: Composing security policies with polymer. In: Sarkar, V., Hall, M.W. (eds.) PLDI, pp. 305\u2013314. ACM Press, New York (2005)"},{"volume-title":"Term Rewriting Systems","year":"2002","key":"38_CR6","unstructured":"Bezem, M., Klop, J.W., de Vrijer, R. (eds.): Term Rewriting Systems. Cambridge University Press, Cambridge (2002)"},{"issue":"1","key":"38_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/504909.504910","volume":"5","author":"P.A. Bonatti","year":"2002","unstructured":"Bonatti, P.A., di Vimercati, S.D.C., Samarati, P.: An algebra for composing access control policies. ACM Trans. Inf. Syst. Secur.\u00a05(1), 1\u201335 (2002)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"38_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1007\/3-540-58156-1_71","volume-title":"Automated Deduction - CADE-12","author":"A. Bouhoula","year":"1994","unstructured":"Bouhoula, A.: Spike: a system for sufficient completeness and parameterized inductive proofs. In: Bundy, A. (ed.) Automated Deduction - CADE-12. LNCS, vol.\u00a0814, pp. 836\u2013840. Springer, Heidelberg (1994)"},{"key":"38_CR9","first-page":"427","volume":"9","author":"H. Cirstea","year":"2001","unstructured":"Cirstea, H., Kirchner, C.: The rewriting calculus \u2014 Part\u00a0I and II. Logic Journal of the Interest Group in Pure and Applied Logics\u00a09, 427\u2013498 (2001)","journal-title":"Logic Journal of the Interest Group in Pure and Applied Logics"},{"key":"38_CR10","volume-title":"Electronic Notes in Theoretical Computer Science","author":"H. Cirstea","year":"2003","unstructured":"Cirstea, H., Kirchner, C., Liquori, L., Wack, B.: Rewrite strategies in the rewriting calculus. In: Gramlich, B., Lucas, S. (eds.) Electronic Notes in Theoretical Computer Science, vol.\u00a086, Elsevier, Amsterdam (2003)"},{"key":"38_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/3-540-16780-3_85","volume-title":"8th International Conference on Automated Deduction","author":"H. Comon","year":"1986","unstructured":"Comon, H.: Sufficient completness, term rewriting systems and \u201danti-unification. In: Siekmann, J.H. (ed.) 8th International Conference on Automated Deduction. LNCS, vol.\u00a0230, pp. 128\u2013140. Springer, Heidelberg (1986)"},{"key":"38_CR12","unstructured":"de Oliveira, A.S.: Rewriting-based access control policies. In: Fernandez, M., Kirchner, C. (eds.) SecRet\u201906. Proceedings of the 1st International Workshop on Security and Rewriting Techniques (June 2006)"},{"issue":"1 & 2","key":"38_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"Dershowitz, N.: Termination of rewriting. Journal of Symbolic Computation\u00a03(1 & 2), 69\u2013116 (1987)","journal-title":"Journal of Symbolic Computation"},{"key":"38_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-60381-6_6","volume-title":"Conditional and Typed Rewriting Systems","author":"N. Dershowitz","year":"1995","unstructured":"Dershowitz, N.: Hierarchical termination. In: Lindenstrauss, N., Dershowitz, N. (eds.) Conditional and Typed Rewriting Systems. LNCS, vol.\u00a0968, pp. 89\u2013105. Springer, Heidelberg (1995)"},{"key":"38_CR15","unstructured":"Dougherty, D.J.: Core XACML and term-rewriting systems. Technical Report WPI-CS-TR-07-07, Worcester Polytechnic Institute (2007)"},{"key":"38_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/11814771_51","volume-title":"Automated Reasoning","author":"D.J. Dougherty","year":"2006","unstructured":"Dougherty, D.J., Fisler, K., Krishnamurthi, S.: Specifying and reasoning about dynamic access-control policies. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 632\u2013646. Springer, Heidelberg (2006)"},{"key":"38_CR17","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/1140335.1140351","volume-title":"PPDP","author":"I. Gnaedig","year":"2006","unstructured":"Gnaedig, I., Kirchner, H.: Computing constructor forms with non terminating rewrite programs. In: Bossi, A., Maher, M.J. (eds.) PPDP, pp. 121\u2013132. ACM Press, New York (2006)"},{"key":"38_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BFb0013819","volume-title":"Algebraic and Logic Programming","author":"B. Gramlich","year":"1992","unstructured":"Gramlich, B.: Generalized sufficient conditions for modular termination of rewriting. In: Kirchner, H., Levi, G. (eds.) Algebraic and Logic Programming. LNCS, vol.\u00a0632, pp. 53\u201368. Springer, Heidelberg (1992)"},{"key":"38_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/3-540-61464-8_45","volume-title":"Rewriting Techniques and Applications","author":"B. Gramlich","year":"1996","unstructured":"Gramlich, B.: On proving termination by innermost termination. In: Ganzinger, H. (ed.) Rewriting Techniques and Applications. LNCS, vol.\u00a01103, pp. 93\u2013107. Springer, Heidelberg (1996)"},{"key":"38_CR20","first-page":"187","volume-title":"CSFW","author":"J.Y. Halpern","year":"2003","unstructured":"Halpern, J.Y., Weissman, V.: Using first-order logic to reason about policies. In: CSFW, pp. 187\u2013201. IEEE Computer Society Press, Los Alamitos (2003)"},{"issue":"2","key":"38_CR21","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/383891.383894","volume":"26","author":"S. Jajodia","year":"2001","unstructured":"Jajodia, S., Samarati, P., Sapino, M.L., Subrahmanian, V.S.: Flexible support for multiple access control policies. ACM Trans. Database Syst.\u00a026(2), 214\u2013260 (2001)","journal-title":"ACM Trans. Database Syst."},{"key":"38_CR22","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1109\/POLICY.2003.1206966","volume-title":"Policies for Distributed Systems and Networks, 2003. Proceedings. POLICY 2003","author":"A. Kalam","year":"2003","unstructured":"Kalam, A., Baida, R., Balbiani, P., Benferhat, S., Cuppens, F., Deswarte, Y., Miege, A., Saurel, C., Trouessin, G.: Organization based access control. In: Policies for Distributed Systems and Networks, 2003. Proceedings. POLICY 2003. IEEE 4th International Workshop, pp. 120\u2013131. IEEE Computer Society Press, Los Alamitos (2003)"},{"issue":"4","key":"38_CR23","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF01893885","volume":"28","author":"D. Kapur","year":"1991","unstructured":"Kapur, D., Narendran, P., Rosenkrantz, D.J., Zhang, H.: Sufficient-completeness, ground-reducibility and their complexity. Acta Inf.\u00a028(4), 311\u2013350 (1991)","journal-title":"Acta Inf."},{"key":"38_CR24","first-page":"133","volume-title":"Principles and Practice of Constraint Programming","author":"C. Kirchner","year":"1995","unstructured":"Kirchner, C., Kirchner, H., Vittek, M.: Designing clp using computational systems. In: Hentenryck, P.V., Saraswat, S. (eds.) Principles and Practice of Constraint Programming, pp. 133\u2013160. MIT press, Cambridge (1995)"},{"key":"38_CR25","first-page":"263","volume-title":"Computational Problems in Abstract Algebra","author":"D.E. Knuth","year":"1970","unstructured":"Knuth, D.E., Bendix, P.B.: Simple word problems in universal algebras. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 263\u2013297. Pergamon Press, Oxford (1970)"},{"issue":"5","key":"38_CR26","first-page":"633","volume":"31","author":"M. Kurihara","year":"1990","unstructured":"Kurihara, M., Ohuchi, A.: Modularity of simple termination of term rewriting systems. Journal of IPS Japan\u00a031(5), 633\u2013642 (1990)","journal-title":"Journal of IPS Japan"},{"issue":"2","key":"38_CR27","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0304-3975(92)90015-8","volume":"103","author":"M. Kurihara","year":"1992","unstructured":"Kurihara, M., Ohuchi, A.: Modularity of simple termination of term rewriting systems with shared constructors. Theor. Comput. Sci.\u00a0103(2), 273\u2013282 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"38_CR28","first-page":"18","volume":"8","author":"B. Lampson","year":"1974","unstructured":"Lampson, B.: Protection. ACM Operating Systems Review. Vol\u00a08, 18\u201324 (1974)","journal-title":"Vol"},{"key":"38_CR29","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/1180337.1180342","volume-title":"FMSE","author":"A.J. Lee","year":"2006","unstructured":"Lee, A.J., Boyer, J.P., Olson, L., Gunter, C.A.: Defeasible security policy composition for web services. In: Winslett, M., Gordon, A.D., Sands, D. (eds.) FMSE, pp. 45\u201354. ACM Press, New York (2006)"},{"key":"38_CR30","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.entcs.2004.06.020","volume":"117","author":"N. Mart\u00ed-Oliet","year":"2005","unstructured":"Mart\u00ed-Oliet, N., Meseguer, J., Verdejo, A.: Towards a strategy language for maude. Electr. Notes Theor. Comput. Sci.\u00a0117, 417\u2013441 (2005)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"38_CR31","first-page":"396","volume-title":"Proceedings 4th IEEE Symposium on Logic in Computer Science","author":"A. Middeldorp","year":"1989","unstructured":"Middeldorp, A.: A sufficient condition for the termination of the direct sum of term rewriting systems. In: Proceedings 4th IEEE Symposium on Logic in Computer Science, Pacific Grove, pp. 396\u2013401. IEEE Computer Society Press, Los Alamitos (1989)"},{"key":"38_CR32","doi-asserted-by":"crossref","unstructured":"Middeldorp, A., Toyama, Y.: Completeness of combinations of constructor systems. In: Proceedings 4th Conference on Rewriting Techniques and Applications, Como (Italy) (1991) (also Report CS-R9058, CWI (1990))","DOI":"10.1007\/3-540-53904-2_96"},{"key":"38_CR33","series-title":"Lecture Notes in Computer Science","first-page":"61","volume-title":"Compiler Construction","author":"P.-E. Moreau","year":"2003","unstructured":"Moreau, P.-E., Ringeissen, C., Vittek, M.: A pattern matching compiler for multiple target languages. In: Hedin, G. (ed.) CC 2003 and ETAPS 2003. LNCS, vol.\u00a02622, pp. 61\u201376. Springer, Heidelberg (2003)"},{"key":"38_CR34","unstructured":"Moses, T.: eXtensible Access Control Markup Language (XACML) version 2.0. Technical report, OASIS (2005)"},{"key":"38_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3661-8","volume-title":"Advanced Topics in Term Rewriting","author":"E. Ohlebusch","year":"2002","unstructured":"Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer, Heidelberg (2002)"},{"issue":"2","key":"38_CR36","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0020-0190(87)90039-1","volume":"26","author":"M. Rusinowitch","year":"1987","unstructured":"Rusinowitch, M.: On termination of the direct sum of term rewriting systems. Information Processing Letters\u00a026(2), 65\u201370 (1987)","journal-title":"Information Processing Letters"},{"key":"38_CR37","doi-asserted-by":"crossref","unstructured":"Toyama, Y.: Counterexamples to termination for the direct sum of term rewriting systems. Technical report, NTT Electrical Communications Laboratories Japan (1987)","DOI":"10.1016\/0020-0190(87)90122-0"},{"issue":"1","key":"38_CR38","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1145\/7531.7534","volume":"34","author":"Y. Toyama","year":"1987","unstructured":"Toyama, Y.: On the Church-Rosser property for the direct sum of term rewritig systens. Journal of the ACM\u00a034(1), 128\u2013143 (1987)","journal-title":"Journal of the ACM"},{"key":"38_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/3-540-45127-7_27","volume-title":"Rewriting Techniques and Applications","author":"E. Visser","year":"2001","unstructured":"Visser, E.: Stratego: A language for program transformation based on rewriting strategies. System description of Stratego 0.5. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol.\u00a02051, pp. 357\u2013361. Springer, Heidelberg (2001)"},{"issue":"2","key":"38_CR40","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1145\/762476.762481","volume":"6","author":"D. Wijesekera","year":"2003","unstructured":"Wijesekera, D., Jajodia, S.: A propositional policy algebra for access control. ACM Trans. Inf. Syst. Secur.\u00a06(2), 286\u2013325 (2003)","journal-title":"ACM Trans. Inf. Syst. Secur."}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74835-9_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T02:07:43Z","timestamp":1684030063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74835-9_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540748342","9783540748359"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74835-9_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}