{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:17:46Z","timestamp":1725520666573},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540894384"},{"type":"electronic","value":"9783540894391"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89439-1_47","type":"book-chapter","created":{"date-parts":[[2008,11,15]],"date-time":"2008-11-15T03:03:10Z","timestamp":1226718190000},"page":"682-696","source":"Crossref","is-referenced-by-count":3,"title":["Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation"],"prefix":"10.1007","author":[{"given":"John P.","family":"Gallagher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mads","family":"Rosendahl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-540-79980-1_6","volume-title":"Algebraic Methodology and Software Technology","author":"E. Balland","year":"2008","unstructured":"Balland, E., Boichut, Y., Moreau, P.-E., Genet, T.: Towards an efficient implementation of tree automata completion. In: Meseguer, J., Ro\u015fu, G. (eds.) AMAST 2008. LNCS, vol.\u00a05140, pp. 67\u201382. Springer, Heidelberg (2008)"},{"key":"47_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-540-73449-9_6","volume-title":"Term Rewriting and Applications","author":"Y. Boichut","year":"2007","unstructured":"Boichut, Y., Genet, T., Jensen, T.P., Roux, L.L.: Rewriting approximations for fast prototyping of static analyzers. In: Baader, F. (ed.) RTA 2007. LNCS, vol.\u00a04533, pp. 48\u201362. Springer, Heidelberg (2007)"},{"key":"47_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-58485-4_33","volume-title":"Static Analysis","author":"D. Boulanger","year":"1994","unstructured":"Boulanger, D., Bruynooghe, M.: A systematic construction of abstract domains. In: LeCharlier, B. (ed.) SAS 1994. LNCS, vol.\u00a0864, pp. 61\u201377. Springer, Heidelberg (1994)"},{"key":"47_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1007\/3-540-58402-1_30","volume-title":"Proc. 6th International Symposium on Programming Language Implementation and Logic Programming, PLILP 1994","author":"D. Boulanger","year":"1994","unstructured":"Boulanger, D., Bruynooghe, M., Denecker, M.: Abstracting s-semantics using a model-theoretic approach. In: Hermenegildo, M., Penjam, J. (eds.) PLILP 1994. LNCS, vol.\u00a0844, pp. 432\u2013446. Springer, Heidelberg (1994)"},{"key":"47_CR5","first-page":"669","volume-title":"Proceedings of ICLP\/SLP","author":"M. Bruynooghe","year":"1988","unstructured":"Bruynooghe, M., Janssens, G.: An instance of abstract interpretation integrating type and mode inferencing. In: Kowalski, R., Bowen, K. (eds.) Proceedings of ICLP\/SLP, pp. 669\u2013683. MIT Press, Cambridge (1988)"},{"key":"47_CR6","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (1999), http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proceedings of the 4th ACM Symposium on Principles of Programming Languages, Los Angeles, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"key":"47_CR8","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: Handbook of Theoretical Computer Science, Formal Models and Semantics, vol B, pp. 243\u2013320. Elsevier and MIT Press (1990)","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"issue":"3-4","key":"47_CR9","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10817-004-6246-0","volume":"33","author":"G. Feuillade","year":"2004","unstructured":"Feuillade, G., Genet, T., Tong, V.V.T.: Reachability analysis over term rewriting systems. J. Autom. Reasoning\u00a033(3-4), 341\u2013383 (2004)","journal-title":"J. Autom. Reasoning"},{"key":"47_CR10","unstructured":"Fr\u00fchwirth, T., Shapiro, E., Vardi, M., Yardeni, E.: Logic programs as types for logic programs. In: Proceedings of the IEEE Symposium on Logic in Computer Science, Amsterdam (July 1991)"},{"key":"47_CR11","first-page":"351","volume-title":"Proc. of International Logic Programming Symposium","author":"J.P. Gallagher","year":"1995","unstructured":"Gallagher, J.P., Boulanger, D., Sa\u011flam, H.: Practical model-based static analysis for definite logic programs. In: Lloyd, J.W. (ed.) Proc. of International Logic Programming Symposium, pp. 351\u2013365. MIT Press, Cambridge (1995)"},{"key":"47_CR12","volume-title":"Proceedings of the International Conference on Logic Programming (ICLP 1994)","author":"J.P. Gallagher","year":"1994","unstructured":"Gallagher, J.P., de Waal, D.: Fast and precise regular approximation of logic programs. In: Van Hentenryck, P. (ed.) Proceedings of the International Conference on Logic Programming (ICLP 1994), Santa Margherita Ligure. MIT Press (1994)"},{"key":"47_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-27775-0_3","volume-title":"Logic Programming","author":"J.P. Gallagher","year":"2004","unstructured":"Gallagher, J.P., Henriksen, K.S.: Abstract domains based on regular types. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol.\u00a03132, pp. 27\u201342. Springer, Heidelberg (2004)"},{"key":"47_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/11562931_22","volume-title":"Logic Programming","author":"J.P. Gallagher","year":"2005","unstructured":"Gallagher, J.P., Henriksen, K.S., Banda, G.: Techniques for scaling up analyses based on pre-interpretations. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol.\u00a03668, pp. 280\u2013296. Springer, Heidelberg (2005)"},{"key":"47_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45587-6_16","volume-title":"Practical Aspects of Declarative Languages","author":"J.P. Gallagher","year":"2002","unstructured":"Gallagher, J.P., Puebla, G.: Abstract interpretation over non-deterministic finite tree automata for set-based analysis of logic programs. In: Krishnamurthi, S., Ramakrishnan, C.R. (eds.) PADL 2002. LNCS, vol.\u00a02257. Springer, Heidelberg (2002)"},{"key":"47_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/3-540-45653-8_48","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"T. Genet","year":"2001","unstructured":"Genet, T., Tong, V.V.T.: Reachability analysis of term rewriting systems with timbuk. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS, vol.\u00a02250, pp. 695\u2013706. Springer, Heidelberg (2001)"},{"key":"47_CR17","first-page":"197","volume-title":"Proceedings of the 17th Annual ACM Symposium on Principles of Programming Languages","author":"N. Heintze","year":"1990","unstructured":"Heintze, N., Jaffar, J.: A Finite Presentation Theorem for Approximating Logic Programs. In: Proceedings of the 17th Annual ACM Symposium on Principles of Programming Languages, pp. 197\u2013209. ACM Press, San Francisco (1990)"},{"key":"47_CR18","series-title":"Lecture Notes in Computer Science","first-page":"195","volume-title":"Proc. 6th Conference on Logic Programming","author":"K. Horiuchi","year":"1987","unstructured":"Horiuchi, K., Kanamori, T.: Polymorphic type inference in Prolog by abstract interpretation. In: Proc. 6th Conference on Logic Programming. LNCS, vol.\u00a0315, pp. 195\u2013214. Springer, Heidelberg (1987)"},{"key":"47_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/3-540-61464-8_65","volume-title":"Rewriting Techniques and Applications","author":"F. Jacquemard","year":"1996","unstructured":"Jacquemard, F.: Decidable approximations of term rewriting systems. In: Ganzinger, H. (ed.) RTA 1996. LNCS, vol.\u00a01103, pp. 362\u2013376. Springer, Heidelberg (1996)"},{"key":"47_CR20","unstructured":"Jones, N.: Flow analysis of lazy higher order functional programs. In: Abramsky, S., Hankin, C. (eds.) Abstract Interpretation of Declarative Languages, Ellis-Horwood (1987)"},{"issue":"1-3","key":"47_CR21","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.tcs.2006.12.030","volume":"375","author":"N.D. Jones","year":"2007","unstructured":"Jones, N.D., Andersen, N.: Flow analysis of lazy higher-order functional programs. Theor. Comput. Sci.\u00a0375(1-3), 120\u2013136 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"47_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J. Lloyd","year":"1987","unstructured":"Lloyd, J.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)","edition":"2"},{"key":"47_CR23","unstructured":"Mishra, P.: Towards a theory of types in Prolog. In: Proceedings of the IEEE International Symposium on Logic Programming (1984)"},{"key":"47_CR24","first-page":"456","volume-title":"Information Processing","author":"J.C. Reynolds","year":"1969","unstructured":"Reynolds, J.C.: Automatic construction of data set definitions. In: Morrell, J. (ed.) Information Processing, vol.\u00a068, pp. 456\u2013461. North-Holland, Amsterdam (1969)"},{"key":"47_CR25","unstructured":"Ullman, J.: Principles of Knowledge and Database Systems, vol. 1. Computer Science Press (1988)"},{"issue":"3","key":"47_CR26","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0743-1066(94)00021-W","volume":"22","author":"P. Hentenryck Van","year":"1994","unstructured":"Van Hentenryck, P., Cortesi, A., Le Charlier, B.: Type analysis of Prolog using type graphs. Journal of Logic Programming\u00a022(3), 179\u2013210 (1994)","journal-title":"Journal of Logic Programming"},{"key":"47_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/3-540-45789-5_10","volume-title":"Static Analysis","author":"C. Vaucheret","year":"2002","unstructured":"Vaucheret, C., Bueno, F.: More precise yet efficient type inference for logic programs. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 102\u2013116. Springer, Heidelberg (2002)"},{"key":"47_CR28","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1145\/996841.996859","volume-title":"PLDI","author":"J. Whaley","year":"2004","unstructured":"Whaley, J., Lam, M.S.: Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In: Pugh, W., Chambers, C. (eds.) PLDI, pp. 131\u2013144. ACM, New York (2004)"},{"key":"47_CR29","unstructured":"Whaley, J., Unkel, C., Lam, M.S.: A bdd-based deductive database for program analysis (2004), http:\/\/bddbddb.sourceforge.net\/"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89439-1_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T03:01:52Z","timestamp":1684638112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89439-1_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540894384","9783540894391"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89439-1_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}