Research interests: Term rewriting systems, Formal verification, Programming languages
e-mail: haru __AT__ complex.ist.hokudai.ac.jp
Encoding Dependency Pair Techniques and Control Strategies for Maximal Completion,
Proc. of the 25th International Conference on Automated Deduction (CADE-25), to appear, 2015.
A Satisfiability Encoding of Dependency Pair Techniques for Maximal Completion,
Proc. of the 14th International Workshop on Termination (WST 2014), July 2014.
Multi-Completion with Termination Tools,
Journal of Automated Reasoning, Volume 50, Issue 3, pp 317-354, March 2013.
Optimizing mkbTT (System Description),
Proc. of the 21st International Conference on Rewriting Techniques and Applications (RTA 2010),
Leibnitz International Proceedings in Informatics, Vol. 6, 373-384, July 2010.
Multi-Context Rewriting Induction with Termination Checkers,
IEICE Transactions on Information and Systems, Vol. E93-D, No. 5, 942-952, May 2010.
Constraint-based Multi-Completion Procedures for Term Rewriting Systems,
IEICE Transactions on Information and Systems, Vol. E92-D, No. 2, 220-234, Feb 2009. [PDF]
Multi-Completion with Termination Tools (System Description),
Proc. of the 4th International Joint Conference on
Automated Reasoning (IJCAR 2008), Lecture Notes in Computer Science, Vol. 5195, 306-312, August 2008. [PDF(LNCS)]
Implementation and Performance Evaluation of Multi-Completion Procedures for Term Rewriting Systems with Recursive Path Orderings with Status (in Japanese),
IEICE Transactions on Information and Systems (Japanese Edition), Vol. J89-D, No. 4, 624-631, Apr 2006.