List of All Publications


Contents

   [Thesis]    [International Journal [refereed]]    [International Conference [refereed]]    [International Workshop [refereed]]    [Domestic Journal [refereed]]    [Domestic Conference [refereed]]    [Domestic Conference]    [Technical Report]    [Others]    [Presentation]


Thesis

[TOC]
  1. Naoki Nishida. Transformational Approach to Inverse Computation in Term Rewriting. Doctor thesis, Nagoya University, Nagoya, Japan, (2004-1).
    [ps][pdf]

  2. Naoki Nishida. Study on Inversion of Term Rewriting Systems. Master thesis, Nagoya University, Nagoya, Japan, (2002-2).
    [ps][pdf]

  3. Naoki Nishida. Designing Unlimited Size Resource Libraries Freeing Users from GC Annoyance. Graduation Thesis, Nagoya University (in Japanese), (2000-2).
    [ps][pdf]

International Journal [refereed]

[TOC]
  1. Naoki Nishida and Germ{\'a}n Vidal. Termination of Narrowing via Termination of Rewriting. Applicable Algebra in Engineering, Communication and Computing, Vol. 21, No. 3, pp. 177--225, (2010).

  2. Naoki Nishida and Masahiko Sakai. Completion after Program Inversion of Injective Functions. Postproceedings of the 8th International Workshop on Reduction Strategies in Rewriting and Programming (WRS'08), Electronic Notes in Theoretical Computer Science, Vol. 237, pp. 39--56, (2009-4). (refereed).
    [pdf]

  3. Naoki Nishida, Tomohiro Mizutani, and Masahiko Sakai. Transformation for Refining Unraveled Conditional Term Rewriting Systems. Proceedings of the Sixth International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2006), Electronic Notes in Theoretical Computer Science, Vol. 174, No. 10, pp. 75--95, (2007-7). (refereed) This is a revised version of the preproceeding at WRS'06.
    [link][pdf]

  4. Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe. Narrowing-Based Simulation of Term Rewriting Systems with Extra Variables and its Termination Proof. Functional and Constraint Logic Programming, Electronic Notes in Theoretical Computer Science, Vol. 86, No. 3, pp. 1--18, (2003-11). (refereed) This is a revised version of the preproceeding at WFLP'03.
    [link][ps][pdf]

International Conference [refereed]

[TOC]
  1. Jos{\'e} Iborra, Naoki Nishida, and Germ{\'a}n Vidal. Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing. In Danny~De Schreye, editor, Postproceedings of the 19th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2009), Vol. 6037 of Lecture Notes in Computer Science, pp. 52--66, (2010-4). (refereed).

  2. Naoki Nishida and Masahiko Sakai. Proving Injectivity of Functions via Program Inversion in Term Rewriting. In Matthias Blume, Naoki Kobayashi, and Germ{\'a}n Vidal, editors, Proceedings of the 10th International Symposium on Functional and Logic Programming (FLOPS 2010), Vol. 6009 of Lecture Notes in Computer Science, pp. 288--303. Springer, (2010-4). (refereed).

  3. Jos{\'e} Iborra, Naoki Nishida, and Germ{\'a}n Vidal. Improving the Termination Analysis of Narrowing in Left-Linear Constructor Systems. In Danny~De Schreye, editor, Proceedings of the 19th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2009), p. 9 pages, (2009-9). (refereed).

  4. Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe. Partial Inversion of Constructor Term Rewriting Systems. In J{\"u}rgen Giesl, editor, Proceedings of the 16th International Conference on Rewriting Techniques and Applications, Vol. 3467 of Lecture Notes in Computer Science, pp. 264--278. Springer, (2005-4). (refereed) This is a revised and exteded version of \cite{Nishida01comp2001-67}, and the full version of this paper is available from {\tt http://www.sakabe.i.is.nagoya-u.ac.jp/{\textasciitilde}nishida/papers/}.
    [link][ps][pdf]

International Workshop [refereed]

[TOC]
  1. Naoki Nishida and Masahiko Sakai. Completion as Post-Process in Program Inversion of Injective Functions. In Aart Middeldorp, editor, Proceedings of the 8th International Workshop on Reduction Strategies in Rewriting and Programming (WRS'08), pp. 61--75, (2008-7). (refereed).
    [pdf]

  2. Naoki Nishida, Masahiko Sakai, and Terutoshi Kato. Convergent Term Rewriting Systems for Inverse Computation of Injective Functions. In Dieter Hofbauer and Alexander Serebrenik, editors, Proceedings of the 9th International Workshop on Termination (WST'07), pp. 77--81, (2007-6). (refereed).
    [pdf]

  3. Naoki Nishida and Koichi Miura. Dependency Graph Method for Proving Termination of Narrowing. In Alfons Geser and Harald S{\o}ndergaard, editors, Proceedings of the 8th International Workshop on Termination (WST'06), pp. 12--16, (2006-8). (refereed).
    [pdf]

  4. Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe. Generation of Inverse Term Rewriting Systems for Pure Treeless Functions. In Yoshihito Toyama, editor, Proceedings of the International Workshop on Rewriting in Proof and Computation (RPC'01), pp. 188--198, Sendai, Japan, (2001-10). (refereed).
    [ps][pdf]

Domestic Journal [refereed]

[TOC]
  1. Naoki Nakabayashi, Naoki Nishida, Keiichirou Kusakari, Toshiki Sakabe, and Masahiko Sakai. Lemma Generation Method in Rewriting Induction for Constrained Term Rewriting Systems. Computer Software, p. to appear, (2010). (refereed, in Japanese).

  2. Yohei Umano, Masahiko Sakai, Naoki Nishida, Toshiki Sakabe, and Keiichirou Kusakari. Solving Satisfiability of CNF Formulas with Clauses based on Elementary Symmetric Functions. The IEICE Transactions on Information and Systems, Vol. J93-D, No. 1, pp. 1--9, (2010-1). (refereed, in Japanese).

  3. Yoshiharu Kojima, Masahiko Sakai, Naoki Nishida, Keiichirou Kusakari, and Toshiki Sakabe. Context-Sensitive Innermost Reachability is Decidable for Linear Right-Shallow Term Rewriting Systems. IPSJ Transactions on Programming, Vol. 2, No. 3, pp. 20--32, (2009-7). (refereed).

  4. Tsubasa Sakata, Naoki Nishida, Toshiki Sakabe, Masahiko Sakai, and Keiichirou Kusakari. Rewriting Induction for Constrained Term Rewriting Systems. IPSJ Transactions on Programming, Vol. 2, No. 2, pp. 80--96, (2009-3). (refereed, in Japanese).

  5. Yuki Furuichi, Naoki Nishida, Masahiko Sakai, Keiichirou Kusakari, and Toshiki Sakabe. Approach to Procedural-program Verification Based on Implicit Induction of Constrained Term Rewriting Systems. IPSJ Transactions on Programming, Vol. 1, No. 2, pp. 100--121, (2008-9). (refereed, in Japanese).
    [link]

  6. Sho Kurokawa, Hiroaki Kuwabara, Shinichirou Yamamoto, Toshiki Sakabe, Masahiko Sakai, Keiichirou Kusakari, and Naoki Nishida. A Type System for Analyzing Secure Information Flow in Object-Oriented Programs with Exception Handling. The IEICE Transactions on Information and Systems, Vol. J91-D, No. 3, pp. 757--770, (2008-3). (refereed, in Japanese).

  7. Takahiro Sakurai, Keiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe, and Naoki Nishida. Usable Rules and Labeling Product-Typed Terms for Dependency Pair Method in Simply-Typed Term Rewriting Systems. The IEICE Transactions on Information and Systems, Vol. J90-D-I, No. 4, pp. 978--989, (2007-4). (refereed, in Japanese).

  8. Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe. Generation of Inverse Computation Programs of Constructor Term Rewriting Systems. The IEICE Transactions on Information and Systems, Vol. J88-D-I, No. 8, pp. 1171--1183, (2005-8). (refereed, in Japanese).

  9. Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe. Improving Efficiency of Computation of Right-Linear Constructor Term Rewriting Systems with Extra Variables. Computer Software, Vol. 21, No. 3, pp. 40--47, (2004-5). (refereed, in Japanese).

  10. Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe. Computation Model of Term Rewriting Systems with Extra Variables. Computer Software, Vol. 20, No. 5, pp. 85--89, (2003-9). (refereed, in Japanese).

  11. Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe. Generation of a TRS Implementing the Inverses of Pure Treeless Functions. Computer Software, Vol. 19, No. 1, pp. 29--33, (2002-1). (refereed, in Japanese).

Domestic Conference [refereed]

[TOC]
  1. Takahiro Sakurai, Keiichirou Kusakari, Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe. Proving Sufficient Completeness of Functional Programs based on Recursive Structure Analysis and Strong Computability. In Proceedings of the Forum on Information Technology 2005, No. LA-001 in Information Technology Letters, pp. 1--4, (2005-9). (refereed, in Japanese).
    [pdf]

Domestic Conference

[TOC]
  1. Naoki Nakabayashi, Naoki Nishida, Keiichirou Kusakari, Toshiki Sakabe, and Masahiko Sakai. Lemma Generation Method in Rewriting Induction for Constrained Term Rewriting Systems. In Proceedings of the 26th Conference of Japan Society for Software Science and Technology (JSSST), No. 7B-2, pp. 1--14. Japan Society for Software Science and Technology (JSSST), (2009-9). (in Japanese).

  2. Yoshiharu Kojima, Masahiko Sakai, Naoki Nishida, Keiichirou Kusakari, and Toshiki Sakabe. Context-Sensitive Innermost Reachability is Decidable for Linear Right-Shallow Term Rewriting Systems. In the 72nd Workshop on IPSJ Special Interest Group on Programming, pp. 1--11. Information Processing Society of Japan, (2009-1).

  3. Tsubasa Sakata, Naoki Nishida, Toshiki Sakabe, Masahiko Sakai, and Keiichirou Kusakari. Rewriting Induction for Constrained Term Rewriting Systems. In the 71st Workshop on IPSJ Special Interest Group on Programming, pp. 1--16. Information Processing Society of Japan, (2008-10). (in Japanese).

  4. Kenji Ukai, Toshiki Sakabe, Hiroaki Takada, Ryo Kurachi, Masahiko Sakai, Keiichirou Kusakari, and Naoki Nishida. A Preliminary Study on Behavior Analysis of Scalable CAN Protocol. In Record of 2008 Tokai-section Joint Conference of the Eight Institutes of Electrical and Related Engineers, No. O-262, p. 1, (2008-9). (in Japanese).

  5. Yuki Furuichi, Naoki Nishida, Masahiko Sakai, Keiichirou Kusakari, and Toshiki Sakabe. Approach to Procedural-Program Verification Based on Implicit Induction. In the 68th Workshop on IPSJ Special Interest Group on Programming, pp. 1--22. Information Processing Society of Japan, (2008-3). (in Japanese).
    [pdf]

  6. Hiroyuki Ito, Masahiko Sakai, Keiichirou Kusakari, Toshiki Sakabe, and Naoki Nishida. Finding Magic Squares Based on CNF Encoding. In Record of 2007 Tokai-section Joint Conference of the Eight Institutes of Electrical and Related Engineers, No. O-012, p. 1, (2007-9). (in Japanese).

  7. Yi~Wang, Masahiko Sakai, Naoki Nishida, Toshiki Sakabe, and Keiichirou Kusakari. Confluence of Length Preserving String Rewriting Systems is Undecidable. In RIMS Kokyuroku, Vol. 1554 of Theory of Computer Science and Its Applications, pp. 171--177. Research Institute for Mathematical Sciences, Kyoto University, (2007-5). (LA Symposium 2006 Winter, No.~27, Kyoto University, Kyoto, Japan, 1 29 -- 30, 2007).

  8. Keita Uchiyama, Masahiko Sakai, Naoki Nishida, Toshiki Sakabe, and Keiichirou Kusakari. Decidability of Innermost Termination for Semi-Constructor Term Rewriting Systems. In RIMS Kokyuroku, Vol. 1554 of Theory of Computer Science and Its Applications, pp. 166--170. Research Institute for Mathematical Sciences, Kyoto University, (2007-5). (LA Symposium 2006 Winter, No.~26, Kyoto University, Kyoto, Japan, 1 29 -- 30, 2007).

  9. Yuji Sasada, Masahiko Sakai, Toshiki Sakabe, Keiichirou Kusakari, and Naoki Nishida. Compiling Term Rewriting Systems Having Higher-Order Functions. In Record of 2006 Tokai-section Joint Conference of the Eight Institutes of Electrical and Related Engineers, No. O-437, p. 1, (2006-9). (in Japanese).
    [pdf]

  10. Toshiki Murata, Naoki Nishida, Masahiko Sakai, Toshiki Sakabe, and Keiichirou Kusakari. Unraveling for Conditional Term Rewriting Systems with Membership Constraints. In Record of 2006 Tokai-section Joint Conference of the Eight Institutes of Electrical and Related Engineers, No. O-438, p. 1, (2006-9). (in Japanese).
    [pdf]

  11. Tomohiro Mizutani, Naoki Nishida, Masahiko Sakai, Toshiki Sakabe, and Keiichirou Kusakari. Transformation for Removing Context-Sensitivity of TRSs Obtained by Unraveling. In RIMS Kokyuroku, Vol. 1489 of New Trends in Theory of Computation and Algorithm, pp. 195--201. Research Institute for Mathematical Sciences, Kyoto University, (2006-5). (LA Symposium 2005 Winter, No.~30, Kyoto University, Kyoto, Japan, 1 30 -- 2 1, 2006, in Japanese).
    [pdf]

  12. Masaki Saeki, Toshiki Sakabe, Masahiko Sakai, Keiichirou Kusakari, and Naoki Nishida. Type Judgement Systems for Assuring Distributed JoinJAVA Programs Run Normally. In Record of 2005 Tokai-section Joint Conference of the Eight Institutes of Electrical and Related Engineers, No. O-306, p. 1, (2005-9). (in Japanese).
    [pdf]

  13. Daisuke Okuya, Toshiki Sakabe, Masahiko Sakai, Keiichirou Kusakari, and Naoki Nishida. Verifying Cryptographic Protocols by Using Coloured Petri Nets. In Record of 2005 Tokai-section Joint Conference of the Eight Institutes of Electrical and Related Engineers, No. O-198, p. 1, (2005-9). (in Japanese).
    [pdf]

  14. Yohei Takasu, Masahiko Sakai, Naoki Nishida, Keiichirou Kusakari, and Toshiki Sakabe. On Recursion Removal from Non-Linear Top-Recursive Programs. In RIMS Kokyuroku, Vol. 1426 of New Aspects of Theoretical Computer Science, pp. 39--44. Research Institute for Mathematical Sciences, Kyoto University, (2005-4). (LA Symposium 2004 Winter, No.~7, Kyoto University, Kyoto, Japan, 1 31 -- 2 2, 2005, in Japanese).

  15. Tatsuhiko Murata, Masahiko Sakai, Naoki Nishida, Keiichirou Kusakari, and Toshiki Sakabe. (no title in English). In RIMS Kokyuroku, Vol. 1426 of New Aspects of Theoretical Computer Science, pp. 106--112. Research Institute for Mathematical Sciences, Kyoto University, (2005-4). (LA Symposium 2004 Winter, No.~19, Kyouto University, Kyoto, Japan, 1 31 -- 2 2, 2005, in Japanese).
    [pdf]

  16. Koji Okamoto, Masahiko Sakai, Naoki Nishida, Keiichirou Kusakari, and Toshiki Sakabe. (no title in English). In RIMS Kokyuroku, Vol. 1426 of New Aspects of Theoretical Computer Science, pp. 119--125. Research Institute for Mathematical Sciences, Kyoto University, (2005-4). (LA Symposium 2004 Winter, No.~21, Kyoto University, Kyoto, Japan, 1 31 -- 2 2, 2005, in Japanese).

  17. Hiroaki Takojima, Masahiko Sakai, Toshiki Sakabe, Naoki Nishida, and Keiichirou Kusakari. (no title in English). In RIMS Kokyuroku, Vol. 1426 of New Aspects of Theoretical Computer Science, pp. 113--118. Research Institute for Mathematical Sciences, Kyoto University, (2005-4). (LA Symposium 2004 Winter, No.~20, Kyoto University, Kyoto, Japan, 1 31 -- 2 2, 2005, in Japanese).
    [pdf]

  18. Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe. On Simulation-Completeness of Unraveling for Conditional Term Rewriting Systems. In LA Symposium 2004 Summer, No. 7, pp. {7--1}--{7--6}. LA Symposium, (2004-7). (6 pages).
    [ps][pdf]

  19. Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe. Improving Efficiency of of Computation of Right-Linear Constructor Term Rewriting Systems with Extra Variables. In Proceedings of the 20th Conference of Japan Society for Software Science and Technology (JSSST), No. 5B-3, pp. 1--5. Japan Society for Software Science and Technology (JSSST), (2003-9). (in Japanese).
    [ps][pdf]

  20. Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe. Normal-form Computation by Left-most Innermost Narrowing on Right-Linear Overlay Term Rewriting Systems with Extra Variables. In LA Symposium 2003 Summer, No. 24, pp. 24--1--24--6. LA Symposium, (2003-7). (in Japanese).
    [ps][pdf]

  21. Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe. Narrowing-based Effective Rewriting and its Termination for Term Rewriting Systems with Extra Variables. In RIMS Kokyuroku, No. 1325 in New Aspects of Theoretical Computer Science, pp. 238--243. Research Institute for Mathematical Sciences, Kyoto University, (2003-5). (LA Symposium 2002 Winter, No.~43, Kyoto University, Kyoto, Japan, 2 3--5, 2003, in Japanese).
    [ps][pdf]

  22. Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe. A Narrowing-based Reduction of Term Rewriting Systems with Extra Variables. In Record of 2002 Tokai-section Joint Conference of the Eight Institutes of Electrical and Related Engineers, p. 292, (2002-9). (in Japanese).
    [ps][pdf]

  23. Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe. A Computation Model of Term Rewriting Systems with Extra Variables. In Proceedings of the 19th Conference of Japan Society for Software Science and Technology (JSSST), No. 6F-3, pp. 1--5. Japan Society for Software Science and Technology (JSSST), (2002-9). (in Japanese).
    [ps][pdf]

  24. Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe. Generation of a TRS Implementing the Inverses of Pure Treeless Functions. In Proceedings of the 18th Conference of Japan Society for Software Science and Technology (JSSST), No. 6C-3, pp. 1--5. Japan Society for Software Science and Technology (JSSST), (2001-9). (in Japanese).
    [ps][pdf]

Technical Report

[TOC]
  1. Masanori Nagashima, Masahiko Sakai, Toshiki Sakabe, Naoki Nishida, and Keiichirou Kusakari. Program Generation Based on Transformation of Conditional Equations. IEICE Technical Report SS2009-41, the Institute of Electronics, Information and Communication Engineers (IEICE), (2009-12). Vol.~109, No.~343, pp.~37--42 (in Japanese).

  2. Sho Suzuki, Keiichirou Kusakari, Toshiki Sakabe, Masahiko Sakai, and Naoki Nishida. Argument Filtering and Usable Rules in Higher-Order Rewrite Systems. IEICE Technical Report SS2009-39, the Institute of Electronics, Information and Communication Engineers (IEICE), (2009-12). Vol.~109, No.~343, pp.~25--30 (in Japanese).

  3. Yoshimasa Mishuku, Masahiko Sakai, Toshiki Sakabe, Keiichirou Kusakari, and Naoki Nishida. On Decidability of Context-Sensitive Termination for Right-Linear Right-Shallow Term Rewriting Systems. IEICE Technical Report SS2009-40, the Institute of Electronics, Information and Communication Engineers (IEICE), (2009-12). Vol.~109, No.~343, pp.~31--36 (in Japanese).

  4. Keita Uchiyama, Masahiko Sakai, Toshiki Sakabe, Keiichirou Kusakari, and Naoki Nishida. Decidability of Termination Properties for Term Rewriting Systems Consisting of Shallow Dependency Pairs. IEICE Technical Report SS2008-45, the Institute of Electronics, Information and Communication Engineers (IEICE), (2008-12). Vol.~108, No.~362, pp.~37--42.

  5. Yohei Umano, Masahiko Sakai, Naoki Nishida, Toshiki Sakabe, and Keiichirou Kusakari. Solving Satisfiability of CNF Formulas with Elementary Symmetric Functions. IEICE Technical Report SS2008-44, the Institute of Electronics, Information and Communication Engineers (IEICE), (2008-12). Vol.~108, No.~362, pp.~31--36 (in Japanese).

  6. Kenji Ukai, Toshiki Sakabe, Hiroaki Takada, Ryo Kurachi, Masahiko Sakai, Keiichirou Kusakari, and Naoki Nishida. Behavior Analysis of Scalable CAN Protocol on a Bit-Error Channel. IEICE Technical Report SS2008-37, the Institute of Electronics, Information and Communication Engineers (IEICE), (2008-10). Vol.~108, No.~242, pp.~61--66 (in Japanese).

  7. Naoki Nishida, Tsubasa Sakata, Masahiko Sakai, Keiichirou Kusakari, and Toshiki Sakabe. A Reduction Order for Orienting Equations in Theorem Proving of Constrained TRSs. IEICE Technical Report SS2008-20, the Institute of Electronics, Information and Communication Engineers (IEICE), (2008-7). Vol.~108, No.~173, pp.~43--48 (in Japanese).
    [pdf]

  8. Tsubasa Sakata, Naoki Nishida, Toshiki Sakabe, Masahiko Sakai, and Keiichirou Kusakari. On Rewriting Induction for Presburger-Constrained Term Rewriting Systems. IEICE Technical Report SS2008-1, the Institute of Electronics, Information and Communication Engineers (IEICE), (2008-5). Vol.~108, No.~64, pp.~1--6 (in Japanese).

  9. Akihisa Yamada, Keiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe, and Naoki Nishida. Error Detection with Soft Typing for Dynamically Typed Languages. IEICE Technical Report SS2007-58, the Institute of Electronics, Information and Communication Engineers (IEICE), (2008-3). Vol.~107, No.~505, pp.~7--12.

  10. Kiyotaka Mizuno, Naoki Nishida, Toshiki Sakabe, Masahiko Sakai, and Keiichirou Kusakari. A Sufficient Condition for Termination of Transformations from Equations to Rewrite Rules. IEICE Technical Report SS2007-61, the Institute of Electronics, Information and Communication Engineers (IEICE), (2008-3). Vol.~107, No.~505, pp.~25--30 (in Japanese).

  11. Yohei Umano, Masahiko Sakai, Naoki Nishida, Toshiki Sakabe, and Keiichirou Kusakari. A Tool for Designing Sudoku Problems by Interactive Fill-in Approach. IEICE Technical Report SS2007-50, the Institute of Electronics, Information and Communication Engineers (IEICE), (2007-12). Vol.~107, No.~392, pp.~73--78 (in Japanese).

  12. Satoru Kondo, Masahiko Sakai, Toshiki Sakabe, Keiichirou Kusakari, and Naoki Nishida. Extending program-generation system GeneSys for allowing negation in equational specifications. IEICE Technical Report SS2007-45, the Institute of Electronics, Information and Communication Engineers (IEICE), (2007-12). Vol.~107, No.~392, pp.~43--48 (in Japanese).

  13. Tomohiro Mizutani, Naoki Nishida, Masahiko Sakai, Toshiki Sakabe, and Keiichirou Kusakari. Proving Non-termination of Logic Programs by Detecting Loops in Derivation Trees. IEICE Technical Report SS2007-30, the Institute of Electronics, Information and Communication Engineers (IEICE), (2007-10). Vol.~107, No.~275, pp.~1--6 (in Japanese).

  14. Yuji Sasada, Masahiko Sakai, Naoki Nishida, Toshiki Sakabe, and Keiichirou Kusakari. Implicit Induction for Proving Behavioral Equivalence by Equational Rewriting. IEICE Technical Report SS2007-17, the Institute of Electronics, Information and Communication Engineers (IEICE), (2007-8). Vol.~107, No.~176, pp.~7--12 (in Japanese).

  15. Toshiki Murata, Naoki Nishida, Masahiko Sakai, Toshiki Sakabe, and Keiichirou Kusakari. Recognizable Approximation of Descendant Sets for Left-Linear Oriented Conditional Term Rewriting Systems. IEICE Technical Report SS2007-16, the Institute of Electronics, Information and Communication Engineers (IEICE), (2007-8). Vol.~107, No.~176, pp.~1--6 (in Japanese).

  16. Yasuo Isogai, Keiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe, and Naoki Nishida. Argument Filtering Method on Second-Order Rewriting System. IEICE Technical Report SS2007-13, the Institute of Electronics, Information and Communication Engineers (IEICE), (2007-6). Vol.~107, No.~99, pp.~23--28 (in Japanese).

  17. Keiichirou Kusakari, Yasuo Isogai, , Masahiko Sakai, Toshiki Sakabe, and Naoki Nishida. Static Dependeycy Pair Method for Proving Termination of Higher-Order Rewriting Systems. IEICE Technical Report SS2007-12, the Institute of Electronics, Information and Communication Engineers (IEICE), (2007-6). Vol.~107, No.~99, pp.~17--22.

  18. Akinori Kamada, Keiichirou Kusakari, Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe. Automated Theorem Prover HOPSYS on Simply-Typed Rewriting Systems. IEICE Technical Report SS2006-57, the Institute of Electronics, Information and Communication Engineers (IEICE), (2006-12). Vol.~106, No.~426, pp.~7--12 (in Japanese).
    [pdf]

  19. Yuki Furuichi, Naoki Nishida, Masahiko Sakai, Keiichirou Kusakari, and Toshiki Sakabe. Approach to Software Verification Based on Transformation from Procedural Programs to Rewrite Systems. IEICE Technical Report SS2006-41 (KBSE2006-17), the Institute of Electronics, Information and Communication Engineers (IEICE), (2006-10). Vol.~106, No.~324, pp.~7--12 (in Japanese).
    [pdf]

  20. Sho Kurokawa, Hiroaki Kuwabara, Shinichirou Yamamoto, Toshiki Sakabe, Masahiko Sakai, Keiichirou Kusakari, and Naoki Nishida. Security Analysis of Information Flow for An Object-Oriented Language with Exception Handling. IEICE Technical Report SS2006-42 (KBSE2006-18), the Institute of Electronics, Information and Communication Engineers (IEICE), (2006-10). Vol.~106, No.~324, pp.~13--18 (in Japanese).
    [pdf]

  21. Satoru Kondo, Masahiko Sakai, Naoki Nishida, Toshiki Sakabe, and Keiichirou Kusakari. Example Programs Generated by GeneSys and Proposal of Introduction Rule. IEICE Technical Report SS2006-46 (KBSE2006-22), the Institute of Electronics, Information and Communication Engineers (IEICE), (2006-10). Vol.~106, No.~324, pp.~37--42 (in Japanese).
    [pdf]

  22. Takahiro Sakurai, Keiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe, and Naoki Nishida. Usable Rules and Labeling Product-Typed Term for Dependency Pair Method in Simply-Typed Term Rewriting Systems. IEICE Technical Report SS2006-15, the Institute of Electronics, Information and Communication Engineers (IEICE), (2006-6). Vol.~106, No.~120, pp.~13--18 (in Japanese).
    [pdf]

  23. Koichi Miura, Naoki Nishida, Masahiko Sakai, Toshiki Sakabe, and Keiichirou Kusakari. Transformation of Equational Rewriting Systems for Removing some Equations. IEICE Technical Report SS2006-14, the Institute of Electronics, Information and Communication Engineers (IEICE), (2006-6). Vol.~106, No.~120, pp.~7--12 (in Japanese).
    [pdf]

  24. Yasuo Isogai, Keiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe, and Naoki Nishida. Proving Termination of Higher-Order Rewrite Systems based on Strongly Computable Dependency Pair Method. IEICE Technical Report SS2006-6, the Institute of Electronics, Information and Communication Engineers (IEICE), (2006-4). Vol.~106, No.~15, pp.~31--36 (in Japanese).
    [pdf]

  25. Yumi Hoshino, Keiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe, and Naoki Nishida. Lexicographic Path Ordering for Proving Termination of Functional Programs. IEICE Technical Report SS2005-85, the Institute of Electronics, Information and Communication Engineers (IEICE), (2006-2). Vol.~105, No.~597 pp.~13--18 (in Japanese).
    [pdf]

  26. Yoshihiko Tashiro, Toshiki Sakabe, Masahiko Sakai, Keiichirou Kusakari, and Naoki Nishida. Secrecy Verification of Spi Calculus Based on Term Regular Expressions. IEICE Technical Report SS2005-82, the Institute of Electronics, Information and Communication Engineers (IEICE), (2006-2). Vol.~105, No.~596 pp.~35--40 (in Japanese).
    [pdf]

  27. Yi~Wang, Masahiko Sakai, Naoki Nishida, Keiichirou Kusakari, and Toshiki Sakabe. Decidability of Termination for Left-Linear Shallow Term Rewriting Systems and Related. IEICE Technical Report COMP2005-50, the Institute of Electronics, Information and Communication Engineers (IEICE), (2005-12). Vol.~105, No.~499, pp.~9--13.
    [pdf]

  28. Masaki Saeki, Toshiki Sakabe, Masahiko Sakai, Keiichirou Kusakari, and Naoki Nishida. Type Judgement System for Communication Error in Distributed JoinJAVA Programs. IEICE Technical Report SS2005-67, the Institute of Electronics, Information and Communication Engineers (IEICE), (2005-12). Vol.~105, No.~491, pp.~25--30 (in Japanese).
    [pdf]

  29. Daisuke Okuya, Toshiki Sakabe, Masahiko Sakai, Keiichirou Kusakari, and Naoki Nishida. Secrecy Verification by Transforming Cryptographic Protocol Descriptions to Coloured Petri Nets. IEICE Technical Report SS2005-58, the Institute of Electronics, Information and Communication Engineers (IEICE), (2005-12). Vol.~105, No.~490, pp.~19--24 (in Japanese).
    [pdf]

  30. Atsushi Iwata, Masahiko Sakai, Naoki Nishida, Keiichirou Kusakari, and Toshiki Sakabe. On Completeness of Outermost Strategy for Overlapping TRSs. IEICE Technical Report SS2005-46, the Institute of Electronics, Information and Communication Engineers (IEICE), (2005-10). Vol.~105, No.~331, pp.~39--44 (in Japanese).
    [pdf]

  31. Yi~Wang, Masahiko Sakai, Naoki Nishida, Keiichirou Kusakari, and Toshiki Sakabe. Decidability of Termination for Semi-Constructor Term Rewriting Systems. IEICE Technical Report SS2005-26, the Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo, Japan, (2005-8). Vol.~105, No.~228, pp.~13--18.
    [pdf]

  32. Keiichirou Kusakari, Takahiro Sakurai, Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe. On Proving Termination of Simply-Typed Term Rewriting Systems Based on Strong Computability. IEICE Technical Report SS2005-21, the Institute of Electronics, Information and Communication Engineers (IEICE), (2005-6). Vol.~105, No.~129, pp.~19--24 (in Japanese).
    [pdf]

  33. Koichi Miura, Naoki Nishida, Masahiko Sakai, Keiichirou Kusakari, and Toshiki Sakabe. Dependency Graph Method for Proving Termination of Narrowing. IEICE Technical Report SS2005-23, the Institute of Electronics, Information and Communication Engineers (IEICE), (2005-6). Vol.~105, No.~129, pp.~31--36 (in Japanese).
    [pdf]

  34. Hisashi Iizawa, Toshiki Sakabe, Masahiko Sakai, Keiichirou Kusakari, and Naoki Nishida. Programming Method in Obfuscated Language Malbolge. IEICE Technical Report SS2005-22, the Institute of Electronics, Information and Communication Engineers (IEICE), (2005-6). Vol.~105, No.~129, pp.~25--30 (in Japanese).
    [pdf]

  35. Masanori Nagashima, Masahiko Sakai, Naoki Nishida, Toshiki Sakabe, and Keiichirou Kusakari. Simulating Fusion Transformation by Program-Generation Transformation. IEICE Technical Report SS2004-33, the Institute of Electronics, Information and Communication Engineers (IEICE), (2004-11). Vol.~104, No.~466, pp.~43--48 (in Japanese).
    [pdf]

  36. Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe. On Simulation-Completeness of Unraveling for Conditional Term Rewriting Systems. IEICE Technical Report SS2004-18, the Institute of Electronics, Information and Communication Engineers (IEICE), (2004-8). Vol.~104, No.~243, pp.~25--30.
    [ps][pdf]

  37. Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe. Narrowing-based Effective Rewriting and its Termination for Term Rewriting Systems with Extra Variables. IEICE Technical Report COMP2003-68, the Institute of Electronics, Information and Communication Engineers (IEICE), (2003-1). Vol.~102, No.~593, pp.~45--52 (in Japanese).
    [ps][pdf]

  38. Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe. Generation of a TRS Implementing the Inverses of the Functions with Specified Arguments Fixed. IEICE Technical Report COMP2001-67, the Institute of Electronics, Information and Communication Engineers (IEICE), (2001-12). Vol.~101, No.~488, pp.~33--40.
    [pdf]

  39. Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe. Generation of a Conditional TRS Implements the Inverses of Pure Treeless Functions. IEICE Technical Report COMP2001-14, the Institute of Electronics, Information and Communication Engineers (IEICE), (2001-6). Vol.~101, No.~133, pp.~9--16 (in Japanese).
    [ps][pdf]

  40. Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe. Designing Unlimited Size Resource C-Libraries Freeing Users from GC Annoyance. IEICE Technical Report SS2000-9, the Institute of Electronics, Information and Communication Engineers (IEICE), (2000-5). Vol.~100, No.~64, pp.~25--32 (in Japanese).
    [ps][pdf]

Others

[TOC]
  1. Naoki Nishida, Tsubasa Sakata, Masahiko Sakai, and Tatsuya Hattori. Proving and Disproving Termination of Constrained Term Rewriting Systems, (2010). submitted to the conference.

  2. Naoki Nishida, Yuki Furuichi, Masahiko Sakai, Keiichirou Kusakari, and Toshiki Sakabe. Software Verification Based on Transformation from Procedural Programs to Rewrite Systems. In Proceedings of the 4th Symposium on ``Intelligent Media Integration for Social Information Infrastructure'', pp. 129--130. IMI COE, Nagoya University, (2006-12).
    [pdf]

Presentation

[TOC]
  1. Masataka Baba, Masahiko Sakai, Takeshi Hamaguchi, Naoki Nishida, Toshiki Sakabe, and Keiichirou Kusakari. (no title in English). In Proceedings of PPL2010, p. 81. Japan Society for Software Science and Technology (JSSST), (2010-3). (poster and demo, in Japanese).

  2. Satoshi Nagasaka, Hiroyuki Ito, Masahiko Sakai, Keiichirou Kusakari, Naoki Nishida, and Toshiki Sakabe. (no title in English). Presentation at the 5th Mini Workshop of Combinatorial Games and Puzzles Mini Project, (2010-3). no manuscript.

  3. Naoki Nishida. On Improving Lemma Generation Framework for Constrained Term Rewriting Systems. Presentation in the 33rd TRS Meeting, (2010-2).

  4. Naoki Nishida. On Automating Theorem Proving for Constrained Equations. Presentation in the 32nd TRS Meeting, (2009-9).

  5. Naoki Nishida, Naoki Nakabayashi, Masahiko Sakai, Keiichirou Kusakari, and Toshiki Sakabe. Prototype of Automated Theorem Prover for Constrained Equations. Presentation at the 26th Conference of Japan Society for Software Science and Technology (JSSST), (2009-9). (poster and demo, in Japanese).

  6. Naoki Nishida. Comparison of Unraveling Techniques for Deterministic Conditional Term Rewriting Systems. Presentation in 2nd Austria - Japan Summer Workshop on Term Rewriting, (2007-8).

  7. Naoki Nishida. Convergent Term Rewriting Systems for Computing Inverses of Injective Functions. Presentation in the 28th TRS Meeting, (2007-2).

  8. Naoki Nishida. On Reachability of Oriented Conditional Term Rewriting Systems. Presentation in the 27th TRS Meeting, (2006-9).

  9. Naoki Nishida. Improving Unraveling for Deterministic Conditional Term Rewriting Systems. Presentation in the 26th TRS Meeting, (2006-2).

  10. Naoki Nishida. Dependency Graph Method for Proving Termination of Narrowing. Presentation in Austria - Japan Summer Workshop on Term Rewriting, (2005-8).

  11. Naoki Nishida. Partial Inversion of Constructor Term Rewriting Systems. Presentation in the 25th TRS Meeting, (2004-11).

  12. Naoki Nishida. Transformational Approach to Inverse Computation in Term Rewriting. Presentation in the 18th Tokyo Programming Seminar (ToPS), (2004-10).

  13. Naoki Nishida. Completeness of Unraveling Transformation for Left-Linear Conditional Term Rewriting Systems. Presentation in the 24th TRS Meeting, (2004-4).

  14. Naoki Nishida. Basic Narrowing Improves Efficiency of Computation of Right-Linear Term Rewriting Systems with Extra Variables. Presentation in the 23rd TRS Meeting, (2003-9).

  15. Naoki Nishida. Condition for Generation of Terminating Inverse TRSs from Constructor TRSs. Presentation in the 22nd TRS Meeting, (2003-3).

  16. Naoki Nishida. Narrowing-Based Reduction of Term Rewriting Systems with Extra Variables. Presentation in the 21st TRS Meeting, (2002-10).

  17. Naoki Nishida. On Generating Inverse Systems of Constructor TRSs. Presentation in the 20th TRS Meeting, (2002-3).

(This list is generated by bunkenhtml-xref based on bunkenhtml.)