JAIST Repository >

Nao Hirokawa Associate ProfessorFaculty Profile

No.Bibliographical information
1 項書換えの合流性解析とその応用 / 廣川, 直, 科学研究費助成事業研究成果報告書, pp.1-4, 2016-06-03
2 A New and Formalized Proof of Abstract Completion / Hirokawa, Nao, Middeldorp, Aart, Sternagel, Christian, Lecture Notes in Computer Science, 8558, pp.292-307, 2014-07, Springer
3 Automated Complexity Analysis Based on Context-Sensitive Rewriting / Hirokawa, Nao, Moser, Georg, Lecture Notes in Computer Science, 8560, pp.257-271, 2014-07, Springer
4 AC-KBO Revisited / Yamada, Akihisa, Winkler, Sarah, Hirokawa, Nao, Middeldorp, Aart, Lecture Notes in Computer Science, 8475, pp.319-335, 2014-06, Springer
5 非決定計算のための項書き換え理論 / 廣川, 直, 科学研究費助成事業研究成果報告書, pp.1-4, 2013-05-31
6 Uncurrying for Termination and Complexity / Hirokawa, Nao, Middeldorp, Aart, Zankl, Harald, Journal of Automated Reasoning, 50(3), pp.279-315, 2012-04-25, Springer
7 Confluence of Non-Left-Linear TRSs via Relative Termination / Klein, Dominik, Hirokawa, Nao, Lecture Notes in Computer Science, 7180/2102, pp.258-273, 2012-03-06, Springer
8 Maximal Completion / Klein, Dominik, Hirokawa, Nao, Proceedings of the 22nd International Conference on Rewriting Techniques and Applications (RTA'11), 10, pp.71-80, 2011-04-26, Schloss Dagstuhl
9 Decreasing Diagrams and Relative Termination / Hirokawa, Nao, Middeldorp, Aart, Proceedings of the 5th International Joint Conference on Automated Reasoning, Lecture Notes in Artificial Intelligence, 6173/2010, pp.487-501, 2010-07-13, Springer
10 項書き換えに基づく計算量解析の自動化 / 廣川, 直, 科学研究費補助金研究成果報告書, pp.1-4, 2010-05-26
11 KBO Orientability / Zankl, Harald, Hirokawa, Nao, Middeldorp, Aart, Journal of Automated Reasoning, 43(2), pp.173-201, 2009-08, Springer
12 KBO Orientability / Zankl, Harald, Hirokawa, Nao, Middeldorp, Aart, pp.1-9, 2009-03-12
13 Termination Verification and Complexity Analysis of Term Rewrite Systems / Hirokawa, Nao, pp.1-4, 2008-03-04
14 Uncurrying for Termination / Hirokawa, Nao, Middeldorp, Aart, Zankl, Harald, Lecture Notes in Computer Science, 5330/2008, pp.667-681, 2008, Springer
15 Complexity, Graphs, and the Dependency Pair Method / Hirokawa, Nao, Moser, Georg, Lecture Notes in Computer Science, 5330/2008, pp.652-666, 2008, Springer
16 Automated Complexity Analysis Based on the Dependency Pair Method / Hirokawa, Nao, Moser, Georg, Lecture Notes in Computer Science, 5195/2008, pp.364-379, 2008, Springer
17 Tyrolean termination tool: Techniques and features / Hirokawa, Nao, Middeldorp, Aart, Information and Computation, 205(4), pp.474-511, 2007-09, Elsevier
18 Constraints for Argument Filterings / Zankl, Harald, Hirokawa, Nao, Middeldorp, Aart, Lecture Notes in Computer Science, 4362/2007, pp.579-590, 2007, Springer
19 Predictive Labeling / Hirokawa, Nao, Middeldorp, Aart, Lecture Notes in Computer Science, 4098/2006, pp.313-327, 2006, Springer
20 Automating the dependency pair method / Hirokawa, Nao, Middeldorp, Aart, Information and Computation, 199(1-2), pp.172-199, 2005-06, Elsevier
21 Tyrolean Termination Tool / Hirokawa, Nao, Middeldorp, Aart, Lecture Notes in Computer Science, 3467/2005, pp.175-184, 2005, Springer
22 Polynomial Interpretations with Negative Coefficients / Hirokawa, Nao, Middeldorp, Aart, Lecture Notes in Computer Science, 3249/2004, pp.185-198, 2004, Springer
23 Dependency Pairs Revisited / Hirokawa, Nao, Middeldorp, Aart, Lecture Notes in Computer Science, 3091/2004, pp.249-268, 2004, Springer
24 Automating the Dependency Pair Method / Hirokawa, Nao, Middeldorp, Aart, Lecture Notes in Computer Science, 2741/2003, pp.32-46, 2003, Springer
25 Tsukuba Termination Tool / Hirokawa, Nao, Middeldorp, Aart, Lecture Notes in Computer Science, 2706/2003, pp.311-320, 2003, Springer

 


Contact : Library Information Section, Japan Advanced Institute of Science and Technology