{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T06:17:42Z","timestamp":1673417862912},"reference-count":40,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Program. Lang. Syst."],"published-print":{"date-parts":[[1997,1]]},"abstract":"\n Reduced product of abstract domains is a rather well-known operation for domain composition in abstract interpretation. In this article, we study its inverse operation, introducing a notion of domain complementation in abstract interpretation. Complementation provides as systematic way to design new abstract domains, and it allows to systematically decompose domains. Also, such an operation allows to simplify domain verification problems, and it yields space-saving representations for complex domains. We show that the complement exists in most coses, and we apply complementation to three well-know abstract domains, notably to Cousot and Cousot's interval domain for integer variable analysis, to Cousot and Cousot's domain for comportment analysis of functional languages, and to the domain\n Sharing<\/jats:italic>\n for aliasing analysis of logic languages.\n <\/jats:p>","DOI":"10.1145\/239912.239914","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T13:52:47Z","timestamp":1033998767000},"page":"7-47","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":40,"title":["Complementation in abstract interpretation"],"prefix":"10.1145","volume":"19","author":[{"given":"Agostino","family":"Cortesi","sequence":"first","affiliation":[{"name":"Univ. di Venezia, Venice, Italy"}]},{"given":"Gilberto","family":"Fil\u00e9","sequence":"additional","affiliation":[{"name":"Univ. di Padova, Padua, Italy"}]},{"given":"Francesco","family":"Ranzato","sequence":"additional","affiliation":[{"name":"Univ. di Padova, Padua, Italy"}]},{"given":"Roberto","family":"Giacobazzi","sequence":"additional","affiliation":[{"name":"Univ. di Pisa, Pisa, Italy"}]},{"given":"Catuscia","family":"Palamidessi","sequence":"additional","affiliation":[{"name":"Univ. di Genova, Genoa, Italy"}]}],"member":"320","published-online":{"date-parts":[[1997,1]]},"reference":[{"key":"e_1_2_1_1_1","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the 1st International Static Analysis Symposium (SAS 'gJ), B. Le Charlier, Ed","author":"ARMSTRONG T.","unstructured":"ARMSTRONG , T. , MARRIOTT , I~. , SCHACHTE , P. , AND SONDERGAARD , H. 1994. Boolean functions for dependency analysis: Algebraic properties and efficient representation . In Proceedings of the 1st International Static Analysis Symposium (SAS 'gJ), B. Le Charlier, Ed . Lecture Notes in Computer Science , vol. 864 . Springer-Verlag , Berlin , 266-280. ARMSTRONG, T., MARRIOTT, I~., SCHACHTE, P., AND SONDERGAARD, H. 1994. Boolean functions for dependency analysis: Algebraic properties and efficient representation. In Proceedings of the 1st International Static Analysis Symposium (SAS 'gJ), B. Le Charlier, Ed. Lecture Notes in Computer Science, vol. 864. Springer-Verlag, Berlin, 266-280."},{"key":"e_1_2_1_2_1","volume-title":"Lattice Theory. AMS Colloquium Publication","author":"BIRKHOFF G.","unstructured":"BIRKHOFF , G. 1967. Lattice Theory. AMS Colloquium Publication , 3 rd edition. AMS , Providence, R.I. BIRKHOFF, G. 1967. Lattice Theory. AMS Colloquium Publication, 3rd edition. AMS, Providence, R.I.","edition":"3"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/200994.200998"},{"key":"e_1_2_1_4_1","first-page":"172","volume-title":"Proceedings of the 199~ International Logic Programming Symposium (ILPS '9~ ), M. Bruynooghe, Ed. The MIT Press","author":"COMINI M.","year":"1994","unstructured":"COMINI , M. AND LEVI , G. 1994 . An algebraic theory of observables . In Proceedings of the 199~ International Logic Programming Symposium (ILPS '9~ ), M. Bruynooghe, Ed. The MIT Press , Cambridge, Mass. , 172 - 186 . COMINI, M. AND LEVI, G. 1994. An algebraic theory of observables. In Proceedings of the 199~ International Logic Programming Symposium (ILPS '9~ ), M. Bruynooghe, Ed. The MIT Press, Cambridge, Mass., 172-186."},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/3-540-55719-9_101","volume-title":"Proceedings of the 19th International Colloquium on Automata, Languages and Programming (ICALP '92)","volume":"623","author":"CORTESI A.","year":"1992","unstructured":"CORTESI , A. , FILI~ , G. , AND WINSBOROUGH , W. 1992 . Comparison of abstract interpretations . In Proceedings of the 19th International Colloquium on Automata, Languages and Programming (ICALP '92) , W. Kuich, Ed. Lecture Notes in Computer Science , vol. 623 . Springer-Verlag, Berlin, 521 - 532 . CORTESI, A., FILI~, G., AND WINSBOROUGH, W. 1992. Comparison of abstract interpretations. In Proceedings of the 19th International Colloquium on Automata, Languages and Programming (ICALP '92), W. Kuich, Ed. Lecture Notes in Computer Science, vol. 623. Springer-Verlag, Berlin, 521-532."},{"issue":"2","key":"e_1_2_1_6_1","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0743-1066(95)00123-9","article-title":"Optimal groundness analysis using propositionM logic","volume":"27","author":"CORTESI A.","year":"1996","unstructured":"CORTESI , A. , FILI~ , G. , AND WINSBOROUGH , W. 1996 . Optimal groundness analysis using propositionM logic . J. Logic Program. 27 , 2 , 137 - 167 . CORTESI, A., FILI~, G., AND WINSBOROUGH, W. 1996. Optimal groundness analysis using propositionM logic. J. Logic Program. 27, 2, 137-167.","journal-title":"J. Logic Program."},{"key":"e_1_2_1_8_1","first-page":"106","volume-title":"Proceedings of the 2nd International Symposium on Programming. Dunod","author":"COUSOT P.","year":"1976","unstructured":"COUSOT , P. AND COUSOT , R. 1976 . Static determination of dynamic properties of programs . In Proceedings of the 2nd International Symposium on Programming. Dunod , Paris , 106 - 130 . COUSOT, P. AND COUSOT, R. 1976. Static determination of dynamic properties of programs. In Proceedings of the 2nd International Symposium on Programming. Dunod, Paris, 106-130."},{"key":"e_1_2_1_9_1","first-page":"238","volume-title":"Conference Record of the Jth ACM Symposium on Principles of Programming Languages (POPL '77)","author":"COUSOT P.","year":"1977","unstructured":"COUSOT , P. AND COUSOT , R. 1977 . Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints . In Conference Record of the Jth ACM Symposium on Principles of Programming Languages (POPL '77) . ACM Press, New York , 238 - 252 . 10.1145\/512950.512973 COUSOT, P. AND COUSOT, R. 1977. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the Jth ACM Symposium on Principles of Programming Languages (POPL '77). ACM Press, New York, 238-252. 10.1145\/512950.512973"},{"key":"e_1_2_1_10_1","first-page":"269","volume-title":"Conference Record of the 6th ACM Symposium on Principles of Programming Languages (POPL '79)","author":"COUSOT P.","year":"1979","unstructured":"COUSOT , P. AND COUSOT , R. 1979 . Systematic design of program analysis frameworks . In Conference Record of the 6th ACM Symposium on Principles of Programming Languages (POPL '79) . ACM Press, New York , 269 - 282 . 10.1145\/567752.567778 COUSOT, P. AND COUSOT, R. 1979. Systematic design of program analysis frameworks. In Conference Record of the 6th ACM Symposium on Principles of Programming Languages (POPL '79). ACM Press, New York, 269-282. 10.1145\/567752.567778"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(92)90030-7"},{"key":"e_1_2_1_12_1","first-page":"83","volume-title":"Conference Record of the 19th A CM Symposium on Principles of Programming Languages (POPL '92)","author":"COUSOT P.","year":"1992","unstructured":"COUSOT , P. AND COUSOT , R. 1992 b. Inductive definitions, semantics and abstract interpretation . In Conference Record of the 19th A CM Symposium on Principles of Programming Languages (POPL '92) . ACM Press, New York , 83 - 94 . 10.1145\/143165.143184 COUSOT, P. AND COUSOT, R. 1992b. Inductive definitions, semantics and abstract interpretation. In Conference Record of the 19th A CM Symposium on Principles of Programming Languages (POPL '92). ACM Press, New York, 83-94. 10.1145\/143165.143184"},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the IEEE International Conference on Computer Languages (ICCL 'gJ). IEEE Computer Society Press, Los Alamitos, Calif., 95-112","author":"COUSOT P.","year":"1994","unstructured":"COUSOT , P. AND COUSOT , R. 1994 . Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and per analysis of functional languages) . In Proceedings of the IEEE International Conference on Computer Languages (ICCL 'gJ). IEEE Computer Society Press, Los Alamitos, Calif., 95-112 . COUSOT, P. AND COUSOT, R. 1994. Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and per analysis of functional languages). In Proceedings of the IEEE International Conference on Computer Languages (ICCL 'gJ). IEEE Computer Society Press, Los Alamitos, Calif., 95-112."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(91)90017-J"},{"key":"e_1_2_1_16_1","volume-title":"Introduction to Lattices and Order","author":"DAVEY B. A.","unstructured":"DAVEY , B. A. AND PRIESTLEY , H. A. 1990. Introduction to Lattices and Order . Cambridge University Press , Cambridge, U.K. DAVEY, B. A. AND PRIESTLEY, H. A. 1990. Introduction to Lattices and Order. Cambridge University Press, Cambridge, U.K."},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1016\/S1385-7258(54)50072-7","article-title":"On the closure operators of a complete lattice","volume":"16","author":"DWINGER P.","year":"1954","unstructured":"DWINGER , P. 1954 . On the closure operators of a complete lattice . Indagationes Mathematicae 16 , 560 - 563 . DWINGER, P. 1954. On the closure operators of a complete lattice. Indagationes Mathematicae 16, 560-563.","journal-title":"Indagationes Mathematicae"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/234528.234742"},{"key":"e_1_2_1_19_1","first-page":"348","volume-title":"Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming (JICSLP '96)","author":"FILI~ G.","year":"1996","unstructured":"FILI~ , G. AND RANZATO , F. 1996 . Complementation of abstract domains made easy . In Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming (JICSLP '96) , M. Maher, Ed. The MIT Press, Cambridge, Mass. , 348 - 362 . FILI~, G. AND RANZATO, F. 1996. Complementation of abstract domains made easy. In Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming (JICSLP '96), M. Maher, Ed. The MIT Press, Cambridge, Mass., 348-362."},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1215\/S0012-7094-62-02951-4","article-title":"Pseudo-complements in semi-lattices","volume":"29","author":"FRINK O.","year":"1962","unstructured":"FRINK , O. 1962 . Pseudo-complements in semi-lattices . Duke Math. J. 29 , 505 - 514 . FRINK, O. 1962. Pseudo-complements in semi-lattices. Duke Math. J. 29, 505-514.","journal-title":"Duke Math. J."},{"key":"e_1_2_1_21_1","first-page":"503","volume-title":"Proceedings of the 13th International Symposium on Theoretical Aspects of Computer Science (STACS '96)","volume":"1046","author":"GIACOBAZZI~ R.","year":"1996","unstructured":"GIACOBAZZI~ R. 1996 . \" Optimal\" collecting semantics for analysis in a hierarchy of logic program semantics . In Proceedings of the 13th International Symposium on Theoretical Aspects of Computer Science (STACS '96) , C. Puech and R. Reischuk, Eds. Lecture Notes in Computer Science , vol. 1046 . Springer-Verlag, Berlin, 503 - 514 . GIACOBAZZI~ R. 1996. \"Optimal\" collecting semantics for analysis in a hierarchy of logic program semantics. In Proceedings of the 13th International Symposium on Theoretical Aspects of Computer Science (STACS '96), C. Puech and R. Reischuk, Eds. Lecture Notes in Computer Science, vol. 1046. Springer-Verlag, Berlin, 503-514."},{"issue":"3","key":"e_1_2_1_22_1","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/BF01236765","article-title":"Weak relative pseudo-complements of closure operators","volume":"36","author":"GIACOBAZZI~ R.","year":"1996","unstructured":"GIACOBAZZI~ R. , PALAMIDESSI~ C. , AND RANZATO~ F. 1996 . Weak relative pseudo-complements of closure operators . Algebra Universalis 36 , 3 , 405 - 412 . GIACOBAZZI~ R., PALAMIDESSI~ C., AND RANZATO~ F. 1996. Weak relative pseudo-complements of closure operators. Algebra Universalis 36, 3, 405-412.","journal-title":"Algebra Universalis"},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/3-540-61735-3_16","volume-title":"Proceedings of the 5th International Conference on Algebraic and Logic Programming (ALP '96)","author":"GIACOBAZZI~ R.","year":"1996","unstructured":"GIACOBAZZI~ R. AND RANZATO~ F. 1996 . Complementing logic program semantics . In Proceedings of the 5th International Conference on Algebraic and Logic Programming (ALP '96) , M. Hanus and M. Rodrfguez Artalejo, Eds. Lecture Notes in Computer Science. Springer-Verlag, Berlin , 238 - 253 . GIACOBAZZI~ R. AND RANZATO~ F. 1996. Complementing logic program semantics. In Proceedings of the 5th International Conference on Algebraic and Logic Programming (ALP '96), M. Hanus and M. Rodrfguez Artalejo, Eds. Lecture Notes in Computer Science. Springer-Verlag, Berlin, 238-253."},{"key":"e_1_2_1_24_1","volume-title":"A Compendium of Continuous Lattices","author":"GIERZ~ G.","unstructured":"GIERZ~ G. , HOFMANN~ K. H. , KEIMEL~ K. , LAWSON~ J. D. , MISLOVE~ M. , AND SCOTT~ D. S. 1980. A Compendium of Continuous Lattices . Springer-Verlag , Berlin . GIERZ~ G., HOFMANN~ K. H., KEIMEL~ K., LAWSON~ J. D., MISLOVE~ M., AND SCOTT~ D. S. 1980. A Compendium of Continuous Lattices. Springer-Verlag, Berlin."},{"key":"e_1_2_1_25_1","volume-title":"General Lattice Theory","author":"GRXTZER G.","unstructured":"GRXTZER , G. 1978. General Lattice Theory . Birkhguser Verlag , Basel, Switzerland . GRXTZER, G. 1978. General Lattice Theory. Birkhguser Verlag, Basel, Switzerland."},{"key":"e_1_2_1_26_1","first-page":"156","volume-title":"Proceedings of the 1990 Glasgow Functional Programming Workshop, S. Peyton Jones, G. Hutton, and C. K. Holst, Eds. Workshops in Computing. Springer-Verlag","author":"HUNT S.","year":"1990","unstructured":"HUNT , S. 1990 . PERs generalize projections for strictness analysis . In Proceedings of the 1990 Glasgow Functional Programming Workshop, S. Peyton Jones, G. Hutton, and C. K. Holst, Eds. Workshops in Computing. Springer-Verlag , Berlin , 156 - 168 . HUNT, S. 1990. PERs generalize projections for strictness analysis. In Proceedings of the 1990 Glasgow Functional Programming Workshop, S. Peyton Jones, G. Hutton, and C. K. Holst, Eds. Workshops in Computing. Springer-Verlag, Berlin, 156-168."},{"key":"e_1_2_1_27_1","first-page":"154","volume-title":"Proceedings of the 1989 North American Conference on Logic Programming (NACLP '89)","author":"JACOBS D.","year":"1989","unstructured":"JACOBS , D. AND LANGEN , A. 1989 . Accurate and efficient approximation of variable aliasing in logic programs . In Proceedings of the 1989 North American Conference on Logic Programming (NACLP '89) , E. L. Lusk and R. A. Overbeek, Eds. The MIT Press, Cambridge, Mass. , 154 - 165 . JACOBS, D. AND LANGEN, A. 1989. Accurate and efficient approximation of variable aliasing in logic programs. In Proceedings of the 1989 North American Conference on Logic Programming (NACLP '89), E. L. Lusk and R. A. Overbeek, Eds. The MIT Press, Cambridge, Mass., 154-165."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(92)90034-Z"},{"key":"e_1_2_1_29_1","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF00290339","article-title":"Monotone data flow analysis frameworks","volume":"7","author":"KAM J. B.","year":"1977","unstructured":"KAM , J. B. AND ULLMAN , J. D. 1977 . Monotone data flow analysis frameworks . Acta Informatica 7 , 305 - 317 . KAM, J. B. AND ULLMAN, J. D. 1977. Monotone data flow analysis frameworks. Acta Informatica 7, 305-317.","journal-title":"Acta Informatica"},{"key":"e_1_2_1_30_1","first-page":"194","volume-title":"Conference Record of the 1st ACM Symposium on Principles of Programming Languages (POPL '73)","author":"KILDALL G. A.","year":"1973","unstructured":"KILDALL , G. A. 1973 . A unified approach to global program optimization . In Conference Record of the 1st ACM Symposium on Principles of Programming Languages (POPL '73) . ACM Press, New York , 194 - 206 . 10.1145\/512927.512945 KILDALL, G. A. 1973. A unified approach to global program optimization. In Conference Record of the 1st ACM Symposium on Principles of Programming Languages (POPL '73). ACM Press, New York, 194-206. 10.1145\/512927.512945"},{"key":"e_1_2_1_31_1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/3-540-61735-3_14","volume-title":"Proceedings of the 5th International Conference on Algebraic and Logic Programming (ALP '96)","author":"MARCHIORI E.","year":"1996","unstructured":"MARCHIORI , E. 1996 . Prime factorizations of abstract domains using first order logic . In Proceedings of the 5th International Conference on Algebraic and Logic Programming (ALP '96) , M. Hanus and M. Rodrfguez Artalejo, Eds. Lecture Notes in Computer Science. Springer-Verlag, Berlin , 209 - 223 . MARCHIORI, E. 1996. Prime factorizations of abstract domains using first order logic. In Proceedings of the 5th International Conference on Algebraic and Logic Programming (ALP '96), M. Hanus and M. Rodrfguez Artalejo, Eds. Lecture Notes in Computer Science. Springer-Verlag, Berlin, 209-223."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/176454.176519"},{"issue":"3","key":"e_1_2_1_33_1","first-page":"135","article-title":"Note on complemented closure operators of complete lattices","volume":"21","author":"MORGADO J.","year":"1962","unstructured":"MORGADO , J. 1962 . Note on complemented closure operators of complete lattices . Portugalice- Mathematica 21 , 3 , 135 - 142 . MORGADO, J. 1962. Note on complemented closure operators of complete lattices. Portugalice- Mathematica 21, 3, 135-142.","journal-title":"Portugalice- Mathematica"},{"key":"e_1_2_1_34_1","first-page":"49","volume-title":"Proceedings of the 8th International Conference on Logic Programming (ICLP '91 ), K. Furukawa, Ed. The MIT Press","author":"MUTHUKUMAR K.","year":"1991","unstructured":"MUTHUKUMAR , K. AND HERMENEGILDO , M. 1991 . Combined determination of sharing and freeness of program variables through abstract interpretation . In Proceedings of the 8th International Conference on Logic Programming (ICLP '91 ), K. Furukawa, Ed. The MIT Press , Cambridge, Mass. , 49 - 63 . MUTHUKUMAR, K. AND HERMENEGILDO, M. 1991. Combined determination of sharing and freeness of program variables through abstract interpretation. In Proceedings of the 8th International Conference on Logic Programming (ICLP '91 ), K. Furukawa, Ed. The MIT Press, Cambridge, Mass., 49-63."},{"key":"e_1_2_1_35_1","first-page":"270","volume-title":"Proceedings of the ~th International Symposium on Programming, B. Robinet, Ed. Lecture Notes in Computer Science","volume":"83","author":"MYCROFT A.","year":"1980","unstructured":"MYCROFT , A. 1980 . The theory and practice of transforming call-by-need into call-by-value . In Proceedings of the ~th International Symposium on Programming, B. Robinet, Ed. Lecture Notes in Computer Science , vol. 83 . Springer-Verlag, Berlin , 270 - 281 . MYCROFT, A. 1980. The theory and practice of transforming call-by-need into call-by-value. In Proceedings of the ~th International Symposium on Programming, B. Robinet, Ed. Lecture Notes in Computer Science, vol. 83. Springer-Verlag, Berlin, 270-281."},{"key":"e_1_2_1_37_1","first-page":"179","volume-title":"Proceedings of the A CM Symposium on Partial Evaluation and Program Manipulation (PEPM '93)","author":"MYCROFT A.","year":"1993","unstructured":"MYCROFT , A. 1993 . Completeness and predicate-based abstract interpretation . In Proceedings of the A CM Symposium on Partial Evaluation and Program Manipulation (PEPM '93) . ACM Press, New York , 179 - 185 . 10.1145\/154630.154648 MYCROFT, A. 1993. Completeness and predicate-based abstract interpretation. In Proceedings of the A CM Symposium on Partial Evaluation and Program Manipulation (PEPM '93). ACM Press, New York, 179-185. 10.1145\/154630.154648"},{"key":"e_1_2_1_38_1","volume-title":"Proceedings of the ~th Hungarian Computer Science Conference, M. Aratd, I. K~tai, and L. Varga, Eds. 211-225","author":"NIELSON F.","year":"1985","unstructured":"NIELSON , F. 1985 . Tensor products generalize the relational data flow analysis method . In Proceedings of the ~th Hungarian Computer Science Conference, M. Aratd, I. K~tai, and L. Varga, Eds. 211-225 . NIELSON, F. 1985. Tensor products generalize the relational data flow analysis method. In Proceedings of the ~th Hungarian Computer Science Conference, M. Aratd, I. K~tai, and L. Varga, Eds. 211-225."},{"key":"e_1_2_1_39_1","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/3-540-56287-7_106","volume-title":"Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science (FST~iTCS '92)","volume":"652","author":"SUNDARARAJAN R.","year":"1992","unstructured":"SUNDARARAJAN , R. AND CONERY , J. 1992 . An abstract interpretation scheme for groundness, freeness, and sharing analysis of logic programs . In Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science (FST~iTCS '92) , R. Shyamasundar, Ed. Lecture Notes in Computer Science , vol. 652 . Springer-Verlag, Berlin, 203 - 216 . SUNDARARAJAN, R. AND CONERY, J. 1992. An abstract interpretation scheme for groundness, freeness, and sharing analysis of logic programs. In Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science (FST~iTCS '92), R. Shyamasundar, Ed. Lecture Notes in Computer Science, vol. 652. Springer-Verlag, Berlin, 203-216."},{"issue":"4","key":"e_1_2_1_40_1","first-page":"1","article-title":"Contribution ~ l'6tude des treillis pseudo-compl6ment6s et des treillis de Stone","volume":"8","author":"VARLET J.","year":"1963","unstructured":"VARLET , J. 1963 . Contribution ~ l'6tude des treillis pseudo-compl6ment6s et des treillis de Stone . Mdmoires de la Socidtd Royale des Sciences de Liege 8 , 4 , 1 - 71 . VARLET, J. 1963. Contribution ~ l'6tude des treillis pseudo-compl6ment6s et des treillis de Stone. Mdmoires de la Socidtd Royale des Sciences de Liege 8, 4, 1-71.","journal-title":"Mdmoires de la Socidtd Royale des Sciences de Liege"},{"key":"e_1_2_1_41_1","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/3-540-18317-5_21","volume-title":"Proceedings of the Conference on Functional Programming Languages and Computer Architecture (FPCA '87)","volume":"274","author":"WADLER P.","year":"1987","unstructured":"WADLER , P. AND HUGHES , R. J. iV{. 1987 . Projections for strictness analysis . In Proceedings of the Conference on Functional Programming Languages and Computer Architecture (FPCA '87) , G. Kahn, Ed. Lecture Notes in Computer Science , vol. 274 . Springer-Verlag, Berlin, 385 - 407 . WADLER, P. AND HUGHES, R. J. iV{. 1987. Projections for strictness analysis. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture (FPCA '87), G. Kahn, Ed. Lecture Notes in Computer Science, vol. 274. Springer-Verlag, Berlin, 385-407."},{"issue":"2","key":"e_1_2_1_42_1","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","unstructured":"WARD , ~\/{. 1942 . The closure operators of a lattice . Ann. Math. 43 , 2 , 191 - 196 . WARD, ~\/{. 1942. The closure operators of a lattice. Ann. Math. 43, 2, 191-196.","journal-title":"Ann. Math."},{"key":"e_1_2_1_43_1","first-page":"246","volume-title":"Conference Record of the 20th A CM Symposium on Principles of Programming Languages (POPL '93)","author":"YI K.","year":"1993","unstructured":"YI , K. AND HARRISON , W. L. 1993 . Automatic generation and management of interprocedural program analyses . In Conference Record of the 20th A CM Symposium on Principles of Programming Languages (POPL '93) . ACM Press, New York , 246 - 259 . 10.1145\/158511.158642 YI, K. AND HARRISON, W. L. 1993. Automatic generation and management of interprocedural program analyses. In Conference Record of the 20th A CM Symposium on Principles of Programming Languages (POPL '93). ACM Press, New York, 246-259. 10.1145\/158511.158642"}],"container-title":["ACM Transactions on Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/239912.239914","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T08:52:17Z","timestamp":1672390337000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/239912.239914"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["10.1145\/239912.239914"],"URL":"http:\/\/dx.doi.org\/10.1145\/239912.239914","relation":{},"ISSN":["0164-0925","1558-4593"],"issn-type":[{"value":"0164-0925","type":"print"},{"value":"1558-4593","type":"electronic"}],"subject":["Software"],"published":{"date-parts":[[1997,1]]},"assertion":[{"value":"1997-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}