Efficient deductive methods for program analysis
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Constraints and theorem proving
Constraints in computational logics
A General Setting for Flexibly Combining and Augmenting Decision Procedures
Journal of Automated Reasoning
Rewrite Closure for Ground and Cancellative AC Theories
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Uniform Derivation of Decision Procedures by Superposition
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
A New Meta-complexity Theorem for Bottom-Up Logic Programs
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
A rewriting approach to satisfiability procedures
Information and Computation - RTA 2001
Journal of Automated Reasoning
Fast congruence closure and extensions
Information and Computation
Type checking with open type functions
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Deciding equality in the constructor theory
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Combining equational reasoning
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Abstract interpretation with alien expressions and heap structures
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Outsidein(x) modular type inference with local assumptions
Journal of Functional Programming - Dedicated to ICFP 2009
Proof-producing congruence closure
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Hi-index | 0.00 |