Keiichirou Kusakari

According to our database, Keiichirou Kusakari authored at least 19 papers between 1999 and 2018.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2018

Static Dependency Pair Method in Functional Programs.

Keiichirou Kusakari

IEICE Trans. Inf. Syst., 2018

2016

AC Dependency Pairs Revisited.

Akihisa Yamada, Christian Sternagel, René Thiemann, Keiichirou Kusakari

Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2015

A unified ordering for termination proving.

Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe

Sci. Comput. Program., 2015

2014

Nagoya Termination Tool.

Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe

Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

2013

Static Dependency Pair Method in Rewriting Systems for Functional Programs with Product, Algebraic Data, and ML-Polymorphic Types.

Keiichirou Kusakari

IEICE Trans. Inf. Syst., 2013

Unifying the Knuth-Bendix, recursive path and polynomial orders.

Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe

Proceedings of the 15th International Symposium on Principles and Practice of Declarative Programming, 2013

2012

A Sound Type System for Typing Runtime Errors.

Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe, Masahiko Sakai, Naoki Nishida

Inf. Media Technol., 2012

2011

Argument Filterings and Usable Rules in Higher-order Rewrite Systems.

Sho Suzuki, Keiichirou Kusakari, Frédéric Blanqui

Inf. Media Technol., 2011

Decidability of Reachability for Right-shallow Context-sensitive Term Rewriting Systems.

Yoshiharu Kojima, Masahiko Sakai, Naoki Nishida, Keiichirou Kusakari, Toshiki Sakabe

Inf. Media Technol., 2011

2009

Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems.

Yoshiharu Kojima, Masahiko Sakai, Naoki Nishida, Keiichirou Kusakari, Toshiki Sakabe

Inf. Media Technol., 2009

Static Dependency Pair Method for Simply-Typed Term Rewriting and Related Techniques.

Keiichirou Kusakari, Masahiko Sakai

IEICE Trans. Inf. Syst., 2009

Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems.

Keiichirou Kusakari, Yasuo Isogai, Masahiko Sakai, Frédéric Blanqui

IEICE Trans. Inf. Syst., 2009

2007

A Higher-Order Knuth-Bendix Procedure and Its Applications.

Keiichirou Kusakari, Yuki Chiba

IEICE Trans. Inf. Syst., 2007

Enhancing dependency pair method using strong computability in simply-typed term rewriting.

Keiichirou Kusakari, Masahiko Sakai

Appl. Algebra Eng. Commun. Comput., 2007

2006

Elimination Transformations for Associative-Commutative Rewriting Systems.

Keiichirou Kusakari, Masaki Nakamura, Yoshihito Toyama

J. Autom. Reason., 2006

2005

On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems.

Masahiko Sakai, Keiichirou Kusakari

IEICE Trans. Inf. Syst., 2005

Primitive Inductive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order Rewriting.

Keiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe

IEICE Trans. Inf. Syst., 2005

2004

Higher-Order Path Orders Based on Computability.

Keiichirou Kusakari

IEICE Trans. Inf. Syst., 2004

1999

Argument Filtering Transformation.

Keiichirou Kusakari, Masaki Nakamura, Yoshihito Toyama

Proceedings of the Principles and Practice of Declarative Programming, International Conference PPDP'99, Paris, France, September 29, 1999