{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T14:06:50Z","timestamp":1751983610122},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":4796,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1016\/s0743-1066(99)00079-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:42:40Z","timestamp":1027633360000},"page":"251-263","source":"Crossref","is-referenced-by-count":6,"title":["Improving program analyses, by structure untupling"],"prefix":"10.1016","volume":"43","author":[{"given":"Michael","family":"Codish","sequence":"first","affiliation":[]},{"given":"Kim","family":"Marriott","sequence":"additional","affiliation":[]},{"given":"Cohavit","family":"Taboch","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0743-1066(99)00079-5_BIB1","unstructured":"R. Bagnara, Data-flow analysis for constraint logic-based languages, Ph.D. thesis, University of Pisa, 1997"},{"key":"10.1016\/S0743-1066(99)00079-5_BIB2","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0304-3975(94)90055-8","article-title":"Bottom-up abstract interpretation of logic programs","volume":"124","author":"Codish","year":"1994","journal-title":"Journal of Theoretical Computer Science"},{"key":"10.1016\/S0743-1066(99)00079-5_BIB3","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0743-1066(99)00006-0","article-title":"A semantic basis for termination analysis of logic programs","volume":"41","author":"Codish","year":"1999","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0743-1066(99)00079-5_BIB4","doi-asserted-by":"crossref","unstructured":"A. Cortesi, G. Fil\u00e9, W. Winsborough, Prop revisited: propositional formula as abstract domain for groundness analysis, in: Proceedings of the Sixth Annual IEEE Symposium, Logic in Computer Science, IEEE Computer Society Press, Los Alamitos, California, 1991, pp. 322\u201332","DOI":"10.1109\/LICS.1991.151656"},{"key":"10.1016\/S0743-1066(99)00079-5_BIB5","doi-asserted-by":"crossref","unstructured":"A. Cortesi, G. Fil\u00e9, W. Winsborough, Optimal groundness analysis using propositional logic, Journal of Logic Programming 27 (2) (1996) 137\u2013167","DOI":"10.1016\/0743-1066(95)00123-9"},{"key":"10.1016\/S0743-1066(99)00079-5_BIB6","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, Department of Computer Science, 1993, Available from ftp:\/\/ftp.cs.brown.edu\/pub\/techreports\/93\/cs93-13.ps.Z"},{"key":"10.1016\/S0743-1066(99)00079-5_BIB7","doi-asserted-by":"crossref","unstructured":"A. Cortesi, B. Le Charlier, P. Van Hentenryck, Combinations of abstract domains for logic programming, in: ACM Proceedings of the 21st Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, ACM Press, New York, 1994, pp. 227\u2013239","DOI":"10.1145\/174675.177880"},{"key":"10.1016\/S0743-1066(99)00079-5_BIB8","doi-asserted-by":"crossref","unstructured":"P. Cousot, R. Cousot, Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: Proceedings of the Fourth ACM Symposium on Principles of Programming Languages, January 1977, pp. 238\u2013252","DOI":"10.1145\/512950.512973"},{"issue":"3","key":"10.1016\/S0743-1066(99)00079-5_BIB9","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","article-title":"Declarative modeling of the operational behavior of logic languages","volume":"69","author":"Falaschi","year":"1989","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0743-1066(99)00079-5_BIB10","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","article-title":"Semantics for logic programming","volume":"4","author":"Fitting","year":"1985","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"10.1016\/S0743-1066(99)00079-5_BIB11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/174625.174627","article-title":"Experimental evaluation of a generic abstract interpretation algorithm for prolog","volume":"16","author":"Le Charlier","year":"1994","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"key":"10.1016\/S0743-1066(99)00079-5_BIB12","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"issue":"2","key":"10.1016\/S0743-1066(99)00079-5_BIB13","article-title":"Most specific logic programs","volume":"1","author":"Marriott","year":"1990","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"10.1016\/S0743-1066(99)00079-5_BIB14","unstructured":"K. Marriott, L. Naish, and J.-L. Lassez, Most specific logic programs, in: R.A. Kowalski, K.A. Bowen, (Eds.), Proceedings of the Fifth International Conference and Symposium on Logic Programming, Seatle, ALP, IEEE, MIT Press, Cambridge, MA, 1988, pp. 909\u2013923"},{"issue":"2 and 3","key":"10.1016\/S0743-1066(99)00079-5_BIB15","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0743-1066(92)90031-W","article-title":"Bottom-up dataflow analysis of normal logic programs","volume":"13","author":"Marriott","year":"1992","journal-title":"The Journal of Logic Programming"},{"issue":"1\u20134","key":"10.1016\/S0743-1066(99)00079-5_BIB16","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/176454.176519","article-title":"Precise and efficient groundness analysis for logic programs","volume":"2","author":"Marriott","year":"1993","journal-title":"ACM Letters on Programming Languages and Systems"},{"key":"10.1016\/S0743-1066(99)00079-5_BIB17","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0304-3975(84)90119-1","article-title":"Enumeration of success patterns in logic programs","volume":"34","author":"Sato","year":"1984","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"10.1016\/S0743-1066(99)00079-5_BIB18","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0743-1066(94)00029-6","article-title":"Evaluation of the domain PROP","volume":"23","author":"Van Hentenryck","year":"1995","journal-title":"Journal of Logic Programming"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106699000795?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106699000795?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T08:20:30Z","timestamp":1555316430000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743106699000795"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0743106699000795"],"URL":"https:\/\/doi.org\/10.1016\/s0743-1066(99)00079-5","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}