{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:00:43Z","timestamp":1725516043169},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540799795"},{"type":"electronic","value":"9783540799801"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79980-1_26","type":"book-chapter","created":{"date-parts":[[2008,7,28]],"date-time":"2008-07-28T15:55:42Z","timestamp":1217260542000},"page":"346-361","source":"Crossref","is-referenced-by-count":4,"title":["Generating Specialized Rules and Programs for Demand-Driven Analysis"],"prefix":"10.1007","author":[{"given":"K. Tuncay","family":"Tekle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katia","family":"Hristova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanhong A.","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-3","key":"26_CR1","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0304-3975(02)00730-2","volume":"308","author":"F.N. Afrati","year":"2003","unstructured":"Afrati, F.N., Gergatsoulis, M., Toni, F.: Linearisability on datalog programs. Theoretical Computer Science\u00a0308(1-3), 199\u2013226 (2003)","journal-title":"Theoretical Computer Science"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Bancilhon, F., Ramakrishnan, R.: An amateur\u2019s introduction to recursive query processing strategies. In: Proc. of the 1986 ACM SIGMOD Intl. Conf. on Management of Data, pp. 16\u201352 (1986)","DOI":"10.1145\/16894.16859"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Barker, S., Leuschel, M., Varea, M.: Efficient and flexible access control via logic program specialisation. In: Proc. of the 2004 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-based Program Manipulation, pp. 190\u2013199 (2004)","DOI":"10.1145\/1014007.1014026"},{"issue":"1\/2\/3&4","key":"26_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0743-1066(91)90038-Q","volume":"10","author":"C. Beeri","year":"1991","unstructured":"Beeri, C., Ramakrishnan, R.: On the power of magic. J. Logic Programming\u00a010(1\/2\/3&4), 255\u2013299 (1991)","journal-title":"J. Logic Programming"},{"issue":"2","key":"26_CR5","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF03037639","volume":"9","author":"D.R. Brough","year":"1991","unstructured":"Brough, D.R., Hogger, C.J.: Grammar-related transformations of logic programs. New Generation Computing\u00a09(2), 115\u2013134 (1991)","journal-title":"New Generation Computing"},{"key":"26_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83952-8","volume-title":"Logic Programming and Databases","author":"S. Ceri","year":"1990","unstructured":"Ceri, S., Gottlob, G., Tanca, L.: Logic Programming and Databases. Springer, Heidelberg (1990)"},{"issue":"1","key":"26_CR7","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/227595.227597","volume":"43","author":"W. Chen","year":"1996","unstructured":"Chen, W., Warren, D.S.: Tabled evaluation with delaying for general logic programs. J. ACM\u00a043(1), 20\u201374 (1996)","journal-title":"J. ACM"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Consens, M.P., Mendelzon, A.O.: GraphLog: a visual formalism for real life recursion. In: Proc. of the 9th ACM SIGMOD-SIGACT-SIGART Symp. on Principles of Database Systems, pp. 404\u2013416 (1990)","DOI":"10.1145\/298514.298591"},{"issue":"1","key":"26_CR9","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/962446.962450","volume":"51","author":"G. Gottlob","year":"2004","unstructured":"Gottlob, G., Koch, C.: Monadic datalog and the expressive power of languages for web information extraction. J. ACM\u00a051(1), 74\u2013113 (2004)","journal-title":"J. ACM"},{"issue":"3","key":"26_CR10","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1142\/S0129054199000253","volume":"10","author":"S. Greco","year":"1999","unstructured":"Greco, S., Sacc\u00e0, D., Zaniolo, C.: Grammars and automata to optimize chain logic queries. Intl. J. Foundations of Computer Science\u00a010(3), 349 (1999)","journal-title":"Intl. J. Foundations of Computer Science"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Hristova, K., Liu, Y.A.: Improved algorithm complexities for linear temporal logic model checking of pushdown systems. In: Proc. of 7th Intl. Conf. on Verification, Model Checking and Abstract Interpretation, pp. 190\u2013206 (2006)","DOI":"10.1007\/11609773_13"},{"key":"#cr-split#-26_CR12.1","doi-asserted-by":"crossref","unstructured":"Hristova, K., Rothamel, T., Liu, Y.A., Stoller, S.D.: Efficient type inference for secure information flow. In: Technical Report DAR 07-35, Computer Science Department, SUNY Stony Brook (May 2007);","DOI":"10.1145\/1134744.1134759"},{"key":"#cr-split#-26_CR12.2","unstructured":"A preliminary version of this work appeared in Proc. of the 2006 ACM SIGPLAN Workshop on Programming Languages and Analysis for Security"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Hristova, K., Tekle, K.T., Liu, Y.A.: Efficient trust management policy analysis from rules. In: Proc. of the 9th ACM SIGPLAN Intl. Conf. on Principles and Practice of Declarative Programming (July 2007)","DOI":"10.1145\/1273920.1273950"},{"key":"26_CR14","unstructured":"Kifer, M., Lozinskii, E.L.: A framework for an efficient implementation of deductive database systems. In: Proc. of the Advanced Database Symposium (1986)"},{"issue":"3","key":"26_CR15","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/88636.87121","volume":"15","author":"M. Kifer","year":"1990","unstructured":"Kifer, M., Lozinskii, E.L.: On compile-time query optimization in deductive databases by means of static filtering. ACM Trans. Database Systems\u00a015(3), 385\u2013426 (1990)","journal-title":"ACM Trans. Database Systems"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Lam, M.S., Whaley, J., Livshits, V.B., Martin, M.C., Avots, D., Carbin, M., Unkel, C.: Context-sensitive program analysis as database queries. In: Proc. of the 24th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, pp. 1\u201312 (2005)","DOI":"10.1145\/1065167.1065169"},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/3-540-47018-2_5","volume-title":"Partial Evaluation. Practice and Theory","author":"M. Leuschel","year":"1999","unstructured":"Leuschel, M.: Logic program specialisation. In: Hatcliff, J., Mogensen, T.\u00c6., Thiemann, P. (eds.) DIKU 1998. LNCS, vol.\u00a01706, pp. 155\u2013188. Springer, Heidelberg (1999)"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Liu, Y.A., Rothamel, T., Yu, F., Stoller, S.D., Hu, N.: Parametric regular path queries. In: Proc. of the ACM SIGPLAN 2004 Conf. on Programming Language Design and Implementation, pp. 219\u2013230 (2004)","DOI":"10.1145\/996841.996868"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Liu, Y.A., Stoller, S.D.: From datalog rules to efficient programs with time and space guarantees. In: Proc. of the 5th Intl. ACM SIGPLAN Conf. on Principles and Practice of Declarative Programming, pp. 172\u2013183 (2003)","DOI":"10.1145\/888251.888268"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Liu, Y.A., Stoller, S.D.: Querying complex graphs. In: Proc. of the 7th Intl. Symp. on Practical Aspects of Declarative Languages, pp. 199\u2013214 (2006)","DOI":"10.1007\/11603023_14"},{"key":"26_CR21","volume-title":"Computing with logic: logic programming with Prolog","author":"D. Maier","year":"1988","unstructured":"Maier, D., Warren, D.S.: Computing with logic: logic programming with Prolog. Benjamin-Cummings Publishing Co. Inc., Redwood City (1988)"},{"issue":"1-2","key":"26_CR22","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0304-3975(00)00049-9","volume":"248","author":"D. Melski","year":"2000","unstructured":"Melski, D., Reps, T.W.: Interconvertibility of a class of set constraints and context-free-language reachability. Theoretical Computer Science\u00a0248(1-2), 29\u201398 (2000)","journal-title":"Theoretical Computer Science"},{"key":"26_CR23","doi-asserted-by":"crossref","unstructured":"Ramakrishnan, R., Sagiv, Y., Ullman, J.D., Vardi,: Proof-tree transformation theorems and their applications. In: Proc. of the 8th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, pp. 172\u2013181 (1989)","DOI":"10.1145\/73721.73739"},{"key":"26_CR24","doi-asserted-by":"crossref","unstructured":"Sagonas, K.F., Swift, T., Warren, D.S.: XSB as a deductive database. In: Proc. of the 1994 ACM SIGMOD Intl. Conf. on Management of Data, p. 512 (1994)","DOI":"10.1145\/191839.191970"},{"issue":"3","key":"26_CR25","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1145\/88636.89237","volume":"15","author":"W. Zhang","year":"1990","unstructured":"Zhang, W., Yu, C.T., Troy, D.: Necessary and sufficient conditions to linearize double recursive programs in logic databases. ACM Trans. on Database Systems\u00a015(3), 459\u2013482 (1990)","journal-title":"ACM Trans. on Database Systems"}],"container-title":["Lecture Notes in Computer Science","Algebraic Methodology and Software Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79980-1_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T10:17:39Z","timestamp":1684491459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79980-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540799795","9783540799801"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79980-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}