Keiichirou Kusakari

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