A general framework to build contextual cover set
Journal of Symbolic Computation - Calculemus-99: integrating computation and deduction
Computing constructor forms with non terminating rewrite programs
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Simultaneous checking of completeness and ground confluence for algebraic specifications
ACM Transactions on Computational Logic (TOCL)
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
Electronic Notes in Theoretical Computer Science (ENTCS)
Validation of the JavaCard platform with implicit induction techniques
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Order-sorted parameterization and induction
Semantics and algebraic specification
Constructors, sufficient completeness, and deadlock freedom of rewrite theories
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Automatic 'descente infinie' induction reasoning
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Narrowing, abstraction and constraints for proving properties of reduction relations
Rewriting Computation and Proof
Applying a theorem prover to the verification of optimistic replication algorithms
Rewriting Computation and Proof
| Hi-index | 5.23 |