| Partial inversion of constructor term rewriting systems N Nishida, M Sakai, T Sakabe Term Rewriting and Applications: 16th International Conference, RTA 2005 …, 2005 | 65 | 2005 |
| ASAP: a dataset of aligned scores and performances for piano transcription F Foscarin, A Mcleod, P Rigaux, F Jacquemard, M Sakai International Society for Music Information Retrieval Conference, 534-541, 2020 | 56 | 2020 |
| Construction of an ROBDD for a PB-constraint in band form and related techniques for PB-solvers M Sakai, H Nabeshima IEICE TRANSACTIONS on Information and Systems 98 (6), 1121-1127, 2015 | 56 | 2015 |
| An extension of the dependency pair method for proving termination of higher-order rewrite systems M Sakai, Y Watanabe, T Sakabe IEICE Transactions on Information and Systems 84 (8), 1025-1032, 2001 | 47 | 2001 |
| Static dependency pair method based on strong computability for higher-order rewrite systems K Kusakari, Y Isogai, M Sakai, F Blanqui IEICE TRANSACTIONS on Information and Systems 92 (10), 2007-2015, 2009 | 40 | 2009 |
| Enhancing dependency pair method using strong computability in simply-typed term rewriting K Kusakari, M Sakai Applicable Algebra in Engineering, Communication and Computing 18, 407-431, 2007 | 31 | 2007 |
| On dependency pair method for proving termination of higher-order rewrite systems M Sakai, K Kusakari IEICE Transactions on Information and Systems 88 (3), 583-593, 2005 | 31 | 2005 |
| Narrowing-based simulation of term rewriting systems with extra variables and its termination proof N Nishida, M Sakai, T Sakabe Electronic Notes in Theoretical Computer Science 86 (3), 52-69, 2003 | 26 | 2003 |
| Soundness of unravelings for conditional term rewriting systems via ultra-properties related to linearity N Nishida, M Sakai, T Sakabe Logical Methods in Computer Science 8, 2012 | 25 | 2012 |
| NVNF-sequentiality of Left-linear Term Rewriting Systems (Theory of Rewriting Systems and Its Applications) T Nagaya, M Sakai, Y Toyama 数理解析研究所講究録 918, 109-117, 1995 | 22 | 1995 |
| Approach to procedural-program verification based on implicit induction of constrained term rewriting systems Y Furuichi, N Nishida, M Sakai, K Kusakari, T Sakabe IPSJ Transactions on Programming 1 (2), 100-121, 2008 | 21 | 2008 |
| Generation of InÚerse Term Rewriting SÝstems for Pure Treeless Functions N Nishida, M Sakai, T Sakabe | 18 | 2001 |
| Rewriting induction for constrained term rewriting systems T Sakata, N Nishida, T Sakabe, M Sakai, K Kusakari IPSJ Transactions on Programming 2 (2), 80-96, 2009 | 17 | 2009 |
| A parse-based framework for coupled rhythm quantization and score structuring F Foscarin, F Jacquemard, P Rigaux, M Sakai Mathematics and Computation in Music: 7th International Conference, MCM 2019 …, 2019 | 16 | 2019 |
| Decidability of termination for semi-constructor TRSs, left-linear shallow TRSs and related systems Y Wang, M Sakai International Conference on Rewriting Techniques and Applications, 343-356, 2006 | 15 | 2006 |
| Generation of inverse computation programs of constructor term rewriting systems N Nishida, M Sakai, T Sakabe The IEICE Transactions on Information and Systems 88, 1171-1183, 2005 | 15 | 2005 |
| Innermost reductions find all normal forms on right-linear terminating overlay TRSs M Sakai, K Okamoto, T Sakabe Reduction Strategies in Rewriting and Programming, 79, 2003 | 15 | 2003 |
| Determinization of conditional term rewriting systems M Nagashima, M Sakai, T Sakabe Theoretical Computer Science 464, 72-89, 2012 | 13 | 2012 |
| Completion after program inversion of injective functions N Nishida, M Sakai Electronic Notes in Theoretical Computer Science 237, 39-56, 2009 | 13 | 2009 |
| Innermost reachability and context sensitive reachability properties are decidable for linear right-shallow term rewriting systems Y Kojima, M Sakai International Conference on Rewriting Techniques and Applications, 187-201, 2008 | 13 | 2008 |
Naoki NishidaGraduate School of Informatics, Nagoya UniversityAdresse e-mail validée de is.nagoya-u.ac.jp
