Sharing and groundness dependencies in logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Making abstract interpretations complete
Journal of the ACM (JACM)
Enhanced sharing analysis techniques: a comprehensive evaluation
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Set-sharing is redundant for pair-sharing
Theoretical Computer Science
Implementing Groundness Analysis with Definite Boolean Functions
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
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
Boolean Functions for Finite-Tree Dependencies
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Boolean Constraints for Binding-Time Analysis
PADO '01 Proceedings of the Second Symposium on Programs as Data Objects
Factorizing Equivalent Variable Pairs in ROBDD-Based Implementations of Pos
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
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 Developing Embeddable Customized Logics
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Parameterizing a Groundness Analysis of Logic Programs
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
The Def-inite Approach to Dependency Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Quotienting Share for Dependency Analysis
ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
Pair-independence and freeness analysis through linear refinement
Information and Computation
Approximating the success set of logic programs using constrained regular types
ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16
Efficient groundness analysis in Prolog
Theory and Practice of Logic Programming
Finite-tree analysis for constraint logic-based languages
Information and Computation
Non-determinism analyses in a parallel-functional language
Journal of Functional Programming
Enhanced sharing analysis techniques: a comprehensive evaluation
Theory and Practice of Logic Programming
Inferring termination conditions for logic programs using backwards analysis
Theory and Practice of Logic Programming
cTI: a constraint-based termination inference tool for ISO-Prolog
Theory and Practice of Logic Programming
Making abstract domains condensing
ACM Transactions on Computational Logic (TOCL)
Boolean equation solving as graph traversal
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
A backward analysis for constraint logic programs
Theory and Practice of Logic Programming
Inferring non-suspension conditions for logic programs with dynamic scheduling
ACM Transactions on Computational Logic (TOCL)
A framework for abstract interpretation of timed concurrent constraint programs
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Goal-independent suspension analysis for logic programs with dynamic scheduling
ESOP'03 Proceedings of the 12th European conference on Programming
Approximate quantifier elimination for propositional boolean formulae
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Software and Systems Modeling (SoSyM)
Existential quantification as incremental SAT
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Magic-sets for localised analysis of Java bytecode
Higher-Order and Symbolic Computation
FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
Determinacy inference for logic programs
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Detecting non-cyclicity by abstract compilation into boolean functions
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Boolean equation solving as graph traversal
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
| Hi-index | 0.00 |