{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:50:50Z","timestamp":1725551450029},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309475"},{"type":"electronic","value":"9783540316855"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11603023_13","type":"book-chapter","created":{"date-parts":[[2005,12,22]],"date-time":"2005-12-22T13:45:28Z","timestamp":1135259128000},"page":"183-198","source":"Crossref","is-referenced-by-count":6,"title":["Efficient Top-Down Set-Sharing Analysis Using Cliques"],"prefix":"10.1007","author":[{"given":"Jorge","family":"Navas","sequence":"first","affiliation":[]},{"given":"Francisco","family":"Bueno","sequence":"additional","affiliation":[]},{"given":"Manuel","family":"Hermenegildo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Amato, G., Scozzari, F.: Optimality in goal-dependent analysis of sharing. Technical Report TR-05-06, Dipartimento di Informatica, Universit\u00e0 di Pisa (2005)"},{"key":"13_CR2","unstructured":"Bruynooghe, M., Codish, M., Mulkers, A.: Abstract unification for a composite domain deriving sharing and freeness properties of program variables. In: de Boer, F.S., Gabbrielli, M. (eds.) Verification and Analysis of Logic Languages, pp. 213\u2013230 (1994)"},{"issue":"1-2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00312-1","volume":"277","author":"R. Bagnara","year":"2002","unstructured":"Bagnara, R., Hill, P.M., Zaffanella, E.: Set-sharing is redundant for pair-sharing. Theoretical Computer Science\u00a0277(1-2), 3\u201346 (2002)","journal-title":"Theoretical Computer Science"},{"key":"13_CR4","unstructured":"Bueno, F., Navas, J., Hermenegildo, M.: Sharing, freeness, linearity, redundancy, widenings, and cliques. Technical Report CLIP5\/2005.0, Technical University of Madrid (UPM), School of Computer Science, UPM (April 2005)"},{"issue":"3","key":"13_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0743-1066(95)00120-4","volume":"28","author":"M. Codish","year":"1996","unstructured":"Codish, M., Dams, D., Fil\u00e9, G., Bruynooghe, M.: On the design of a correct freeness analysis for logic programs. The Journal of Logic Programming\u00a028(3), 181\u2013206 (1996)","journal-title":"The Journal of Logic Programming"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Codish, M., Mulkers, A., Bruynooghe, M., Garc\u00eda de la Banda, M., Hermenegildo, M.: Improving Abstract Interpretations by Combining Domains. In: Proc. ACM SIGPLAN Symposium on Partial Evaluation and Semantics Based Program Manipulation, pp. 194\u2013206. ACM, New York (1993)","DOI":"10.1145\/154630.154650"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/3-540-61756-6_104","volume-title":"Programming Languages: Implementations, Logics, and Programs","author":"C. Fecht","year":"1996","unstructured":"Fecht, C.: An efficient and precise sharing domain for logic programs. In: Kuchen, H., Swierstra, S.D. (eds.) PLILP 1996. LNCS, vol.\u00a01140, pp. 469\u2013470. Springer, Heidelberg (1996)"},{"key":"13_CR8","unstructured":"Fil\u00e9, G.: Share x Free: Simple and correct. Technical Report\u00a015, Dipartamento di Matematica, Universita di Padova (December 1994)"},{"key":"13_CR9","unstructured":"Hermenegildo, M., Bueno, F., Puebla, G., L\u00f3pez-Garc\u00eda, P.: Program Analysis, Debugging and Optimization Using the Ciao System Preprocessor. In: 1999 Int\u2019l. Conference on Logic Programming, pp. 52\u201366. MIT Press, Cambridge (1999)"},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/349214.349216","volume":"22","author":"M. Hermenegildo","year":"2000","unstructured":"Hermenegildo, M., Puebla, G., Marriott, K., Stuckey, P.: Incremental Analysis of Constraint Logic Programs. ACM Transactions on Programming Languages and Systems\u00a022(2), 187\u2013223 (2000)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"13_CR11","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1017\/S1471068403001868","volume":"4","author":"P.M. Hill","year":"2004","unstructured":"Hill, P.M., Zaffanella, E., Bagnara, R.: A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages. Theory and Practice of Logic Programming\u00a04(3), 289\u2013323 (2004)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"2 and 3","key":"13_CR12","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0743-1066(92)90034-Z","volume":"13","author":"D. Jacobs","year":"1992","unstructured":"Jacobs, D., Langen, A.: Static Analysis of Logic Programs for Independent And-Parallelism. Journal of Logic Programming\u00a013(2 and 3), 291\u2013314 (1992)","journal-title":"Journal of Logic Programming"},{"key":"13_CR13","unstructured":"King, A., Soper, P.: Depth-k Sharing and Freeness. In: International Conference on Logic Programming. MIT Press, Cambridge (1994)"},{"key":"13_CR14","unstructured":"Muthukumar, K., Hermenegildo, M.: Deriving A Fixpoint Computation Algorithm for Top-down Abstract Interpretation of Logic Programs. Technical Report ACT-DC-153-90, Microelectronics and Computer Technology Corporation (MCC), Austin, TX 78759 (April 1990)"},{"key":"13_CR15","unstructured":"Muthukumar, K., Hermenegildo, M.: Combined Determination of Sharing and Freeness of Program Variables Through Abstract Interpretation. In: 1991 International Conference on Logic Programming, pp. 49\u201363. MIT Press, Cambridge (1991)"},{"issue":"2\/3","key":"13_CR16","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0743-1066(92)90035-2","volume":"13","author":"K. Muthukumar","year":"1992","unstructured":"Muthukumar, K., Hermenegildo, M.: Compile-time Derivation of Variable Dependency Using Abstract Interpretation. Journal of Logic Programming\u00a013(2\/3), 315\u2013347 (1992)","journal-title":"Journal of Logic Programming"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Mulkers, A., Simoens, W., Janssens, G., Bruynooghe, M.: On the Practicality of Abstract Equation Systems. In: International Conference on Logic Programming. MIT Press, Cambridge (1995)","DOI":"10.7551\/mitpress\/4298.003.0074"},{"key":"13_CR18","unstructured":"Zaffanella, E.: Correctness, Precision and Efficiency in the Sharing Analysis of Real Logic Languages. PhD thesis, School of Computing, University of Leeds, Leeds, U.K. (2001)"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","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":"Zaffanella, E., Bagnara, R., Hill, P.M.: Widening Sharing. In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol.\u00a01702, pp. 414\u2013431. Springer, Berlin (1999)"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11603023_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T22:07:20Z","timestamp":1706825240000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11603023_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309475","9783540316855"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11603023_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}