{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T03:23:18Z","timestamp":1779074598979,"version":"3.51.4"},"reference-count":64,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5252,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,3]]},"DOI":"10.1016\/s0304-3975(98)00194-7","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"159-211","source":"Crossref","is-referenced-by-count":30,"title":["The reduced relative power operation on abstract domains"],"prefix":"10.1016","volume":"216","author":[{"given":"Roberto","family":"Giacobazzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Ranzato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0304-3975(98)00194-7_BIB1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1017\/S0960129500000189","article-title":"Quantales, observational logic and process semantics","volume":"3","author":"Abramsky","year":"1993","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00194-7_BIB2","first-page":"739","article-title":"An introduction to inductive definitions","author":"Aczel","year":"1977"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB3","series-title":"Formal Models and Semantics","first-page":"495","article-title":"Introduction to logic programming","volume":"vol. B","author":"Apt","year":"1990"},{"issue":"1","key":"10.1016\/S0304-3975(98)00194-7_BIB4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-6423(96)00039-1","article-title":"Two classes of Boolean functions for dependency analysis","volume":"31","author":"Armstrong","year":"1998","journal-title":"Sci. Comput. Program."},{"issue":"1\u20132","key":"10.1016\/S0304-3975(98)00194-7_BIB5","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0167-6423(97)00009-9","article-title":"A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages","volume":"30","author":"Bagnara","year":"1998","journal-title":"Sci. Comput. Program."},{"key":"10.1016\/S0304-3975(98)00194-7_BIB6","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF01182783","article-title":"The tensor product of continuous lattices","volume":"172","author":"Bandelt","year":"1980","journal-title":"Math. Z."},{"key":"10.1016\/S0304-3975(98)00194-7_BIB7","article-title":"Lattice Theory","volume":"vol. XXV","author":"Birkhoff","year":"1967"},{"issue":"5","key":"10.1016\/S0304-3975(98)00194-7_BIB8","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1145\/234752.234756","article-title":"The meaning of negative premises in transition system specification","volume":"43","author":"Bol","year":"1996","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB9","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\u201320","author":"Bossi","year":"1994","journal-title":"J. Logic Program."},{"issue":"1\u20132","key":"10.1016\/S0304-3975(98)00194-7_BIB10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(94)90200-3","article-title":"A compositional semantics for logic programs","volume":"122","author":"Bossi","year":"1994","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/S0304-3975(98)00194-7_BIB11","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0304-3975(95)00012-L","article-title":"Fully abstract compositional semantics for an algebra of logic programs","volume":"149","author":"Brogi","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00194-7_BIB12","article-title":"Predicate logic as a computational formalism","author":"Clark","year":"1979"},{"issue":"1","key":"10.1016\/S0304-3975(98)00194-7_BIB13","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/200994.200998","article-title":"Improving abstract interpretations by combining domains","volume":"17","author":"Codish","year":"1995","journal-title":"ACM Trans. Program. Lang. Systems"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB14","series-title":"Proc. Internat. Logic Programming Symp. (ILPS '94)","first-page":"172","article-title":"An algebraic theory of observables","author":"Comini","year":"1994"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB15","series-title":"Proc. Internat. Logic Programming Symp. (ILPS '95)","article-title":"Compositionality of SLD-derivations and their abstractions","author":"Comini","year":"1995"},{"issue":"1","key":"10.1016\/S0304-3975(98)00194-7_BIB16","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1145\/239912.239914","article-title":"Complementation in abstract interpretation","volume":"19","author":"Cortesi","year":"1997","journal-title":"ACM Trans. Program. Lang. Systems"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB17","series-title":"Conference Record of the 21st ACM Symp. on Principles of Programming Languages (POPL '94)","first-page":"227","article-title":"Combinations of abstract domains for logic programming","author":"Cortesi","year":"1994"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB18","article-title":"M\u00e9thodes It\u00e9ratives de Construction et d'Approximation de Points Fixes d'Op\u00e9rateurs Monotones sur un Treillis, Analyse S\u00e9mantique des Programmes","author":"Cousot","year":"1978"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB19","series-title":"Proc. 13th Internat. Symp. on Mathematical Foundations of Programming Semantics (MFPS '97)","article-title":"Constructive design of a hierarchy of semantics of a transition system by abstract interpretation","volume":"vol. 6","author":"Cousot","year":"1997"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB20","series-title":"Conf. Record of the 4th ACM Symp. on Principles of Programming Languages (POPL '77)","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"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB21","series-title":"Conf. Record of the 6th ACM Symp. on Principles of Programming Languages (POPL '79)","first-page":"269","article-title":"Systematic design of program analysis frameworks","author":"Cousot","year":"1979"},{"issue":"2\u20133","key":"10.1016\/S0304-3975(98)00194-7_BIB22","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","article-title":"Abstract interpretation and application to logic programs","volume":"13","author":"Cousot","year":"1992","journal-title":"J. Logic Program."},{"key":"10.1016\/S0304-3975(98)00194-7_BIB23","series-title":"Conf. Record of the 19th ACM Symp. on Principles of Programming Languages (POPL '92)","first-page":"83","article-title":"Inductive definitions, semantics and abstract interpretation","author":"Cousot","year":"1992"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB24","series-title":"Proc. IEEE Internat. Conf. on Computer Languages (ICCL '94)","first-page":"95","article-title":"Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages)","author":"Cousot","year":"1994"},{"issue":"2","key":"10.1016\/S0304-3975(98)00194-7_BIB25","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":"J. Logic Program."},{"key":"10.1016\/S0304-3975(98)00194-7_BIB26","series-title":"Proc. 8th Internat. Symp. on Theoretical Aspects of Computer Science (STACS '91)","first-page":"511","article-title":"Unfolding, procedural and fixpoint semantics of logic programs","volume":"vol. 480","author":"Denis","year":"1991"},{"issue":"4","key":"10.1016\/S0304-3975(98)00194-7_BIB27","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":"J. ACM"},{"issue":"3","key":"10.1016\/S0304-3975(98)00194-7_BIB28","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":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/S0304-3975(98)00194-7_BIB29","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/234528.234742","article-title":"A unifying view of abstract domain design","volume":"28","author":"Fil\u00e9","year":"1996","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/S0304-3975(98)00194-7_BIB30","article-title":"The powerset operator on abstract interpretations","author":"Fil\u00e9","year":"1998","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/S0304-3975(98)00194-7_BIB31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1995.1138","article-title":"Observable behaviors and equivalences of logic programs","volume":"122","author":"Gabbrielli","year":"1995","journal-title":"Inform. Comput."},{"issue":"4","key":"10.1016\/S0304-3975(98)00194-7_BIB32","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1093\/logcom\/6.4.491","article-title":"Resultant semantics for Prolog","volume":"6","author":"Gabbrielli","year":"1996","journal-title":"J. Logic Comput."},{"key":"10.1016\/S0304-3975(98)00194-7_BIB33","series-title":"Conf. Record of the 16th ACM Symp. on Principles of Programming Languages (POPL '89)","first-page":"134","article-title":"Fully abstract compositional semantics for logic programs","author":"Gaifman","year":"1989"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB34","series-title":"Proc. 13th Internat. Symp. on Theoretical Aspects of Computer Science (STACS '96)","first-page":"503","article-title":"\u201cOptimal\u201d collecting semantics for analysis in a hierarchy of logic program semantics","volume":"vol. 1046","author":"Giacobazzi","year":"1996"},{"issue":"3","key":"10.1016\/S0304-3975(98)00194-7_BIB35","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/BF01236765","article-title":"Weak relative pseudo-complements of closure operators","volume":"36","author":"Giacobazzi","year":"1996","journal-title":"Algebra Universalis"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB36","series-title":"Proc. 1995 Internat. Logic Programming Symp. (ILPS '95)","first-page":"321","article-title":"Functional dependencies and Moore-set completions of abstract interpretations and semantics","author":"Giacobazzi","year":"1995"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB37","series-title":"Proc. 24th Internat. Colloq. on Automata, Languages and Programming (ICALP '97)","first-page":"771","article-title":"Refining and compressing abstract domains","volume":"vol. 1256","author":"Giacobazzi","year":"1997"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB38","series-title":"Proc. 6th Internat. Conf. on Algebraic Methodology and Software Technology (AMAST'97)","first-page":"231","article-title":"Completeness in abstract interpretation: a domain perspective","volume":"vol. 1349","author":"Giacobazzi","year":"1997"},{"issue":"1\u20133","key":"10.1016\/S0304-3975(98)00194-7_BIB39","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0167-6423(97)00034-8","article-title":"Optimal domains for disjunctive abstract interpretation","volume":"32","author":"Giacobazzi","year":"1998","journal-title":"Sci. Comput. Program."},{"key":"10.1016\/S0304-3975(98)00194-7_BIB40","doi-asserted-by":"crossref","DOI":"10.1145\/293677.293680","article-title":"A logical model for relational abstract domains","author":"Giacobazzi","year":"1998","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10.1016\/S0304-3975(98)00194-7_BIB41","series-title":"General Lattice Theory","author":"Gr\u00e4tzer","year":"1978"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB42","series-title":"Proc. 7th IEEE Symp. on Logic in Computer Science (LICS '92)","first-page":"174","article-title":"Disjunctive strictness analysis","author":"Jensen","year":"1992"},{"issue":"5","key":"10.1016\/S0304-3975(98)00194-7_BIB43","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1145\/265943.265966","article-title":"Disjunctive program analysis for algebraic data types","volume":"19","author":"Jensen","year":"1997","journal-title":"ACM Trans. Program. Lang. Systems"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB44","series-title":"Program Flow Analysis: Theory and Applications","first-page":"380","article-title":"Complexity of flow analysis, inductive assertion synthesis and a language due to Dijkstra","author":"Jones","year":"1981"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB45","series-title":"Abstract Interpretation of Declarative Languages","first-page":"123","article-title":"A semantics-based framework for the abstract interpretation of Prolog","author":"Jones","year":"1987"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB46","article-title":"Reynolds and Heyting models of definite clauses","author":"Kemp","year":"1991"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB47","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"587","article-title":"Unification revisited","author":"Lassez","year":"1988"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB48","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"627","article-title":"Equivalences of logic programs","author":"Maher","year":"1988"},{"issue":"1\u20134","key":"10.1016\/S0304-3975(98)00194-7_BIB49","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 Lett. Program. Lang. Systems"},{"issue":"2","key":"10.1016\/S0304-3975(98)00194-7_BIB50","first-page":"101","article-title":"Some results on the closure operators of partially ordered sets","volume":"19","author":"Morgado","year":"1960","journal-title":"Portug. Math."},{"issue":"3","key":"10.1016\/S0304-3975(98)00194-7_BIB51","first-page":"135","article-title":"Note on complemented closure operators of complete lattices","volume":"21","author":"Morgado","year":"1962","journal-title":"Portug. Math."},{"key":"10.1016\/S0304-3975(98)00194-7_BIB52","first-page":"99","volume":"12","author":"Mulvey","year":"1986","journal-title":"Suppl. Rend. Circ. Mat. Palermo"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB53","series-title":"Proc. 8th Internat. Conf. on Logic Programming (ICLP'91)","first-page":"49","article-title":"Combined determination of sharing and freeness of program variables through abstract interpretation","author":"Muthukumar","year":"1991"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB54","article-title":"Abstract interpretation using domain theory","author":"Nielson","year":"1984"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB55","series-title":"Proc. 4th Hungarian Computer Science Conf.","first-page":"211","article-title":"Tensor products generalize the relational data flow analysis method","author":"Nielson","year":"1985"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB56","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0304-3975(89)90091-1","article-title":"Two-level semantics and abstract interpretation","volume":"69","author":"Nielson","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00194-7_BIB57","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0167-6423(94)00009-3","article-title":"The tensor product in Wadler's analysis of lists","volume":"22","author":"Nielson","year":"1994","journal-title":"Sci. Comput. Program."},{"key":"10.1016\/S0304-3975(98)00194-7_BIB58","article-title":"Quantales and their Applications","author":"Rosenthal","year":"1990"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB59","series-title":"Conf. Record of the 18th ACM Symp. on Principles of Programming Languages (POPL'91)","first-page":"333","article-title":"Semantic foundations of concurrent constraint programming","author":"Saraswat","year":"1991"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB60","series-title":"Proc. 4th Internat. Static Analysis Symp. (SAS '97)","first-page":"83","article-title":"Logical optimality of groundness analysis","volume":"vol. 1302","author":"Scozzari","year":"1997"},{"issue":"2","key":"10.1016\/S0304-3975(98)00194-7_BIB61","doi-asserted-by":"crossref","first-page":"209","DOI":"10.2140\/pjm.1974.54.209","article-title":"The structure of Galois connections","volume":"54","author":"Shmuely","year":"1974","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0304-3975(98)00194-7_BIB62","series-title":"Proc. 16th Conf. on Foundations of Software Technology and Theoretical Computer Science (FST&TCS'96)","first-page":"359","article-title":"Immediate fixpoints and their use in groundness analysis","volume":"vol. 1180","author":"S\u00f8ndergaard","year":"1996"},{"key":"10.1016\/S0304-3975(98)00194-7_BIB63","series-title":"Proc. 12th Conf. on Foundations of Software Technology and Theoretical Computer Science (FST&TCS '92)","first-page":"203","article-title":"An abstract interpretation scheme for groundness, freeness, and sharing analysis of logic programs","volume":"vol. 652","author":"Sundararajan","year":"1992"},{"issue":"2","key":"10.1016\/S0304-3975(98)00194-7_BIB64","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":"Ann. of Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001947?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001947?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:27:22Z","timestamp":1556522842000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598001947"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":64,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,3]]}},"alternative-id":["S0304397598001947"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00194-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,3]]}}}