{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:35:09Z","timestamp":1752460509697,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634683"},{"type":"electronic","value":"9783540695769"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0032738","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:56:10Z","timestamp":1133420170000},"page":"127-140","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Set-based analysis for logic programming and tree automata"],"prefix":"10.1007","author":[{"given":"J. M.","family":"Talbot","sequence":"first","affiliation":[]},{"given":"S.","family":"Tison","sequence":"additional","affiliation":[]},{"given":"P.","family":"Devienne","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In 4th ACM Principles of Programming Languages Conference, pages 238\u2013252, 1977.","DOI":"10.1145\/512950.512973"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation and application to logic programs. Journal of Logic Programming, 1992.","DOI":"10.1093\/logcom\/2.4.511"},{"key":"9_CR3","unstructured":"P. Cousot and R. Cousot. Comparing the Galois connection and widenig\/narrowing approaches to abstract interpretation. In Proc. PIPL'92. Springer-Verlag, 1992."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Formal language, grammar and set-constraint-based program analysis by abstract interpretation. In Conference Record of FPCA'95 \u2014 Conference on Functional Programming Languages and Computer Architecture, pages 170\u2013181, 1995.","DOI":"10.1145\/224164.224199"},{"key":"9_CR5","unstructured":"B. Le Charlier and P. Van Hentenryck. Experimental evaluation of a generic abstract interpretation algorithm for Prolog. In Proc. IEEE ICCL 1992, pages 138\u2013146, 1992. [Deu91] A. Deutsch. An operational model of strictness properties and its abstraction. In Proc. 1991 Glasgow University Functional Programming Workshop, pages 82\u201399, 1991."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"T. Fr\u00fchwirth, E. Shapiro, M.Y. Vardi, and E. Yardeni. Logic programs as types for logic programs. In Proceedings of the 6th IEEE-LICS, pages 300\u2013309, jun 1991.","DOI":"10.1109\/LICS.1991.151654"},{"key":"9_CR7","unstructured":"J. Gallagher and D.A. de Waal. Regular approximations of logic programs and their uses. Technical Report CSTR-92-O6, University of Bristol, mar 1992."},{"key":"9_CR8","unstructured":"J. Gallagher and D.A. de Waal. Fast and precise regular approximations of logic programs. In Proceedings of the 11th Int. Conf. on Logic Programming, pages 599\u2013613. MIT-Presse, 1994."},{"key":"9_CR9","volume-title":"Tree Automata","author":"F. G\u00e9cseg","year":"1984","unstructured":"F. G\u00e9cseg and M. Steinby. Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest, 1984."},{"key":"9_CR10","unstructured":"N. Heintze. Practical aspects of set based analysis. In Proceedings of the International Joint Conference and Symposium on Logic Programming, nov 1992."},{"key":"9_CR11","unstructured":"N. Heintze. Set Based Program Analysis. PhD thesis, Carnegie Mellon University, sep 1992."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"N. Heintze. Set-based analysis of ML programs. In Lisp and Functional Programming, pages 306\u2013317. ACM, 1994.","DOI":"10.1145\/182590.182495"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"N. Heintze and J. Jaffar. A finite presentation theorem for approximating logic programs. In Proceedings of the 17th ACMPOPL, pages 197\u2013209, jan 1990.","DOI":"10.1145\/96709.96729"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"N. Heintze and J. Jaffar. An engine for logic program analysis. In Proceedings of the 7th IEEE-LICS, pages 318\u2013328, jun 1992.","DOI":"10.1109\/LICS.1992.185544"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"J. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"9_CR16","unstructured":"P. Mishra. Toward a theory of types in prolog. In Proceedings of the 1st IEEE Symposium on Logic Programming, pages 289\u2013298, jul 1984."},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0004-3702(84)90017-1","volume":"23","author":"A. Mycroft","year":"1984","unstructured":"A. Mycroft and R.A. O'Keefe. A polymorphic type system for prolog. Artificial Intelligence, 23:295\u2013307, 1984.","journal-title":"Artificial Intelligence"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"P. Mishra and U. Reddy. Declaration-free type checking. In Proceedings of the 12 th Annual ACM Symposium on the Principles of Programming Languages, pages 7\u201321, 1985.","DOI":"10.1145\/318593.318603"},{"key":"9_CR19","unstructured":"J. Xu and D.S. Warren. A type inference system for prolog. In Proceedings of the 5th Int. Conf. and Symp. on Logic Programming, pages 604\u2013619. MIT-Press, jul 1988."},{"key":"9_CR20","unstructured":"J. Zobel. Derivation of polymorphic types for prolog programs. In Proceedings of the 4th Int. Conf. on Logic Programming, 1987. *** DIRECT SUPPORT *** A0008C44 00004"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0032738","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T01:45:44Z","timestamp":1736127944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032738"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634683","9783540695769"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0032738","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"15 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}