The following publications are possibly variants of this publication:
- Static Dependency Pair Method for Simply-Typed Term Rewriting and Related TechniquesKeiichirou Kusakari, Masahiko Sakai. ieicet, 92-D(2):235-247, 2009. [doi]
- Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite SystemsKeiichirou Kusakari, Yasuo Isogai, Masahiko Sakai, Frédéric Blanqui. ieicet, 92-D(10):2007-2015, 2009. [doi]
- Decidability of Termination and Innermost Termination for Term Rewriting Systems with Right-Shallow Dependency PairsKeita Uchiyama, Masahiko Sakai, Toshiki Sakabe. ieicet, 93-D(5):953-962, 2010. [doi]