{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T12:04:27Z","timestamp":1764331467067},"reference-count":75,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"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":6440,"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":[[1995,12]]},"DOI":"10.1016\/0743-1066(95)00038-0","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"191-247","source":"Crossref","is-referenced-by-count":36,"title":["Generalized semantics and abstract interpretation for constraint logic programs"],"prefix":"10.1016","volume":"25","author":[{"given":"Roberto","family":"Giacobazzi","sequence":"first","affiliation":[]},{"given":"Saumya K","family":"Debray","sequence":"additional","affiliation":[]},{"given":"Giorgio","family":"Levi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(95)00038-0_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0743-1066(95)00038-0_BIB2","first-page":"495","article-title":"Introduction to logic programming","author":"Apt","year":"1990"},{"key":"10.1016\/0743-1066(95)00038-0_BIB3","series-title":"Actes Workshop on Static Analysis, WSA'92","first-page":"43","article-title":"Static analysis of CLP programs over numeric domains","author":"Bagnara","year":"1992"},{"key":"10.1016\/0743-1066(95)00038-0_BIB4","series-title":"Proc. of Ninth IEEE Conference on AI Applications","first-page":"270","article-title":"An application of constraint propagation to data-flow analysis","author":"Bagnara","year":"1993"},{"issue":"1","key":"10.1016\/0743-1066(95)00038-0_BIB5","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/151646.151650","article-title":"A general framework for semantics-based bottom-up abstract interpretation of logic programs","volume":"15","author":"Barbuti","year":"1993","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/0743-1066(95)00038-0_BIB6","series-title":"Proc. Nineteenth ACM Symposium on Principles of Programming Languages","first-page":"95","article-title":"Modeling Prolog control","author":"Barbuti","year":"1992"},{"key":"10.1016\/0743-1066(95)00038-0_BIB7","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0167-6423(83)90022-9","article-title":"A structured approach to semantics correctness","volume":"3","author":"Barbuti","year":"1983","journal-title":"Science of Computer Programming"},{"key":"10.1016\/0743-1066(95)00038-0_BIB8","series-title":"AMS Colloquium Publication","article-title":"Lattice theory","author":"Birkhoff","year":"1967"},{"key":"10.1016\/0743-1066(95)00038-0_BIB9","series-title":"Proc. TAPSOFT'91","first-page":"153","article-title":"Proving termination of logic programs by exploiting term properties","volume":"494","author":"Bossi","year":"1991"},{"key":"10.1016\/0743-1066(95)00038-0_BIB10","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0743-1066(94)90026-4","article-title":"The s-semantics approach: Theory and applications","volume":"19 & 20","author":"Bossi","year":"1994","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/0743-1066(95)00038-0_BIB11","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0743-1066(91)80001-T","article-title":"A practical framework for the abstract interpretations of logic programs","volume":"10","author":"Bruynooghe","year":"1991","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/0743-1066(95)00038-0_BIB12","series-title":"Proc. Fourth IEEE International Symp. on Logic Programming","first-page":"192","article-title":"Abstract interpretation: Towards the global optimization of Prolog programs","author":"Bruynooghe","year":"1987"},{"key":"10.1016\/0743-1066(95)00038-0_BIB13","first-page":"125","article-title":"An algebraization of first order logic with terms","volume":"54","author":"Cirulis","year":"1991","journal-title":"Colloquia Mathematica Societatis J\u00e0nos Bolyai"},{"key":"10.1016\/0743-1066(95)00038-0_BIB14","article-title":"Predicate logic as a computational formalism","author":"Clark","year":"1979"},{"issue":"1","key":"10.1016\/0743-1066(95)00038-0_BIB15","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":"Theoretical Computer Science"},{"key":"10.1016\/0743-1066(95)00038-0_BIB16","series-title":"Proc. Twentieth Annual ACM Symp. on Principles of Programming Languages","first-page":"451","article-title":"Compositional analysis of modular logic programs","author":"Codish","year":"1993"},{"key":"10.1016\/0743-1066(95)00038-0_BIB17","series-title":"Proc. of the 1993 International Logic Programming Symposium","first-page":"114","article-title":"Analysing logic programs using \u201cprop\u201d-ositional logic programs and a magic wand","author":"Codish","year":"1993"},{"key":"10.1016\/0743-1066(95)00038-0_BIB18","doi-asserted-by":"crossref","DOI":"10.1145\/177492.177656","article-title":"Suspension analyses for concurrent logic programs","author":"Codish","year":"1992"},{"key":"10.1016\/0743-1066(95)00038-0_BIB19","series-title":"Proc. IEEE International Conference on Computer Languages, ICCL'92","article-title":"Computations, abstractions and constraints","author":"Codognet","year":"1992"},{"key":"10.1016\/0743-1066(95)00038-0_BIB20","series-title":"Programming Language Implementation and Logic Programming, Proceedings PLILP'93","first-page":"75","article-title":"Efficient bottom-up abstract interpretation of Prolog by means of constraint solving over symbolic finite domains","volume":"714","author":"Corsini","year":"1991"},{"key":"10.1016\/0743-1066(95)00038-0_BIB21","series-title":"Proc. Sixth IEEE Symp. on Logic in Computer Science","first-page":"322","article-title":"Prop revisited: Propositional formula as abstract domain for groundness analysis","author":"Cortesi","year":"1991"},{"key":"10.1016\/0743-1066(95)00038-0_BIB22","series-title":"Proc. Fourth ACM Symp. Principles of Programming Languages","first-page":"238","article-title":"Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints","author":"Cousot","year":"1977"},{"issue":"2","key":"10.1016\/0743-1066(95)00038-0_BIB23","first-page":"185","article-title":"A constructive characterization of the lattices of all retracts, pre-closure, quasi-closure and closure operators on a complete lattice","volume":"38","author":"Cousot","year":"1979","journal-title":"Portugali\u00e6Mathematica"},{"key":"10.1016\/0743-1066(95)00038-0_BIB24","series-title":"Proc. Sixth ACM Symp. Principles of Programming Languages","first-page":"269","article-title":"Systematic design of program analysis frameworks","author":"Cousot","year":"1979"},{"key":"10.1016\/0743-1066(95)00038-0_BIB25","series-title":"Proc. of PLILP'92","first-page":"269","article-title":"Comparing the Galois connection and widening\/narrowing approaches to abstract interpretation","volume":"631","author":"Cousot","year":"1992"},{"issue":"2 & 3","key":"10.1016\/0743-1066(95)00038-0_BIB26","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","article-title":"Abstract interpretation and applications to logic programs","volume":"13","author":"Cousot","year":"1992","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/0743-1066(95)00038-0_BIB27","series-title":"Proc. Fifth ACM Symp. Principles of Programming Languages","first-page":"84","article-title":"Automatic discovery of linear restraints among variables of a program","author":"Cousot","year":"1978"},{"issue":"2","key":"10.1016\/0743-1066(95)00038-0_BIB28","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0743-1066(91)90017-J","article-title":"On derived dependencies and connected databases","volume":"11","author":"Dart","year":"1991","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/0743-1066(95)00038-0_BIB29","article-title":"Generalized Horn clause programs","author":"Debray","year":"1991"},{"key":"10.1016\/0743-1066(95)00038-0_BIB30","volume":"volume A","author":"Eilenberg","year":"1974"},{"issue":"3","key":"10.1016\/0743-1066(95)00038-0_BIB31","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\/0743-1066(95)00038-0_BIB32","series-title":"Proc. of the Ninth ACM Symposium on Applied Computing","first-page":"394","article-title":"Goal independency and call patterns in the analysis of logic programs","author":"Gabbrielli","year":"1994"},{"key":"10.1016\/0743-1066(95)00038-0_BIB33","series-title":"Proc. Eighth International Conference on Logic Programming","first-page":"238","article-title":"Modeling answer constraints in constraint logic programs","author":"Gabbrielli","year":"1991"},{"key":"10.1016\/0743-1066(95)00038-0_BIB34","article-title":"Semantic Aspects of Logic Program Analysis","author":"Giacobazzi","year":"1993"},{"key":"10.1016\/0743-1066(95)00038-0_BIB35","series-title":"Proc of the Post-ICLP Workshop on Verification and Analysis of Logic Programs","first-page":"159","article-title":"On the collecting semantics of logic programs","author":"Giacobazzi","year":"1994"},{"key":"10.1016\/0743-1066(95)00038-0_BIB36","series-title":"Proceedings of the International Conference on Fifth Generation Computer Systems","first-page":"581","article-title":"A generalized semantics for constraint logic programs","author":"Giacobazzi","year":"1992"},{"key":"10.1016\/0743-1066(95)00038-0_BIB37","series-title":"Proc. Third International Conference on Algebraic Methodology and Software Technology","first-page":"109","article-title":"Joining abstract and concrete computations in constraint logic programming","author":"Giacobazzi","year":"1993"},{"key":"10.1016\/0743-1066(95)00038-0_BIB38","series-title":"The theory of semirings with applications in mathematics and theoretical computer science","author":"Golan","year":"1992"},{"key":"10.1016\/0743-1066(95)00038-0_BIB39","series-title":"Proc. International Workshop on Programming Languages Implementation and Logic Programming","first-page":"273","article-title":"Formal specification of a Prolog compiler","volume":"3485","author":"Hanus","year":"1988"},{"key":"10.1016\/0743-1066(95)00038-0_BIB40","unstructured":"Hanus, M., Analysis of nonlinear constraints in CLP(R), in: Proc. Tenth International Conference on Logic Programming, MIT Press, Cambridge, MA, pp. 83\u201399."},{"key":"10.1016\/0743-1066(95)00038-0_BIB41","series-title":"Cylindric Algebras","author":"Henkin","year":"1971"},{"issue":"4","key":"10.1016\/0743-1066(95)00038-0_BIB42","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0743-1066(92)90053-6","article-title":"Global flow analysis as a practical compilation tool","volume":"13","author":"Hermenegildo","year":"1992","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/0743-1066(95)00038-0_BIB43","series-title":"Proc. First International Conference on Expert Database Systems","first-page":"295","article-title":"An algebraic approach to recursive inference","author":"Ioannidis","year":"1987"},{"issue":"2 & 3","key":"10.1016\/0743-1066(95)00038-0_BIB44","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0743-1066(92)90034-Z","article-title":"Static analysis of logic programs for independent AND parallelism","volume":"13","author":"Jacobs","year":"1992","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/0743-1066(95)00038-0_BIB45","series-title":"Proc. Fourteenth Annual ACM Symp. on Principles of Programming Languages","first-page":"111","article-title":"Constraint logic programming","author":"Jaffar","year":"1987"},{"key":"10.1016\/0743-1066(95)00038-0_BIB46","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","article-title":"Constraint logic programming: A survey","volume":"19 & 20","author":"Jaffar","year":"1994","journal-title":"Journal of Logic Programming"},{"issue":"3","key":"10.1016\/0743-1066(95)00038-0_BIB47","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/129393.129398","article-title":"The CLP(R) language and system","volume":"14","author":"Jaffar","year":"1992","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/0743-1066(95)00038-0_BIB48","series-title":"Proc. 1991 International Symposium on Logic Programming","first-page":"420","article-title":"Some global compile-time optimizations for CLP(R)","author":"J\u2205rgensen","year":"1991"},{"key":"10.1016\/0743-1066(95)00038-0_BIB49","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF00268497","article-title":"Affine relationships among variables of a program","volume":"6","author":"Karr","year":"1976","journal-title":"Acta Informatica"},{"key":"10.1016\/0743-1066(95)00038-0_BIB50","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/BF03025757","article-title":"On limits in complete semirings","volume":"45","author":"Karner","year":"1992","journal-title":"Semigroup Forum"},{"key":"10.1016\/0743-1066(95)00038-0_BIB51","series-title":"11th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings STACS'94","first-page":"389","article-title":"A topology for complete semirings","author":"Karner","year":"1994"},{"key":"10.1016\/0743-1066(95)00038-0_BIB52","unstructured":"Karner, G., personal communication, 1994."},{"key":"10.1016\/0743-1066(95)00038-0_BIB53","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"587","article-title":"Unification revisited","author":"Lassez","year":"1988"},{"key":"10.1016\/0743-1066(95)00038-0_BIB54","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0743-1066(95)00038-0_BIB55","series-title":"Informal Proc. of the North American Conference on Logic Programming'89","article-title":"Notes for a tutorial on abstract interpretation of logic programs","author":"Marriott","year":"1989"},{"key":"10.1016\/0743-1066(95)00038-0_BIB56","series-title":"Proc. Fifth Italian Conference on Logic Programming","first-page":"399","article-title":"Abstract interpretation of logic programs: The denotational approach","author":"Marriott","year":"1990"},{"key":"10.1016\/0743-1066(95)00038-0_BIB57","series-title":"Proc. North American Conference on Logic Programming'90","first-page":"531","article-title":"Analysis of constraint logic programs","author":"Marriott","year":"1990"},{"issue":"1\u20134","key":"10.1016\/0743-1066(95)00038-0_BIB58","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\/0743-1066(95)00038-0_BIB59","doi-asserted-by":"crossref","unstructured":"Marriott, K., S\u2205ndergaard, H., and Jones, N. D., Denotational abstract interpretation of logic programs, ACM Transactions on Programming Languages and Systems 16(3):607\u2013648.","DOI":"10.1145\/177492.177650"},{"key":"10.1016\/0743-1066(95)00038-0_BIB60","series-title":"Category Theory and Computer Programming","first-page":"299","article-title":"Galois connections and computer science applications","volume":"240","author":"Melton","year":"1986"},{"issue":"3","key":"10.1016\/0743-1066(95)00038-0_BIB61","first-page":"155","article-title":"A characterization of the closure operators by means of one axiom","volume":"21","author":"Morgado","year":"1962","journal-title":"Portugali\u00e6 Mathematica"},{"issue":"3","key":"10.1016\/0743-1066(95)00038-0_BIB62","doi-asserted-by":"crossref","first-page":"514","DOI":"10.2307\/1968978","article-title":"Combinations of closure relations","volume":"44","author":"Oystein","year":"1943","journal-title":"Annals of Mathematics"},{"key":"10.1016\/0743-1066(95)00038-0_BIB63","series-title":"Proc. of the REX Workshop","first-page":"457","article-title":"A hyperdoctrinal view of concurrent constraint programming","volume":"666","author":"Panangaden","year":"1992"},{"key":"10.1016\/0743-1066(95)00038-0_BIB64","series-title":"Proc. Eighteenth Annual ACM Symp. on Principles of Programming Languages","first-page":"333","article-title":"Semantic foundation of concurrent constraint programming","author":"Saraswat","year":"1991"},{"key":"10.1016\/0743-1066(95)00038-0_BIB65","series-title":"Proc. Ninth International Colloquium on Automata, Languages and Programming","first-page":"577","article-title":"Domains for denotational semantics","volume":"1405","author":"Scott","year":"1982"},{"key":"10.1016\/0743-1066(95)00038-0_BIB66","first-page":"641","article-title":"Topology","volume":"vol. 1","author":"Smyth","year":"1992"},{"key":"10.1016\/0743-1066(95)00038-0_BIB67","series-title":"Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory","author":"Stoy","year":"1977"},{"key":"10.1016\/0743-1066(95)00038-0_BIB68","first-page":"106","article-title":"Compiling dataflow analysis of logic programs","author":"Tan","year":"1992"},{"key":"10.1016\/0743-1066(95)00038-0_BIB69","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","article-title":"A lattice-theoretical fixpoint theorem and its applications","volume":"5","author":"Tarski","year":"1955","journal-title":"Pacific J. Math."},{"key":"10.1016\/0743-1066(95)00038-0_BIB70","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(81)90080-3","article-title":"More on advice on structuring compilers and proving them correct","volume":"15","author":"Thatcher","year":"1981","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"10.1016\/0743-1066(95)00038-0_BIB71","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The semantics of predicate logic as a programming language","volume":"23","author":"van Emden","year":"1976","journal-title":"Journal of the ACM"},{"key":"10.1016\/0743-1066(95)00038-0_BIB72","series-title":"Proc. of the Eleventh ACM Conference on Principles of Database Systems","first-page":"47","article-title":"Deriving constraints among argument sizes in logic programs","author":"van Gelder","year":"1990"},{"key":"10.1016\/0743-1066(95)00038-0_BIB73","series-title":"Fourth International Symposium on Programming Language Implementation and Logic Programming, Proc. of PLILP'92","first-page":"296","article-title":"Derivation of linear size relations by abstract interpretation","volume":"631","author":"Verschaetse","year":"1992"},{"issue":"2","key":"10.1016\/0743-1066(95)00038-0_BIB74","doi-asserted-by":"crossref","first-page":"191","DOI":"10.2307\/1968865","article-title":"The closure operators of a lattice","volume":"43","author":"Ward","year":"1942","journal-title":"Annals of Mathematics"},{"key":"10.1016\/0743-1066(95)00038-0_BIB75","series-title":"Proc. Sixth Int. Symp. on Programming Language Implementation and Logic Programming, PLILP'94","first-page":"57","article-title":"Abstracting synchronization in concurrent constraint programming","volume":"844","author":"Zaffanella","year":"1994"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106695000380?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106695000380?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T01:51:39Z","timestamp":1556243499000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106695000380"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":75,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["0743106695000380"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(95)00038-0","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1995,12]]}}}