On derived dependencies and connected databases
Journal of Logic Programming
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Static analysis of logic programs for independent and parallelism
Journal of Logic Programming
Groundness analysis for Prolog: implementation and evaluation of domain prop
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Compositional analysis of modular logic programs
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Denotational abstract interpretation of logic programs
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
Abstract interpretation: a kind of magic
PLILP '91 Selected papers of the symposium on Programming language implementation and logic programming
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the Complexity of Dataflow Analysis of Logic Programs
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Advanced techniques for approximating variable aliasing in logic programs
Advanced techniques for approximating variable aliasing in logic programs
Denotational abstract interpretation of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the complexity of dataflow analysis of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Complementation in abstract interpretation
ACM Transactions on Programming Languages and Systems (TOPLAS)
A logical model for relational abstract domains
ACM Transactions on Programming Languages and Systems (TOPLAS)
Sharing and groundness dependencies in logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Making abstract interpretations complete
Journal of the ACM (JACM)
Logic programming revisited: logic programs as inductive definitions
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Logical optimality of groundness analysis
Theoretical Computer Science
Precise pair-sharing analysis of logic programs
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Positive Boolean Functions as Multiheaded Clauses
Proceedings of the 17th International Conference on Logic Programming
Higher-Precision Groundness Analysis
Proceedings of the 17th International Conference on Logic Programming
Inferring Termination Conditions for Logic Programs Using Backwards Analysis
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Boolean Functions for Finite-Tree Dependencies
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Analysis of Downward Closed Properties of Logic Programs
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
A Framework for Analysis of Typed Logic Programs
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
Combining Norms to Prove Termination
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Pos(T): Analyzing Dependencies in Typed Logic Programs
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Analysis of Logic Programs with Delay
LOPSTR '97 Proceedings of the 7th International Workshop on Logic Programming Synthesis and Transformation
Reuse of Results in Termination Analysis of Typed Logic Programs
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Parameterizing a Groundness Analysis of Logic Programs
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Backward Type Inference Generalises Type Checking
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Pair-independence and freeness analysis through linear refinement
Information and Computation
Efficient groundness analysis in Prolog
Theory and Practice of Logic Programming
Finite-tree analysis for constraint logic-based languages
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
Termination analysis of logic programs through combination of type-based norms
ACM Transactions on Programming Languages and Systems (TOPLAS)
Inferring non-suspension conditions for logic programs with dynamic scheduling
ACM Transactions on Computational Logic (TOCL)
Test frame updating in CPM testing of Prolog programs
Software Quality Control
Theoretical foundations and semantics of logic programming
A 25-year perspective on logic programming
An incremental approach to abstraction-carrying code
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Converting one type-based abstract domain to another
LOPSTR'05 Proceedings of the 15th international conference on Logic Based Program Synthesis and Transformation
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
| Hi-index | 0.00 |
We show how precise groundness information can be extracted from logic programs. The idea is to use abstract interpretation with Boolean functions as “approximations” to groundness dependencies between variables. This idea is not new, and different classes of Boolean functions have been used. We argue, however, that one class, the positive functions, is more suitable than others. Positive Boolean functions have a certain property which we (inspired by A. Langen) call “condensation.” This property allows for rapid computation of groundness information.