{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T20:40:13Z","timestamp":1737060013740,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430759"},{"type":"electronic","value":"9783540455752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45575-2_40","type":"book-chapter","created":{"date-parts":[[2007,5,31]],"date-time":"2007-05-31T01:30:22Z","timestamp":1180575022000},"page":"406-420","source":"Crossref","is-referenced-by-count":4,"title":["Pos(T ): Analyzing Dependencies in Typed Logic Programs"],"prefix":"10.1007","author":[{"given":"Maurice","family":"Bruynooghe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wim","family":"Vanhoof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Codish","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,12,18]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"K. R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B, Formal Models and Semantics, pages 493\u2013574. Elsevier Science Publishers B.V., 1990.","DOI":"10.1016\/B978-0-444-88074-1.50015-9"},{"key":"40_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Efficient structural information analysis for real CLP languages","author":"R. Bagnara","year":"2000","unstructured":"R. Bagnara, P. M. Hill, and E. Zaffanella. Efficient structural information analysis for real CLP languages. In Proc. LPAR2000, volume 1955 of LNCS. Springer, 2000."},{"key":"40_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BFb0053561","volume-title":"A polyvariant binding-time analysis for off-line partial deduction","author":"M. Bruynooghe","year":"1998","unstructured":"M. Bruynooghe, M. Leuschel, and K. Sagonas. A polyvariant binding-time analysis for off-line partial deduction. In Proc. ESOP\u201998, volume 1381 of LNCS, pages 27\u201341. Springer, 1998."},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"F. Bueno, M. de la Banda, M. Hermenegildo, K. Marriott, G. Puebla, and P. Stuckey. A model for inter-module analysis and optimizing compilation. In Preproceedings LOPSTR2000, 2000.","DOI":"10.1007\/3-540-45142-0_6"},{"issue":"3","key":"40_CR5","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/S0743-1066(98)10024-9","volume":"38","author":"M. Codish","year":"1999","unstructured":"M. Codish. Efficient goal directed bottom-up evaluation of logic programs. J. Logic Programming, 38(3):354\u2013370, 1999.","journal-title":"J. Logic Programming"},{"key":"40_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/3-540-58485-4_47","volume-title":"Deriving polymorphic type dependencies for logic programs using multiple incarnations of prop","author":"M. Codish","year":"1994","unstructured":"M. Codish and B. Demoen. Deriving polymorphic type dependencies for logic programs using multiple incarnations of prop. In Proc. SAS\u201994, volume 864 of LNCS, pages 281\u2013296. Springer, 1994."},{"issue":"3","key":"40_CR7","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0743-1066(95)00064-X","volume":"25","author":"M. Codish","year":"1995","unstructured":"M. Codish and B. Demoen. Analyzing logic programs using \u201cPROP\u201d-ositional logic programs and a magic wand. J. Logic Programming, 25(3):249\u2013274, 1995.","journal-title":"J. Logic Programming"},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"M. Codish, K. Marriott, and C. Taboch. Improving program analyses by structure untupling. Journal Logic Programming, 43(3), June 2000.","DOI":"10.1016\/S0743-1066(99)00079-5"},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"A. Cortesi, G. Fil\u00e9, and W. Winsborough. Prop revisited: propositional formula as abstract domain for groundness analysis. In Proc. LICS\u201991, pages 322\u2013327. IEEE Press, 1991.","DOI":"10.1109\/LICS.1991.151656"},{"issue":"2","key":"40_CR10","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0743-1066(95)00123-9","volume":"27","author":"A. Cortesi","year":"1996","unstructured":"A. Cortesi, G. Fil\u00e9, and W. H. Winsborough. Optimal groundness analysis using propositional logic. J. Logic Programming, 27(2):137\u2013167, 1996.","journal-title":"J. Logic Programming"},{"issue":"1\u20133","key":"40_CR11","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0167-6423(99)00045-3","volume":"38","author":"A. Cortesi","year":"2000","unstructured":"A. Cortesi, B. Le Charlier, and P. Van Hentenryck. Combinations of abstract domains for logic programming: open product and generic pattern construction. Science of Computer Programming, 38(1\u20133):27\u201371, 2000.","journal-title":"Science of Computer Programming"},{"key":"40_CR12","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 Proc. POPL\u201997, pages 238\u2013252, 1977.","DOI":"10.1145\/512950.512973"},{"key":"40_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/b99475","volume-title":"An overview of HAL","author":"B. Demoen","year":"2004","unstructured":"B. Demoen, M. Garc\u00eda de la Banda, W. Harvey, K. Mariott, and P. Stuckey. An overview of HAL. In Proc. CP\u201999, volume 1713 of LNCS, pages 174\u2013188. Springer, 1999."},{"key":"40_CR14","unstructured":"J. Gallagher, D. Boulanger, and H. Saglam. Practical model-based static analysis for deffinite logic programs. In Proc. ILPS\u201995, pages 351\u2013365. MIT Press, 1995."},{"key":"40_CR15","unstructured":"J. Gallagher and D. A. de Waal. Fast and precise regular approximations of logic programs. In Proc. ICLP\u201994, pages 599\u2013613. MIT Press, 1994."},{"key":"40_CR16","unstructured":"M. Hermenegildo, F. Bueno, G. Puebla, and P. L\u00f3pez. Debugging, and optimization using the Ciao system preprocessor. In Proc. ICLP\u201999, pages 52\u201366, 1999."},{"key":"40_CR17","unstructured":"P. Hill and J. Lloyd. The G\u00f6del Language. MIT Press, 1994."},{"issue":"2&3","key":"40_CR18","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0743-1066(92)90032-X","volume":"13","author":"G. Janssens","year":"1992","unstructured":"G. Janssens and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. J. Logic programming, 13(2&3):205\u2013258, 1992.","journal-title":"J. Logic programming"},{"key":"40_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1007\/3-540-44716-4_19","volume-title":"A framework for analysis of typed logic programs","author":"V. Lagoon","year":"2001","unstructured":"V. Lagoon and P. J. Stuckey. A framework for analysis of typed logic programs. In Proc. FLOPS 2001, volume 2024 of LNCS, pages 296\u2013310. Springer, 2001."},{"issue":"1","key":"40_CR20","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/174625.174627","volume":"16","author":"B. Charlier Le","year":"1994","unstructured":"B. Le Charlier and P. Van Hentenryck. Experimental evaluation of a generic abstract interpretation algorithm for Prolog. ACM TOPLAS, 16(1):35\u2013101, 1994.","journal-title":"ACM TOPLAS"},{"key":"40_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/BFb0056613","volume-title":"An experiment in domain refinement: Type domains and type representations for logic programs","author":"G. Levi","year":"1998","unstructured":"G. Levi and F. Spoto. An experiment in domain refinement: Type domains and type representations for logic programs. In Proc. PLILP\/ALP\u201998, volume 1490 of LNCS, pages 152\u2013169. Springer, 1998."},{"key":"40_CR22","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd. Foundation of Logic Programming. Springer, second edition, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"issue":"1\u20134","key":"40_CR23","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/176454.176519","volume":"2","author":"K. Marriott","year":"1993","unstructured":"K. Marriott and H. S\u00f8ndergaard. Precise and efficient groundness analysis for logic programs. ACM Letters on Programming Languages and Systems, 2(1\u20134):181\u2013196, 1993.","journal-title":"ACM Letters on Programming Languages and Systems"},{"key":"40_CR24","doi-asserted-by":"crossref","unstructured":"A. Mulkers, W. Simoens, G. Janssens, and M. Bruynooghe. On the practicality of abstract equation systems. In Proc. ICLP\u201995, pages 781\u2013795. MIT Press, 1995.","DOI":"10.7551\/mitpress\/4298.003.0074"},{"key":"40_CR25","doi-asserted-by":"crossref","unstructured":"G. Puebla and M. Hermenegildo. Some issues in analysis and specialization of modular Ciao-Prolog programs. In Proc. ICLP Workshop on Optimization and Implementation of Declarative Languages, 1999.","DOI":"10.1016\/S1571-0661(05)80637-1"},{"key":"40_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/10705424_18","volume-title":"Typed static analysis: Application to groundness analysis of Prolog and lambda-Prolog","author":"O. Ridoux","year":"1999","unstructured":"O. Ridoux, P. Boizumault, and F. Mal\u00e9sieux. Typed static analysis: Application to groundness analysis of Prolog and lambda-Prolog. In Proc. FLOPS\u201999, volume 1722 of LNCS, pages 267\u2013283. Springer, 1999."},{"key":"40_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/10720327_6","volume-title":"Mode analysis domains for typed logic programs","author":"J.G. Smaus","year":"2000","unstructured":"J.G. Smaus, P. M. Hill, and A. King. Mode analysis domains for typed logic programs. In Proc. LOPSTR\u201999, volume 1817 of LNCS, pages 82\u2013101. Springer, 2000."},{"issue":"1\u20133","key":"40_CR28","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0743-1066(96)00068-4","volume":"29","author":"Z. Somogyi","year":"1996","unstructured":"Z. Somogyi, F. Henderson, and T. Conway. The execution algorithm of Mercury, an efficient purely declarative logic programming language. J. Logic Programming, 29(1\u20133):17\u201364, October\u2013November 1996.","journal-title":"J. Logic Programming"},{"key":"40_CR29","series-title":"Lect Notes Comput Sci","first-page":"399","volume-title":"Binding-time analysis by constraint solving: a modular and higherorder approach for Mercury","author":"W. Vanhoof","year":"2000","unstructured":"W. Vanhoof. Binding-time analysis by constraint solving: a modular and higherorder approach for Mercury. In Proc. LPAR2000, volume 1955 of LNCS, pages 399\u2013416, Springer, 2000."},{"key":"40_CR30","unstructured":"W. Vanhoof and M. Bruynooghe. Binding-time analysis for Mercury. In Proc. ICLP\u201999, pages 500\u2013514. MIT Press, 1999."}],"container-title":["Lecture Notes in Computer Science","Perspectives of System Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45575-2_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T20:13:02Z","timestamp":1737058382000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45575-2_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430759","9783540455752"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-45575-2_40","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}