{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T14:10:06Z","timestamp":1751983806544,"version":"3.41.2"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Higher-Order and Symbolic Computation"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1023\/a:1012936614361","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T15:14:19Z","timestamp":1040656459000},"page":"143-172","source":"Crossref","is-referenced-by-count":9,"title":["Regular Tree Languages as an Abstract Domain in Program Specialisation"],"prefix":"10.1007","volume":"14","author":[{"given":"John P.","family":"Gallagher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julio C.","family":"Peralta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"385373_CR1","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0743-1066(91)80001-T","volume":"10","author":"M. Bruynooghe","year":"1991","unstructured":"Bruynooghe, M. A practical framework for abstract interpretation of logic programs. Journal of Logic Programming, 10(2) (1991) 91\u2013124.","journal-title":"Journal of Logic Programming"},{"issue":"3","key":"385373_CR2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0743-1066(99)00079-5","volume":"43","author":"M. Codish","year":"2000","unstructured":"Codish, M., Marriott, K., and Taboch, C. Improving program analyses by structure untupling. The Journal of Logic Programming, 43(3) (2000) 251\u2013263.","journal-title":"The Journal of Logic Programming"},{"key":"385373_CR3","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., and Tommasi, M. Tree Automata Techniques and Applications. 1999. http:\/\/www.grappa.univ-lille3.fr\/tata."},{"key":"385373_CR4","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/3-540-55844-6_142","volume":"631","author":"P. Cousot","year":"1992","unstructured":"Cousot, P. and Cousot, R. Comparing the Galois connection and widening\/narrowing approaches to abstract interpretation. In Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming Leuven, Belgium, Springer-Verlag Lecture Notes in Computer Science, Vol. 631, 1992, pp. 269\u2013295.","journal-title":"Springer-Verlag Lecture Notes in Computer Science"},{"key":"385373_CR5","doi-asserted-by":"crossref","unstructured":"Cousot, P. and Cousot, R. Formal language, grammar and set-constraint-based program analysis by abstract interpretation. In Proceedings of the Seventh ACM Conference on Functional Programming Languages and Computer Architecture. La Jolla, California, 1995, pp. 170\u2013181.","DOI":"10.1145\/224164.224199"},{"key":"385373_CR6","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0743-1066(99)00030-8","volume":"41","author":"D. De Schreye","year":"1999","unstructured":"De Schreye, D., Gl\u00fcck, R., J\u00f8 rgensen, J., Leuschel, M., Martens, B., and S\u00f8 rensen, M.H. Conjunctive partial deduction: Foundations, control, algorithms, and experiments. Journal of Logic Programming, 41 (1999) 231\u2013277.","journal-title":"Journal of Logic Programming"},{"key":"385373_CR7","doi-asserted-by":"crossref","unstructured":"de Waal, D. and Gallagher, J. Specialisation of a unification algorithm. In Logic Program Synthesis and Transformation, LOPSTR-91, T. Clement and K.-K. Lau (Eds.). Manchester, 1992.","DOI":"10.1007\/978-1-4471-3494-7_15"},{"key":"385373_CR8","unstructured":"Fr\u00fchwirth, T., Shapiro, E., Vardi, M., and Yardeni, E. Logic programs as types for logic programs. In Proceedings of the IEEE Symposium on Logic in Computer Science, Amsterdam, 1991."},{"key":"385373_CR9","unstructured":"Gallagher, J. A System for specialising logic programs. Technical Report TR\u201391\u201332, University of Bristol, 1991."},{"key":"385373_CR10","doi-asserted-by":"crossref","unstructured":"Gallagher, J. Specialisation of logic programs: A tutorial. In Proceedings PEPM'93, ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation. Copenhagen, 1993, pp. 88\u201398.","DOI":"10.1145\/154630.154640"},{"key":"385373_CR11","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF03037136","volume":"6","author":"J. Gallagher","year":"1988","unstructured":"Gallagher, J., Codish, M., and Shapiro, E. Specialisation of prolog and FCP programs using abstract interpretation. New Generation Computing, 6 (1988) 159\u2013186.","journal-title":"New Generation Computing"},{"key":"385373_CR12","unstructured":"Gallagher, J. and de Waal, D. Fast and precise regular approximation of logic programs. In Proceedings of the International Conference on Logic Programming (ICLP'94), P. Van Hentenryck (Ed.). Santa Margherita Ligure, Italy, 1994."},{"key":"385373_CR13","doi-asserted-by":"crossref","unstructured":"Gallagher, J. and Lafave, L. Regular approximation of computation paths in logic and functional languages. In Partial Evaluation, O. Danvy, R. Gl\u00fcck, and P. Thiemann (Eds.). Springer-Verlag Lecture Notes in Computer Science, Vol. 1110, 1996, pp. 115\u2013136.","DOI":"10.1007\/3-540-61580-6_7"},{"key":"385373_CR14","doi-asserted-by":"crossref","unstructured":"Gurr, C.A. Specialising the ground representation in the logic programming language g\u00f6del. In Logic Program Synthesis and Transformation, LOPSTR'93, Y. Deville (Ed.). Louvain-La-Neuve, 1994.","DOI":"10.1007\/978-1-4471-3234-9_12"},{"key":"385373_CR15","doi-asserted-by":"crossref","unstructured":"Heintze, N. and Jaffar, J. A finite presentation theorem for approximating logic programs. In Proceedings of the 17th Annual ACM Symposium on Principles of Programming Languages, San Francisco, 1990, pp. 197\u2013209.","DOI":"10.1145\/96709.96729"},{"key":"385373_CR16","first-page":"421","volume":"5","author":"P. Hill","year":"1998","unstructured":"Hill, P. and Gallagher, J.P. Meta-programming in logic programming. Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 5, Oxford University Press, 1998, pp. 421\u2013498.","journal-title":"Handbook of Logic in Artificial Intelligence and Logic Programming"},{"issue":"2\/3","key":"385373_CR17","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0743-1066(92)90032-X","volume":"13","author":"G. Janssens","year":"1992","unstructured":"Janssens, G. and Bruynooghe, M. Deriving descriptions of possible values of program variables by means of abstract interpretation. Journal of Logic Programming, 13(2\/3) (1992) 205\u2013258.","journal-title":"Journal of Logic Programming"},{"key":"385373_CR18","doi-asserted-by":"crossref","unstructured":"Jones, N.D. Combining abstract interpretation and partial evaluation. In Symposium on Static Analysis (SAS'97), P. Van Hentenryck (Ed.). Springer-Verlag Lecture Notes in Computer Science, Vol. 1302, 1997, pp. 396\u2013405.","DOI":"10.1007\/BFb0032761"},{"key":"385373_CR19","doi-asserted-by":"crossref","unstructured":"Jones, N.D. and Muchnick, S.S. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In Conference Record of the Ninth Symposium on Principles of Programming Languages, 1982, pp. 66\u201374.","DOI":"10.1145\/582153.582161"},{"key":"385373_CR20","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF03037460","volume":"5","author":"P. Kursawe","year":"1987","unstructured":"Kursawe, P. How to invent a prolog machine. New Generation Computing, 5 (1987) 97\u2013114.","journal-title":"New Generation Computing"},{"key":"385373_CR21","doi-asserted-by":"crossref","unstructured":"Lafave, L. A constraint-based partial evaluator for functional logic programs and its application. Ph.D. Thesis, Department of Computer Science, University of Bristol, 1998.","DOI":"10.1007\/3-540-49674-2_9"},{"key":"385373_CR22","volume-title":"Advanced techniques for logic program specialisation","author":"M. Leuschel","year":"1997","unstructured":"Leuschel, M. Advanced techniques for logic program specialisation. Ph.D. Thesis, Department of Computer Science, K.U. Leuven, 1997."},{"key":"385373_CR23","series-title":"Technical Report Report CW259","volume-title":"Program specialisation and abstract interpretation reconciled","author":"M. Leuschel","year":"1997","unstructured":"Leuschel, M. Program specialisation and abstract interpretation reconciled. Technical Report Report CW259, Department of Computer Science, K.U. Leuven, 1997."},{"key":"385373_CR24","doi-asserted-by":"crossref","unstructured":"Leuschel, M. On the power of homeomorphic embedding for online termination. In Proceedings of the Symposium on Static Analysis (SAS'98), G. Levi (Ed.). Springer-Verlag Lecture Notes in Computer Science, Vol. 1503, 1998, pp. 230\u2013245.","DOI":"10.1007\/3-540-49727-7_14"},{"key":"385373_CR25","unstructured":"Leuschel, M. Program specialisation and abstract interpretation reconciled. In Proceedings of the Joint International Conference and Symposium on Logic Programming JICSLP'98, J. Jaffar (Ed.). Manchester, UK, 1998, pp. 220\u2013234."},{"key":"385373_CR26","doi-asserted-by":"crossref","unstructured":"Leuschel, M. and De Schreye, D. Logic program specialisation: How to be more specific. In Programming Languages: Implementations, Logics, and Programs, 8th International Symposium, PLILP'96, Aachen, Germany, H. Kuchen and S. Doaitse Swierstra (Eds.). Springer-Verlag Lecture Notes in Computer Science, Vol. 1140, Sept. 24\u201327, 1996, pp. 137\u2013151.","DOI":"10.1007\/3-540-61756-6_82"},{"key":"385373_CR27","doi-asserted-by":"crossref","unstructured":"Leuschel, M. and Martens, B. Global control for partial deduction through characteristic atoms and global trees. In Partial Evaluation, O. Danvy, R. Gl\u00fcck, and P. Thiemann (Eds.). Springer-Verlag Lecture Notes in Computer Science, Vol. 1110, 1996, pp. 263\u2013283.","DOI":"10.1007\/3-540-61580-6_13"},{"key":"385373_CR28","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming: 2nd edn.","author":"J. Lloyd","year":"1987","unstructured":"Lloyd, J. Foundations of Logic Programming: 2nd edn. Springer-Verlag, Berlin, 1987."},{"key":"385373_CR29","unstructured":"Mildner, P. Type domains for abstract interpretation: A critical study. Ph.D. Thesis, Department of Computer Science, Uppsala University, 1999."},{"key":"385373_CR30","unstructured":"Mishra, P. Towards a theory of types in prolog. In Proceedings of the IEEE International Symposium on Logic Programming, 1984."},{"key":"385373_CR31","unstructured":"Mogensen, T.\u00c6 . Partially static structures in a self-applicable partial evaluator. In Partial Evaluation and Mixed Computation, D. Bj\u00f8 rner, A. Ershov, and N. Jones (Eds.). 1988, pp. 325\u2013347."},{"issue":"2\/3","key":"385373_CR32","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0743-1066(92)90035-2","volume":"13","author":"K. Muthukumar","year":"1992","unstructured":"Muthukumar, K. and Hermenegildo, M. Compile-time derivation of variable dependency using abstract interpretation. Journal of Logic Programming\n13(2\/3) (1992) 315\u2013347.","journal-title":"Journal of Logic Programming"},{"key":"385373_CR33","doi-asserted-by":"crossref","unstructured":"Peralta, J.C. Analysis and specialisation of imperative programs: An approach using CLP. Ph.D. Thesis, University of Bristol, Department of Computer Science, 2000.","DOI":"10.1007\/10720327_7"},{"key":"385373_CR34","doi-asserted-by":"crossref","unstructured":"Peralta, J. and Gallagher, J. Imperative program specialisation: An approach using CLP. In Logic-Based Program Synthesis and Transformation (LOPSTR'99), A. Bossi (Ed.). Springer-Verlag Lecture Notes in Computer Science, Vol. 1817, 2000, pp. 103\u2013118.","DOI":"10.1007\/10720327_7"},{"key":"385373_CR35","doi-asserted-by":"crossref","unstructured":"Peralta, J., Gallagher, J., and Sa\u011flam, H. Analysis of imperative programs through analysis of constraint logic programs. In Static Analysis. 5th International Symposium, SAS'98, Pisa, G. Levi (Ed.). Springer-Verlag Lecture Notes in Computer Science, Vol. 1503, 1998, pp. 246\u2013261.","DOI":"10.1007\/3-540-49727-7_15"},{"key":"385373_CR36","unstructured":"Puebla, G., Hermenegildo, M., and Gallagher, J.P. An integration of partial evaluation in a generic abstract interpretation framework. In Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM'99), O. Danvy (Ed.). San Antonio, Texas, 1999, pp. 75\u201384."},{"key":"385373_CR37","unstructured":"Reynolds, J.C. Automatic construction of data set definitions. In Information Processing 68, J. Morrell (Ed.). 1969, pp. 456\u2013461."},{"key":"385373_CR38","unstructured":"Reynolds, J.C. Transformational systems and the algebraic structure of atomic formulas. Machine Intelligence, B. Meltzer and D. Mitchie (Eds.). 1970, pp. 135\u2013151."},{"key":"385373_CR39","doi-asserted-by":"crossref","unstructured":"Sa\u011flam, H. and Gallagher, J. Constrained regular approximation of logic programs. In Logic Program Synthesis and Transformation (LOPSTR'97), N. Fuchs (Ed.). Springer-Verlag Lecture Notes in Computer Science, Vol. 1463, 1998.","DOI":"10.1007\/3-540-49674-2_15"},{"key":"385373_CR40","unstructured":"Sahlin, D. An automatic partial evaluator for full prolog. Ph.D. Thesis, The Royal Institute of Technology, 1991."},{"key":"385373_CR41","unstructured":"S\u00f8 rensen, M. and Gl\u00fcck, R. An algorithm of generalisation in positive supercompilation. In Proceedings of the International Symposium on Logic Programming (ILPS'95), J. Lloyd (Ed.). 1995."},{"key":"385373_CR42","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0304-3975(84)90119-1","volume":"34","author":"H. Tamaki","year":"1984","unstructured":"Tamaki, H. and Sato, T. Enumeration of success-patterns in logic programs. Theoretical Computer Science\n34(1984) 227\u2013240.","journal-title":"Theoretical Computer Science"},{"key":"385373_CR43","unstructured":"Tamaki, H. and Sato, T. Unfold\/fold transformation of logic programs. In Proceedings of the Second International Logic Programming Conference, S.-A. Tarnlund (Ed.). 1984, pp. 127\u2013138."},{"key":"385373_CR44","unstructured":"Tamaki, H. and Sato, T. OLDT resolution with tabulation. In Proc. 3rd ICLP, London, E. Shapiro (Ed.). Springer-Verlag Lecture Notes in Computer Science, Vol. 225, 1986."},{"key":"385373_CR45","unstructured":"Turchin, V. The algorithm of generalization in the supercompiler. In Proc. of the IFIP TC2 Workshop on Partial Evaluation and Mixed Computation, D. Bj\u00f8 rner, A. Ershov, and N. Jones (Eds.). 1988, pp. 531\u2013549."},{"issue":"3","key":"385373_CR46","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0743-1066(94)00021-W","volume":"22","author":"P. Van Hentenryck","year":"1994","unstructured":"Van Hentenryck, P., Cortesi, A., and Le Charlier, B. Type analysis of prolog using type graphs. Journal of Logic Programming, 22(3) (1994) 179\u2013210.","journal-title":"Journal of Logic Programming"},{"key":"385373_CR47","unstructured":"Vanhoof, W., Martens, B., Schreye, D.D., and Vlaminck, K.D. Specialising the other way around. In Proceedings of the Joint International Conference and Symposium on Logic Programming, J. Jaffar (Ed.). 1998, pp. 279\u2013293."},{"issue":"2","key":"385373_CR48","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0743-1066(91)80002-U","volume":"10","author":"E. Yardeni","year":"1990","unstructured":"Yardeni, E. and Shapiro, E. A type system for logic programs. Journal of Logic Programming, 10(2) (1990) 125\u2013154.","journal-title":"Journal of Logic Programming"}],"container-title":["Higher-Order and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1012936614361.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1012936614361\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1012936614361.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T13:50:53Z","timestamp":1751982653000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1012936614361"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":48,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["385373"],"URL":"https:\/\/doi.org\/10.1023\/a:1012936614361","relation":{},"ISSN":["1388-3690","1573-0557"],"issn-type":[{"type":"print","value":"1388-3690"},{"type":"electronic","value":"1573-0557"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}