{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:44:14Z","timestamp":1725522254334},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540899815"},{"type":"electronic","value":"9783540899822"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89982-2_30","type":"book-chapter","created":{"date-parts":[[2008,12,15]],"date-time":"2008-12-15T03:09:15Z","timestamp":1229310555000},"page":"301-316","source":"Crossref","is-referenced-by-count":1,"title":["Negative Ternary Set-Sharing"],"prefix":"10.1007","author":[{"given":"Eric","family":"Trias","sequence":"first","affiliation":[]},{"given":"Jorge","family":"Navas","sequence":"additional","affiliation":[]},{"given":"Elena S.","family":"Ackley","sequence":"additional","affiliation":[]},{"given":"Stephanie","family":"Forrest","sequence":"additional","affiliation":[]},{"given":"M.","family":"Hermenegildo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58485-4_46","volume-title":"Static Analysis","author":"T. Armstrong","year":"1994","unstructured":"Armstrong, T., Marriott, K., Schachte, P., S\u00f8ndergaard, H.: Boolean functions for dependency analysis: Algebraic properties and efficient representation. In: LeCharlier, B. (ed.) SAS 1994. LNCS, vol.\u00a0864. Springer, Heidelberg (1994)"},{"issue":"2","key":"30_CR2","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.ic.2004.04.005","volume":"193","author":"R. Bagnara","year":"2004","unstructured":"Bagnara, R., Gori, R., Hill, P.M., Zaffanella, E.: Finite-tree analysis for constraint logic-based languages. Information and Computation\u00a0193(2), 84\u2013116 (2004)","journal-title":"Information and Computation"},{"key":"30_CR3","unstructured":"Bruynooghe, M., Codish, M., Mulkers, A.: Abstract unification for a composite domain deriving sharing and freeness properties of program variables. Verification and Analysis of Logic Languages (1994)"},{"issue":"3","key":"30_CR4","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"R.E. Bryant","year":"1992","unstructured":"Bryant, R.E.: Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams. ACM Comput. Surv.\u00a024(3), 293\u2013318 (1992)","journal-title":"ACM Comput. Surv."},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Functional and Logic Programming","author":"F. Bueno","year":"2004","unstructured":"Bueno, F., Garc\u00eda de la Banda, M.: Set-Sharing is not always redundant for Pair-Sharing. In: Kameyama, Y., Stuckey, P.J. (eds.) FLOPS 2004. LNCS, vol.\u00a02998. Springer, Heidelberg (2004)"},{"key":"30_CR6","unstructured":"Bueno, F., Garc\u00eda de la Banda, M., Hermenegildo, M.: Effectiveness of Global Analysis in Strict Independence-Based Automatic Program Parallelization. In: 1994 Intl. Symposium on Logic Programming (1994)"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Codish, M., Lagoon, V., Bueno, F.: An algebraic approach to sharing analysis of logic programs. In: Proc. of the Fourth Intl. Static Analysis Symposium (1997)","DOI":"10.1007\/BFb0032734"},{"key":"30_CR8","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: PEPM 1993 (1993)","DOI":"10.1145\/154630.154650"},{"issue":"3","key":"30_CR9","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"},{"issue":"5","key":"30_CR10","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1145\/330249.330252","volume":"21","author":"M. Codish","year":"1999","unstructured":"Codish, M., S\u00f8ndergaard, H., Stuckey, P.J.: Sharing and groundness dependencies in logic programs. ACM Transactions on Prog. Languages and Systems\u00a021(5), 948\u2013976 (1999)","journal-title":"ACM Transactions on Prog. Languages and Systems"},{"key":"30_CR11","unstructured":"Cousot, P., Cousot, R.: Abs Interp: a Unified Lattice Model for Static Analysis of Programs by Construction or Approx of Fixpoints. In: POPL 1977 (1977)"},{"issue":"3","key":"30_CR12","first-page":"201","volume":"1","author":"F. Esponda","year":"2005","unstructured":"Esponda, F., Ackley, E.S., Forrest, S., Helman, P.: On-line negative databases (with experimental results). Intl. Journal of Unconventional Computing\u00a01(3), 201\u2013220 (2005)","journal-title":"Intl. Journal of Unconventional Computing"},{"key":"30_CR13","unstructured":"Esponda, F., Trias, E.D., Ackley, E.S., Forrest, S.: A relational algebra for negative databases. Technical Report TR-CS-2007-18, University of New Mexico (2007)"},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"30_CR15","doi-asserted-by":"crossref","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. In: TPLP 2004 (2004)","DOI":"10.1017\/S1471068403001868"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Minato, S.: ZBDDs for Set Manipulation in Combinatorial Problems. In: DAC 1993 (1993)","DOI":"10.1145\/157485.164890"},{"issue":"2, 3","key":"30_CR17","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, 3), 291\u2013314 (1992)","journal-title":"Journal of Logic Programming"},{"key":"30_CR18","unstructured":"King, A., Soper, P.: Depth-k Sharing and Freeness. In: ICLP 1994 (1994)"},{"key":"30_CR19","unstructured":"Langen, A.: Advanced techniques for approximating variable aliasing in Logic Programs. PhD thesis, Computer Science Dept., University of Southern CA (1990)"},{"key":"30_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11799573_13","volume-title":"Logic Programming","author":"X. Li","year":"2006","unstructured":"Li, X., King, A., Lu, L.: Collapsing Closures. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol.\u00a04079. Springer, Heidelberg (2006)"},{"key":"30_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11737414_13","volume-title":"Functional and Logic Programming","author":"X. Li","year":"2006","unstructured":"Li, X., King, A., Lu, L.: Lazy Set-Sharing Analysis. In: Hagiya, M., Wadler, P. (eds.) FLOPS 2006. LNCS, vol.\u00a03945. Springer, Heidelberg (2006)"},{"key":"30_CR22","series-title":"Lecture Notes in Computer Science","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"M. M\u00e9ndez-Lojo","year":"2008","unstructured":"M\u00e9ndez-Lojo, M., Hermenegildo, M.: Precise Set Sharing Analysis for Java-style Programs. In: Logozzo, F., Peled, D.A., Zuck, L.D. (eds.) VMCAI 2008. LNCS, vol.\u00a04905. Springer, Heidelberg (2008)"},{"key":"30_CR23","doi-asserted-by":"crossref","unstructured":"Mulkers, A., Simoens, W., Janssens, G., Bruynooghe, M.: On the Practicality of Abstract Equation Systems. In: ICLP 1995 (1995)","DOI":"10.7551\/mitpress\/4298.003.0074"},{"key":"30_CR24","unstructured":"Muthukumar, K., Hermenegildo, M.: Combined Determination of Sharing and Freeness of Program Variables Through Abstract Interpretation. In: ICLP 1991 (1991)"},{"issue":"2\/3","key":"30_CR25","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. JLP\u00a013(2\/3), 315\u2013347 (1992)","journal-title":"JLP"},{"key":"30_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11603023_13","volume-title":"Practical Aspects of Declarative Languages","author":"J. Navas","year":"2005","unstructured":"Navas, J., Bueno, F., Hermenegildo, M.: Efficient top-down set-sharing analysis using cliques. In: Van Hentenryck, P. (ed.) PADL 2006. LNCS, vol.\u00a03819. Springer, Heidelberg (2005)"},{"key":"30_CR27","series-title":"Lecture Notes in Computer Science","volume-title":"ESOP 1986","author":"H. S\u00f8ndergaard","year":"1986","unstructured":"S\u00f8ndergaard, H.: An application of abstract interpretation of logic programs: occur check reduction. In: Robinet, B., Wilhelm, R. (eds.) ESOP 1986. LNCS, vol.\u00a0213. Springer, Heidelberg (1986)"},{"key":"30_CR28","unstructured":"Trias, E., Navas, J., Ackley, E.S., Forrest, S., Hermenegildo, M.: Efficient Representations for Set-Sharing Analysis. TR-CLIP9\/2008.0, Univ. of New Mexico (2008)"},{"key":"30_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89982-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T01:52:03Z","timestamp":1709776323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89982-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540899815","9783540899822"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89982-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}