Proving confluence of term rewriting systems automatically T Aoto, J Yoshida, Y Toyama Rewriting Techniques and Applications: 20th International Conference, RTA …, 2009 | 98 | 2009 |
Persistency of Confluence. T Aoto, Y Toyama J. Univers. Comput. Sci. 3 (11), 1134-1147, 1997 | 52 | 1997 |
A reduction-preserving completion for proving confluence of non-terminating term rewriting systems T Aoto, Y Toyama Logical Methods in Computer Science 8, 2012 | 33 | 2012 |
Automated confluence proof by decreasing diagrams based on rule-labelling T Aoto Proceedings of the 21st International Conference on Rewriting Techniques and …, 2010 | 28 | 2010 |
Dealing with non-orientable equations in rewriting induction T Aoto Term Rewriting and Applications: 17th International Conference, RTA 2006 …, 2006 | 28 | 2006 |
Termination of simply typed term rewriting by translation and labelling T Aoto, T Yamada International Conference on Rewriting Techniques and Applications, 380-394, 2003 | 28 | 2003 |
Program transformation by templates based on term rewriting Y Chiba, T Aoto, Y Toyama Proceedings of the 7th ACM SIGPLAN international conference on Principles …, 2005 | 25 | 2005 |
Disproving confluence of term rewriting systems by interpretation and ordering T Aoto Frontiers of Combining Systems: 9th International Symposium, FroCoS 2013 …, 2013 | 24 | 2013 |
Dependency pairs for simply typed term rewriting T Aoto, T Yamada International Conference on Rewriting Techniques and Applications, 120-134, 2005 | 24 | 2005 |
Uniqueness of normal proofs in implicational intuitionistic logic T Aoto Journal of Logic, Language and Information 8 (2), 217-242, 1999 | 22 | 1999 |
Confluence competition 2015 T Aoto, N Hirokawa, J Nagele, N Nishida, H Zankl Automated Deduction-CADE-25: 25th International Conference on Automated …, 2015 | 21 | 2015 |
Ground confluence prover based on rewriting induction T Aoto, Y Toyama 1st International Conference on Formal Structures for Computation and …, 2016 | 19 | 2016 |
Confluence of orthogonal nominal rewriting systems revisited T Suzuki, K Kikuchi, T Aoto, Y Toyama 26th International Conference on Rewriting Techniques and Applications (RTA …, 2015 | 18 | 2015 |
Designing a rewriting induction prover with an increased capability of non-orientable theorems T Aoto Proceedings of the Austrian-Japanese Workshop on Symbolic Computation in …, 2008 | 16 | 2008 |
Solution to the problem of Zantema on a persistent property of term rewriting systems T Aoto International Conference on Algebraic and Logic Programming, 250-265, 1998 | 16 | 1998 |
Sound lemma generation for proving inductive validity of equations T Aoto IARCS Annual Conference on Foundations of Software Technology and …, 2008 | 14 | 2008 |
Rewriting induction using termination checker T Aoto JSSST 24th Annual Conference, 2007, 2007 | 13 | 2007 |
Termination of simply-typed applicative term rewriting systems T Aoto, T Yamada Proc. HOR 4, 61-65, 2004 | 12 | 2004 |
On composable properties of term rewriting systems T Aoto, Y Toyama International Conference on Algebraic and Logic Programming, 114-128, 1997 | 12 | 1997 |
Decision procedures for proving inductive theorems without induction T Aoto, S Stratulat Proceedings of the 16th International Symposium on Principles and Practice …, 2014 | 11 | 2014 |