Optimal domains for disjunctive abstract interpretation
- 1 September 1998
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 32 (1-3) , 177-210
- https://doi.org/10.1016/s0167-6423(97)00034-8
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Weak relative pseudo-complements of closure operatorsAlgebra universalis, 1996
- A unifying view of abstract domain designACM Computing Surveys, 1996
- Abstract interpretationACM Computing Surveys, 1996
- Optimal groundness analysis using propositional logicThe Journal of Logic Programming, 1996
- Precise and efficient groundness analysis for logic programsACM Letters on Programming Languages and Systems, 1993
- A general framework for semantics-based bottom-up abstract interpretation of logic programsACM Transactions on Programming Languages and Systems, 1993
- Abstract interpretation and application to logic programsThe Journal of Logic Programming, 1992
- On derived dependencies and connected databasesThe Journal of Logic Programming, 1991
- Strong abstract interpretation using power domainsPublished by Springer Nature ,1983
- The Closure Operators of a LatticeAnnals of Mathematics, 1942