Proofs and types
Static inference of modes and data dependencies in logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Algebraic properties of idempotent substitutions
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Handbook of theoretical computer science (vol. B)
Abstract interpretation and application to logic programs
Journal of Logic Programming
Precise and efficient groundness analysis for logic programs
ACM Letters on Programming Languages and Systems (LOPLAS)
Denotational abstract interpretation of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Improving abstract interpretations by systematic lifting to the powerset
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
A unifying view of abstract domain design
ACM Computing Surveys (CSUR)
A logical model for relational abstract domains
ACM Transactions on Programming Languages and Systems (TOPLAS)
The powerset operator on abstract interpretations
Theoretical Computer Science
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Compositional Optimization of Disjunctive Abstract Interpretations
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
Completeness in Abstract Interpretation: A Domain Perspective
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Intuitionistic Implication in Abstract Interpretation
PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
"Optimal" Collecting Semantics for Analysis in a Hierarchy of Logic Program Semantics
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Pair-independence and freeness analysis through linear refinement
Information and Computation
Making abstract domains condensing
ACM Transactions on Computational Logic (TOCL)
A backward analysis for constraint logic programs
Theory and Practice of Logic Programming
Deriving escape analysis by abstract interpretation
Higher-Order and Symbolic Computation
Optimality and condensing of information flow through linear refinement
Theoretical Computer Science
Theoretical foundations and semantics of logic programming
A 25-year perspective on logic programming
Static analysis, abstract interpretation and verification in (constraint logic) programming
A 25-year perspective on logic programming
Information flow is linear refinement of constancy
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
| Hi-index | 5.23 |
In the context of the abstract interpretation theory, we study the relations among various abstract domains for groundness analysis of the logic programs. We reconstruct the well-known domain as a logical domain in a fully automatic way and we prove that it is the best abstract domain which can be set up from the property of groundness by applying logic operators only. We propose a new notion of optimality which precisely captures the relation between and its natural concrete domain. This notion enables us to discriminate between the various abstract domains for groundness analysis from a computational point of view and to compare their relative precision. Finally, we propose a new domain for groundness analysis which has the advantage of being independent from the specific program and we show it optimality. Copyright 2002 Elsevier Science B.V.