Keiichirou Kusakari

发表

A Type System for Analyzing Secure Information Flow in Object-Oriented Programs with Exception Handling

Masahiko Sakai, Shinichiro Yamamoto, Sho Kurokawa, 2008 .

Static Dependency Pair Method in Functional Programs

Keiichirou Kusakari, Keiichirou Kusakari, 2018, IEICE Trans. Inf. Syst..

Automated Program Verification with HOPSYS

Masahiko Sakai, Toshiki Sakabe, Keiichirou Kusakari, 2006 .

Unifying the Knuth-Bendix, recursive path and polynomial orders

Akihisa Yamada, Toshiki Sakabe, Keiichirou Kusakari, 2013, PPDP.

A Higher-Order Knuth-Bendix Procedure and Its Applications

Yuki Chiba, Keiichirou Kusakari, Keiichirou Kusakari, 2007, IEICE Trans. Inf. Syst..

AC Dependency Pairs Revisited

René Thiemann, Christian Sternagel, Akihisa Yamada, 2016, CSL.

On proving AC-termination by argument filtering method

Keiichirou Kusakari, Yoshihito Toyama, 1999 .

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

Masahiko Sakai, Toshiki Sakabe, Keiichirou Kusakari, 2005, IEICE Trans. Inf. Syst..

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

Masahiko Sakai, Keiichirou Kusakari, Keiichirou Kusakari, 2001, IEICE Trans. Inf. Syst..

Argument Filtering Transformation

Yoshihito Toyama, Keiichirou Kusakari, Masaki Nakamura, 1999, PPDP.

Nagoya Termination Tool

Akihisa Yamada, Toshiki Sakabe, Keiichirou Kusakari, 2014, RTA-TLCA.

Error Detection with Soft Typing for Dynamically Typed Languages

Masahiko Sakai, Toshiki Sakabe, Keiichirou Kusakari, 2008 .

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

Yoshiharu Kojima, Masahiko Sakai, Toshiki Sakabe, 2009 .

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

Masahiko Sakai, Keiichirou Kusakari, Frédéric Blanqui, 2009, IEICE Trans. Inf. Syst..

On Proving AC-Termination by AC-Dependency Paris

Keiichirou Kusakari, 1998 .

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

Masahiko Sakai, Keiichirou Kusakari, 2009, IEICE Trans. Inf. Syst..

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

Masahiko Sakai, Keiichirou Kusakari, Keiichirou Kusakari, 2007, Applicable Algebra in Engineering, Communication and Computing.

A unified ordering for termination proving

Akihisa Yamada, Toshiki Sakabe, Keiichirou Kusakari, 2014, Sci. Comput. Program..

Security Analysis of Information Flow for an Object-Oriented Language with Exception Handling

Masahiko Sakai, Shinichiro Yamamoto, Sho Kurokawa, 2006 .

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

Keiichirou Kusakari, Keiichirou Kusakari, 2012, IEICE Trans. Inf. Syst..

Argument filterings and usable rules in higher-order rewrite systems pdf

Keiichirou Kusakari, Sho Suzuki, Frédéric Blanqui, 2011, ArXiv.

Confluence of Length Preserving String Rewriting Systems is Undecidable

Yi Wang, Masahiko Sakai, Toshiki Sakabe, 2007 .

SOFTWARE VERIFICATION BASED ON TRANSFORMATION FROM PROCEDURAL PROGRAMS TO REWRITE SYSTEMS

Masahiko Sakai, Toshiki Sakabe, Keiichirou Kusakari, 2006 .

On Proving Termination of Higher-Order Rewrite Systems by Dependency Pair Technique

Masahiko Sakai, Keiichirou Kusakari, 2002 .

A Tool for Designing Sudoku Problems by Interactive Fill-in Approach

Masahiko Sakai, Toshiki Sakabe, Keiichirou Kusakari, 2007 .

Elimination Transformations for Associative-Commutative Rewriting Systems

Yoshihito Toyama, Keiichirou Kusakari, Masaki Nakamura, 2006, J. Autom. Reason..

The hierarchy of dependency pairs

Yoshihito Toyama, Keiichirou Kusakari, 1999 .

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

Yoshiharu Kojima, Masahiko Sakai, Toshiki Sakabe, 2011 .

A Sound Type System for Typing Runtime Errors

Masahiko Sakai, Toshiki Sakabe, Keiichirou Kusakari, 2012 .

Higher-Order Path Orders Based on Computability

Keiichirou Kusakari, 2004, IEICE Trans. Inf. Syst..

Termination of associative-commutative rewriting using dependency pairs criteria

Keiichirou Kusakari, Xavier Urbain, 2002 .

Termination, AC-Termination and Dependency Pairs of Term Rewriting Systems

Keiichirou Kusakari, Keiichirou Kusakari, 2000 .