| CauDEr: a causal-consistent reversible debugger for Erlang I Lanese, N Nishida, A Palacios, G Vidal International Symposium on Functional and Logic Programming, 247-263, 2018 | 89 | 2018 |
| A theory of reversibility for Erlang I Lanese, N Nishida, A Palacios, G Vidal Journal of Logical and Algebraic Methods in Programming 100, 71-97, 2018 | 70 | 2018 |
| Partial inversion of constructor term rewriting systems N Nishida, M Sakai, T Sakabe Term Rewriting and Applications: 16th International Conference, RTA 2005 …, 2005 | 67 | 2005 |
| Term rewriting with logical constraints C Kop, N Nishida International Symposium on Frontiers of Combining Systems, 343-358, 2013 | 65 | 2013 |
| Verifying procedural programs via constrained rewriting induction C Fuhs, C Kop, N Nishida ACM Transactions on Computational Logic (TOCL) 18 (2), 1-50, 2017 | 46 | 2017 |
| A reversible semantics for Erlang N Nishida, A Palacios, G Vidal International Symposium on Logic-Based Program Synthesis and Transformation …, 2016 | 38 | 2016 |
| Program inversion for tail recursive functions N Nishida, G Vidal 22nd International Conference on Rewriting Techniques and Applications (RTA'11), 2011 | 30 | 2011 |
| 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 | 27 | 2003 |
| Constrained term rewriting tool C Kop, N Nishida Logic for Programming, Artificial Intelligence, and Reasoning: 20th …, 2015 | 26 | 2015 |
| 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 (3), 1-49, 2012 | 26 | 2012 |
| Automatic constrained rewriting induction towards verifying procedural programs C Kop, N Nishida Asian Symposium on Programming Languages and Systems, 334-353, 2014 | 25 | 2014 |
| Confluence competition 2019 A Middeldorp, J Nagele, K Shintani International Conference on Tools and Algorithms for the Construction and …, 2019 | 23 | 2019 |
| Proving confluence of conditional term rewriting systems via unravelings K Gmeiner, N Nishida, B Gramlich Proc. IWC, 35-39, 2013 | 23 | 2013 |
| Termination of narrowing via termination of rewriting N Nishida, G Vidal Applicable Algebra in Engineering, Communication and Computing 21 (3), 177-225, 2010 | 22 | 2010 |
| 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 |
| 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 |
| Loop detection by logically constrained term rewriting N Nishida, S Winkler Working Conference on Verified Software: Theories, Tools, and Experiments …, 2018 | 18 | 2018 |
| On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs T Sakata, N Nishida, T Sakabe the 20th International Workshop on Functional and (Constraint) Logic …, 2011 | 18 | 2011 |
| Transformational approach to inverse computation in term rewriting N Nishida Doctor thesis, Nagoya University, Nagoya, Japan, 2004 | 18 | 2004 |
| Generation of InÚerse Term Rewriting SÝstems for Pure Treeless Functions N Nishida, M Sakai, T Sakabe | 18 | 2001 |
Masahiko SakaiNagoya UniversityEmail verificata su i.nagoya-u.ac.jp
