A general framework to build contextual cover set
Journal of Symbolic Computation - Calculemus-99: integrating computation and deduction
Observational proofs by rewriting
Theoretical Computer Science
Incorporating decision procedures in implicit induction
Journal of Symbolic Computation - Integrated reasoning and algebra systems
Tool-Assisted Specification and Verification of the JavaCard Platform
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Efficient Reasoning about Executable Specifications in Coq
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Test Sets for the Universal and Existential Closure of Regular Tree Languages
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Automated Induction with Constrained Tree Automata
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Superposition for Fixed Domains
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
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
Superposition for fixed domains
ACM Transactions on Computational Logic (TOCL)
Deciding the inductive validity of ∀∃* queries
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Inductive decidability using implicit induction
LPAR'06 Proceedings of the 13th 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
Dealing with non-orientable equations in rewriting induction
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Coverset induction with partiality and subsorts: a powerlist case study
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Rewriting induction + linear arithmetic = decision procedure
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Hi-index | 0.00 |