Adel Bouhoula & Florent Jacquemard (2008):
Automated Induction with Constrained Tree Automata.
In: Alessandro Armando, Peter Baumgartner & Gilles Dowek: Proceedings of the 4th International Joint Conference on Automated Reasoning,
Lecture Notes in Computer Science 5195.
Springer,
pp. 539–554,
doi:10.1007/978-3-540-71070-7_44.
Adel Bouhoula & Florent Jacquemard (2012):
Sufficient completeness verification for conditional and constrained TRS.
Journal of Applied Logic 10(1),
pp. 127–143,
doi:10.1016/j.jal.2011.09.001.
Hubert Comon, Max Dauchet, Rémi Gilleron, Florent Jacquemard, Denis Lugiez, Christof Löding, Sophie Tison & Marc Tommasi (2007):
Tree Automata Techniques and Applications.
Available on: http://www.grappa.univ-lille3.fr/tata.
Release October, 12th 2007.
Laurent Fribourg (1989):
A Strong Restriction of the Inductive Completion Procedure.
Journal of Symbolic Computation 8(3),
pp. 253–276,
doi:10.1016/S0747-7171(89)80069-0.
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.
Michael Huth & Mark Ryan (2000):
Logic in Computer Science: Modelling and Reasoning about Systems.
Cambridge University Press.
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,
doi:10.11309/jssst.28.1_173.
In Japanese.
Naoki Nishida, Futoshi Nomura, Katsuhisa Kurahashi & Masahiko Sakai (2012):
Constrained Tree Automata and their Closure Properties.
In: Keisuke Nakano & Hiroyuki Seki: Proceedings of the 1st International Workshop on Trends in Tree Automata and Tree Transducers,
pp. 24–34.
Tsubasa Sakata, Naoki Nishida & Toshiki Sakabe (2011):
On Proving Termination of Constrained Term Rewriting Systems by Eliminating Edges from Dependency Graphs.
In: Herbert Kuchen: Proceedings of the 20th International Workshop on Functional and (Constraint) Logic Programming (WFLP 2011),
Lecture Notes in Computer Science 6816.
Springer,
pp. 138–155,
doi:10.1007/978-3-642-22531-4_9.
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.
eptcs@eptcs.org