CRISYS (Constrained Rewriting Induction SYStem)

Publications

The translated versions and summaries of the previous publications would be improved in near future.

1. Tsubasa Sakata, Naoki Nishida, and Toshiki Sakabe,
   On Proving Termination of Constrained Term Rewriting Systems by Eliminating Edges from Dependency Graphs,
   In Proceedings of the 20th International Workshop on Functional and (Constraint) Logic Programming (WFLP 2011),
   Lecture Notes in Computer Science, vol. 6816, pp. 138-155, July 2011.
   [link]


2. Naoki Nakabayashi, Naoki Nishida, Keiichirou Kusakari, Toshiki Sakabe, and Masahiko Sakai,
   Lemma Generation Method in Rewriting Induction for Constrained Term Rewriting Systems,
   Computer Software, Vol. 28, No. 1, pp. 173-189, February 2010 (in Japanese).
   [Translated Version]


3. 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, March 2009 (in Japanese).
   [Summary] Corrected a typo (July 14, 2016)


4. 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, September 2008 (in Japanese).
   [Summary]

Contributors

• Takahiro Nagao
• Ryota Nakayama
• Naoki Nishida (representative)
• Tomohiro Sasano

Past Contributors

• Weilong Ding
• Yuki Furuichi
• Masaaki Fushimi
• Tatsuya Hattori
• Tatsuya Ishigaki
• Takumi Kataoka
• Yoshifumi Kawamoto
• Yuko Kobayashi
• Katsuhisa Kurahashi
• Ryutaro Kuriki
• Kiyotaka Mizuno
• Naoki Nakabayashi
• Yasuhiro Nakano
• Futoshi Nomura
• Kouji Oba
• Tsubasa Sakata
• Kazuya Takakuwa
• Yuji Tanaka
• Tomoya Ueyama
• Keita Yamashita

Contact

Naoki Nishida (Nagoya University)
nishida @ is.nagoya-u.ac.jp