{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:11:53Z","timestamp":1725495113565},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540412854"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-44404-1_13","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T19:20:51Z","timestamp":1194981651000},"page":"189-206","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Structural Information Analysis for Real CLP Languages"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Bagnara","sequence":"first","affiliation":[]},{"given":"Patricia M.","family":"Hill","sequence":"additional","affiliation":[]},{"given":"Enea","family":"Zaffanella","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","volume-title":"Data-Flow Analysis for Constraint Logic-Based Languages","author":"R. Bagnara","year":"1997","unstructured":"R. Bagnara. Data-Flow Analysis for Constraint Logic-Based Languages. PhD thesis, Dipartimento di Informatica, Universit\u00e0 di Pisa, Italy, March 1997. 190, 195, 197, 202"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"R. Bagnara.A hierarchy of constraint systems for data-flow analysis of constraint logicbased languages. Science of Computer Programming, 30(1-2):119\u2013155, 1998. 195","DOI":"10.1016\/S0167-6423(97)00009-9"},{"key":"13_CR3","unstructured":"R. Bagnara, P. M. Hill, and E. Zaffanella. Efficient structural information analysis for real CLP languages. Quaderno 229, Dipartimento di Matematica, Universit\u00e0 di Parma, 2000. Available at http:\/\/www.cs.unipr.it\/~bagnara . 198, 198, 199, 199, 200, 200, 201, 201"},{"key":"13_CR4","unstructured":"R. Bagnara, P. M. Hill, and E. Zaffanella. Set-sharing is redundant for pair-sharing. Theoretical Computer Science, 2000. To appear. 202"},{"key":"13_CR5","series-title":"Lect Notes Comput Sci","first-page":"471","volume-title":"Factorizing equivalent variable pairs in ROBDD-based implementations of Pos","author":"R. Bagnara","year":"1999","unstructured":"R. Bagnara and P. Schachte. Factorizing equivalent variable pairs in ROBDD-based implementations of Pos. In A. M. Haeberer, editor, Proc. of the \u201c7th Int'l Conf. on Algebraic Methodology and Software Technology\u201d, vol. 1548 of Lecture Notes in Computer Science, pages 471\u2013485, Amazonia, Brazil, 1999. Springer-Verlag, Berlin. 202"},{"key":"13_CR6","unstructured":"R. Bagnara, E. Zaffanella, and P. M. Hill. Enhancing Sharing for precision. In M. C. Meo and M. Vilares Ferro, editors, Proc. of the \u201cAGP\u201999 Joint Conf. on Declarative Programming\u201d, pages 213\u2013227, L\u2019Aquila, Italy, 1999. 202"},{"key":"13_CR7","unstructured":"M. Bruynooghe, M. Codish, and A. Mulkers. Abstract unification for a composite domain deriving sharing and freeness properties of program variables. In F. S.de Boer and M. Gabbrielli, editors, Verification and Analysis of Logic Languages, Proc. of the W2 Post-Conference Workshop, Int'l Conf. on Logic Programming, pages 213\u2013230, Santa argherita igure, Italy, 1994. 205"},{"issue":"3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0743-1066(99)00079-5","volume":"43","author":"M. Codish","year":"2000","unstructured":"M. Codish, K. Marriott, and C. Taboch. Improving program analyses by structure untupling. Journal of Logic Programming, 43(3):251\u2013263, 2000. 192, 206, 206, 206","journal-title":"Journal of Logic Programming"},{"key":"13_CR9","first-page":"231","volume-title":"Logic Programming, APIC Studies in Data Processing","author":"A. Colmerauer","year":"1982","unstructured":"A. Colmerauer. Prolog and infinite trees. In K. L. Clark and S. \u00c5. T\u00e4rnlund, editors, Logic Programming, APIC Studies in Data Processing, vol. 16, pages 231\u2013251. Academic Press, New York, 1982. 190, 191"},{"key":"13_CR10","series-title":"Technical Report","volume-title":"Conceptual and software support for abstract domain design: Generic structural domain and open product","author":"A. Cortesi","year":"1993","unstructured":"A. Cortesi, B. Le Charlier, and P. Van Hentenryck. Conceptual and software support for abstract domain design: Generic structural domain and open product. Technical Report CS-93-13, Brown University, Providence, RI, 1993. 191, 206 a]11._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-3), 2000. 191, 191, 191, 198, 206, 206"},{"issue":"4","key":"13_CR11","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1093\/logcom\/2.4.511","volume":"2","author":"P. Cousot","year":"1992","unstructured":"P. Cousot and R. Cousot. Abstract interpretation frameworks. Journal of Logic and Computation, 2(4):511\u2013547, 1992. 194, 196, 197","journal-title":"Journal of Logic and Computation"},{"key":"13_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/3-540-55844-6_142","volume-title":"Comparing the Galois connection and widening\/narrowing approaches to abstract interpretation","author":"P. Cousot","year":"1992","unstructured":"P. Cousot and R. Cousot. Comparing the Galois connection and widening\/narrowing approaches to abstract interpretation. In M. Bruynooghe and M. Wirsing, editors, Proc. of the 4th Int'l Symp. on Programming Language Implementation and Logic Programming, vol. 631 of Lecture Notes in Computer Science, pages 269\u2013295, Leuven, lgium, 1992. Springer-Verlag, Berlin. 201"},{"issue":"3","key":"13_CR13","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0743-1066(95)00038-0","volume":"25","author":"R. Giacobazzi","year":"1995","unstructured":"R. Giacobazzi, S. K. Debray, and G. Levi. Generalized semantics and abstract interpretation for constraint logic programs. Journal of Logic Programming, 25(3):191\u2013247, 1995. 195","journal-title":"Journal of Logic Programming"},{"key":"13_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/3-540-49727-7_6","volume-title":"The correctness of set-sharing","author":"P. M. Hill","year":"1998","unstructured":"P. M. Hill, R. Bagnara, and E. Zaffanella. The correctness of set-sharing. In G. Levi, editor, Static Analysis: Proc. of the 5th Int'l Symp., vol. 1503 of Lecture Notes in Computer Science, pages 99\u2013114, Pisa, Italy, 1998. Springer-Verlag, Berlin. 202"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19","author":"J. Jaffar","year":"1994","unstructured":"J. Jaffar and M. Maher. Constraint logic programming: A survey. Journal of Logic Programming, 19&amt;20:503\u2013582, 1994. 190, 191, 193, 195, 198","journal-title":"Journal of Logic Programming"},{"issue":"3","key":"13_CR16","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1145\/129393.129398","volume":"14","author":"J. Jaffar","year":"1992","unstructured":"J. Jaffar, S. Michaylov, P. Stuckey, and R. Yap. The CLP(R) language and system. ACM Transactions on Programming Languages and Systems, 14(3):339\u2013395, 1992. 193","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"13_CR17","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1016\/B978-0-934613-40-8.50019-1","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"J.-L. Lassez","year":"1988","unstructured":"J.-L. Lassez, M. J. Maher, and K. Marriott. Unification revisited. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 587\u2013625. Morgan Kaufmann, Los Altos, Ca., 1988. 191, 194"},{"key":"13_CR18","series-title":"Report CW","volume-title":"On the practicality of abstract equation systems","author":"A. Mulkers","year":"1994","unstructured":"A. Mulkers, W. Simoens, G. Janssens, and M. Bruynooghe. On the practicality of abstract equation systems. Report CW 198, Department of Computer Science, K. U. Leuven, Belgium, 1994. 205"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"A. Mulkers, W. Simoens, G. Janssens, and M. Bruynooghe. On the practicality of abstract equation systems. In L. Sterling, editor, Logic Programming: Proc. of the 12th Int'l Conf. on Logic Programming, MIT Press Series in Logic Programming, pages 781\u2013795, Kanagawa, Japan, 1995. The MIT Press. 205","DOI":"10.7551\/mitpress\/4298.003.0074"},{"key":"13_CR20","volume-title":"Interpr\u00e9tation Abstraite des Programmes Prolog","author":"K. Musumbu","year":"1990","unstructured":"K. Musumbu. Interpr\u00e9tation Abstraite des Programmes Prolog. PhD thesis, Institut d'Informatique, Facult\u00e9s Univ. Notre-Dame de la Paix, Namur, Belgium, 1990. 191"},{"key":"13_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/10704567_25","volume-title":"Principles and Practice of Declarative Programming","author":"E. Zaffanella","year":"1999","unstructured":"E. Zaffanella, R. Bagnara, and P. M. Hill. Widening Sharing. In G. Nadathur, editor, Principles and Practice of Declarative Programming, vol. 1702 of Lecture Notes in Computer Science, pages 414\u2013431, Paris, 1999. Springer-Verlag, Berlin. 202"}],"container-title":["Lecture Notes in Artificial Intelligence","Logic for Programming and Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44404-1_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T00:25:27Z","timestamp":1708302327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44404-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540412854"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-44404-1_13","relation":{},"subject":[]}}