Franz Baader & Tobias Nipkow (1998):
Term Rewriting and All That.
Cambridge University Press,
doi:10.1145/505863.505888.
Stephan Falke & Deepak Kapur (2009):
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs.
In: Renate A. Schmidt: Proceedings of the 22nd International Conference on Automated Deduction,
Lecture Notes in Computer Science 5663.
Springer,
pp. 277–293,
doi:10.1007/978-3-642-02959-2_22.
Stephan Falke, Deepak Kapur & Carsten Sinz (2011):
Termination Analysis of C Programs Using Compiler Intermediate Languages.
In: Manfred Schmidt-Schauß: Proceedings of the 22nd International Conference on Rewriting Techniques and Applications,
LIPIcs 10.
Schloss Dagstuhl–Leibniz-Zentrum für Informatik,
pp. 41–50,
doi:10.4230/LIPIcs.RTA.2011.41.
Maribel Fernández (2014):
Programming Languages and Operational Semantics – A Concise Overview.
Undergraduate Topics in Computer Science.
Springer,
doi:10.1007/978-1-4471-6368-8.
Carsten Fuhs, Cynthia Kop & Naoki Nishida (2017):
Verifying Procedural Programs via Constrained Rewriting Induction.
ACM Transactions on Computational Logic 18(2),
pp. 14:1–14:50,
doi:10.1145/3060143.
Yuki Furuichi, Naoki Nishida, Masahiko Sakai, Keiichirou Kusakari & Toshiki Sakabe (2008):
Approach to Procedural-program Verification Based on Implicit Induction of Constrained Term Rewriting Systems.
IPSJ Transactions on Programming 1(2),
pp. 100–121.
In Japanese (a translated summary is available from http://www.trs.css.i.nagoya-u.ac.jp/crisys/).
Cynthia Kop & Naoki Nishida (2013):
Term Rewriting with Logical Constraints.
In: Pascal Fontaine, Christophe Ringeissen & Renate A. Schmidt: Proceedings of the 9th International Symposium on Frontiers of Combining Systems,
Lecture Notes in Computer Science 8152.
Springer,
pp. 343–358,
doi:10.1007/978-3-642-40885-4_24.
Cynthia Kop & Naoki Nishida (2015):
Constrained Term Rewriting tooL.
In: Martin Davis, Ansgar Fehnker, Annabelle McIver & Andrei Voronkov: Proceedings of the 20th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning,
Lecture Notes in Computer Science 9450.
Springer,
pp. 549–557,
doi:10.1007/978-3-662-48899-7_38.
Naoki Nakabayashi, Naoki Nishida, Keiichirou Kusakari, Toshiki Sakabe & Masahiko Sakai (2011):
Lemma Generation Method in Rewriting Induction for Constrained Term Rewriting Systems.
Computer Software 28(1),
pp. 173–189.
In Japanese (a translated summary is available from http://www.trs.css.i.nagoya-u.ac.jp/crisys/).
Carsten Otto, Marc Brockschmidt, Christian von Essen & Jürgen Giesl (2010):
Automated termination analysis of Java bytecode by term rewriting.
In: Christopher Lynch: Proceedings of the 21st International Conference on Rewriting Techniques and Applications,
LIPIcs 6.
Schloss Dagstuhl–Leibniz-Zentrum für Informatik,
pp. 259–276,
doi:10.4230/LIPIcs.RTA.2010.259.
Uday S. Reddy (1990):
Term Rewriting Induction.
In: Mark E. Stickel: Proceedings of the 10th International Conference on Automated Deduction,
Lecture Notes in Computer Science 449.
Springer,
pp. 162–177,
doi:10.1007/3-540-52885-7_86.
Tsubasa Sakata, Naoki Nishida, Toshiki Sakabe, Masahiko Sakai & Keiichirou Kusakari (2009):
Rewriting Induction for Constrained Term Rewriting Systems.
IPSJ Transactions on Programming 2(2),
pp. 80–96.
In Japanese (a translated summary is available from http://www.trs.css.i.nagoya-u.ac.jp/crisys/).
eptcs@eptcs.org