Path dependent analysis of logic programs
PEPM '02 Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
On proving left termination of constraint logic programs
ACM Transactions on Computational Logic (TOCL)
How to Transform an Analyzer into a Verifier
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Analysis of Polymorphically Typed Logic Programs Using ACI-Unification
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
A Framework for Analysis of Typed Logic Programs
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
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
The Def-inite Approach to Dependency Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Meta-circular abstract interpretation in prolog
The essence of computation
Path Dependent Analysis of Logic Programs
Higher-Order and Symbolic Computation
Disunification in ACI1 Theories
Constraints
Abstract interpretation based verification of logic programs
Science of Computer Programming
Making abstract domains condensing
ACM Transactions on Computational Logic (TOCL)
Checking modes of HAL programs
Theory and Practice of Logic Programming
Theory and Practice of Logic Programming
A backward analysis for constraint logic programs
Theory and Practice of Logic Programming
A practical type analysis for verification of modular prolog programs
PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Improving precision of type analysis using non-discriminative union
Theory and Practice of Logic Programming
Checking Emptiness of Non-Deterministic Regular Types with Set Operators
Electronic Notes in Theoretical Computer Science (ENTCS)
Inferring precise polymorphic type dependencies in logic programs
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Fully automatic binding-time analysis for prolog
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
| Hi-index | 5.23 |