A symbolic constraint solving framework for analysis of logic programs

A practical framework for the abstract interpretation of logic programs

Journal of Logic Programming

Abstract interpretation of logic programs: an abstract domain for groundness, sharing, freeness and compoundness analysis

PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation

Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys (CSUR)

Abstract interpretation and application to logic programs

Journal of Logic Programming

Bottom-up dataflow analysis of normal logic programs

Journal of Logic Programming

Compile-time derivation of variable dependency using abstract interpretation

Journal of Logic Programming

Experimental evaluation of a generic abstract interpretation algorithm for PROLOG

ACM Transactions on Programming Languages and Systems (TOPLAS)

Analysing logic programs using “prop”-ositional logic programs and a magic wand

ILPS '93 Proceedings of the 1993 international symposium on Logic programming

Automatic discovery of linear restraints among variables of a program

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation

PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming

Efficient Bottom-up Abstract Interpretation of Prolog by Means of Constraint Solving over Symbolic Finite Domains

PLILP '93 Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming