Keiichirou Kusakari

Publication Activity (10 Years)

Years Active: 1999-2018
Publications (10 Years): 2

Top Topics

Term Rewrite Systems

Top Venues

IEICE Trans. Inf. Syst.

Sci. Comput. Program.

Publications

Keiichirou Kusakari
Static Dependency Pair Method in Functional Programs. IEICE Trans. Inf. Syst. (6) (2018)
Akihisa Yamada, Christian Sternagel, René Thiemann, Keiichirou Kusakari
AC Dependency Pairs Revisited. CSL (2016)
Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe
A unified ordering for termination proving. Sci. Comput. Program. 111 (2015)
Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe
Nagoya Termination Tool. RTA-TLCA (2014)
Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe
A Unified Ordering for Termination Proving. CoRR (2014)
Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe
Nagoya Termination Tool. CoRR (2014)
Keiichirou Kusakari
Static Dependency Pair Method in Rewriting Systems for Functional Programs with Product, Algebraic Data, and ML-Polymorphic Types. IEICE Trans. Inf. Syst. (3) (2013)
Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe
Unifying the Knuth-Bendix, recursive path and polynomial orders. PPDP (2013)
Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe, Masahiko Sakai, Naoki Nishida
A Sound Type System for Typing Runtime Errors. Inf. Media Technol. 7 (2) (2012)
Keiichirou Kusakari, Yasuo Isogai, Masahiko Sakai, Frédéric Blanqui
Static Dependency Pair Method based on Strong Computability for Higher-Order Rewrite Systems CoRR (2011)
Sho Suzuki, Keiichirou Kusakari, Frédéric Blanqui
Argument filterings and usable rules in higher-order rewrite systems CoRR (2011)
Yoshiharu Kojima, Masahiko Sakai, Naoki Nishida, Keiichirou Kusakari, Toshiki Sakabe
Decidability of Reachability for Right-shallow Context-sensitive Term Rewriting Systems. Inf. Media Technol. 6 (4) (2011)
Sho Suzuki, Keiichirou Kusakari, Frédéric Blanqui
Argument Filterings and Usable Rules in Higher-order Rewrite Systems. Inf. Media Technol. 6 (2) (2011)
Keiichirou Kusakari, Yasuo Isogai, Masahiko Sakai, Frédéric Blanqui
Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems. IEICE Trans. Inf. Syst. (10) (2009)
Keiichirou Kusakari, Masahiko Sakai
Static Dependency Pair Method for Simply-Typed Term Rewriting and Related Techniques. IEICE Trans. Inf. Syst. (2) (2009)
Keiichirou Kusakari, Masahiko Sakai
Enhancing dependency pair method using strong computability in simply-typed term rewriting. Appl. Algebra Eng. Commun. Comput. 18 (5) (2007)
Keiichirou Kusakari, Yuki Chiba
A Higher-Order Knuth-Bendix Procedure and Its Applications. IEICE Trans. Inf. Syst. (4) (2007)
Keiichirou Kusakari, Masaki Nakamura, Yoshihito Toyama
Elimination Transformations for Associative-Commutative Rewriting Systems. J. Autom. Reason. 37 (3) (2006)
Keiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe
Primitive Inductive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order Rewriting. IEICE Trans. Inf. Syst. (12) (2005)
Masahiko Sakai, Keiichirou Kusakari
On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems. IEICE Trans. Inf. Syst. (3) (2005)
Keiichirou Kusakari
Higher-Order Path Orders Based on Computability. IEICE Trans. Inf. Syst. (2) (2004)
Keiichirou Kusakari, Masaki Nakamura, Yoshihito Toyama
Argument Filtering Transformation. PPDP (1999)