19 著者名表示.
発行日 | タイトル |
著者 |
2003 | Automating the Dependency Pair Method | Hirokawa, Nao; Middeldorp, Aart |
2003 | Tsukuba Termination Tool | Hirokawa, Nao; Middeldorp, Aart |
2004 | Polynomial Interpretations with Negative Coefficients | Hirokawa, Nao; Middeldorp, Aart |
2004 | Dependency Pairs Revisited | Hirokawa, Nao; Middeldorp, Aart |
2005 | Tyrolean Termination Tool | Hirokawa, Nao; Middeldorp, Aart |
Jun-2005 | Automating the dependency pair method | Hirokawa, Nao; Middeldorp, Aart |
2006 | Predictive Labeling | Hirokawa, Nao; Middeldorp, Aart |
2007 | Constraints for Argument Filterings | Zankl, Harald; Hirokawa, Nao; Middeldorp, Aart |
Sep-2007 | Tyrolean termination tool: Techniques and features | Hirokawa, Nao; Middeldorp, Aart |
2008 | Uncurrying for Termination | Hirokawa, Nao; Middeldorp, Aart; Zankl, Harald |
2008 | Complexity, Graphs, and the Dependency Pair Method | Hirokawa, Nao; Moser, Georg |
2008 | Automated Complexity Analysis Based on the Dependency Pair Method | Hirokawa, Nao; Moser, Georg |
Aug-2009 | KBO Orientability | Zankl, Harald; Hirokawa, Nao; Middeldorp, Aart |
6-Mar-2012 | Confluence of Non-Left-Linear TRSs via Relative Termination | Klein, Dominik; Hirokawa, Nao |
25-Apr-2012 | Uncurrying for Termination and Complexity | Hirokawa, Nao; Middeldorp, Aart; Zankl, Harald |
Jun-2014 | AC-KBO Revisited | Yamada, Akihisa; Winkler, Sarah; Hirokawa, Nao; Middeldorp, Aart |
Jul-2014 | A New and Formalized Proof of Abstract Completion | Hirokawa, Nao; Middeldorp, Aart; Sternagel, Christian |
Jul-2014 | Automated Complexity Analysis Based on Context-Sensitive Rewriting | Hirokawa, Nao; Moser, Georg |
2017 | Infinite Runs in Abstract Completion | Hirokawa, Nao; Middeldorp, Aart; Sternagel, Christian; Winkler, Sarah |