Kusakari Keiichirou

发表

Malbolge with 20trits word length and its programming

Nishida Naoki, Sakai Masahiko, Kato Tatsuki, 2013 .

Automatic Generation of Non-linear Loop Invariants for Programs with Function Calls

Nishida Naoki, Sakai Masahiko, Sakabe Toshiki, 2012 .

On Detecting Useless Transition Rules of Constrained Tree Automata

Nishida Naoki, Sakai Masahiko, Hashimoto Kenji, 2014 .

Enhancing Dependency Pair Method by Strong Computability in Simply-Typed Term Rewriting Systems

Sakai Masahiko, Kusakari Keiichirou, 2005 .

Argument Filtering Method on Second-Order Rewriting System

Nishida Naoki, Sakai Masahiko, Sakabe Toshiki, 2007 .

Proving Non-termination of Logic Programs by Detecting Loops in Derivation Trees

Nishida Naoki, Sakai Masahiko, Sakabe Toshiki, 2007 .

Using SAT Solvers for Solving Control-Instruction Layout Problems in Low-Level Assembly Programming for Malbolge

Nishida Naoki, Sakai Masahiko, Sakabe Toshiki, 2013 .

On Proving AC - Termination by Argument Filtering Method

Kusakari Keiichirou, Toyama Yoshihito, 2000 .

Simulating Fusion Transformation by Program-Generation Transformation

Nishida Naoki, Sakai Masahiko, Sakabe Toshiki, 2004 .

Approach to Software Verification Based on Transforming from Procedural Programs to Rewrite Systems

Nishida Naoki, Sakai Masahiko, Sakabe Toshiki, 2006 .

On non-termination proof of right-linear and right-shallow term rewriting systems based on forward narrowing

Nishida Naoki, Sakai Masahiko, Sakabe Toshiki, 2010 .

Tree Automata with Constraints and their Closure-Properties

Nishida Naoki, Sakai Masahiko, Sakabe Toshiki, 2011 .

Automated Theorem Prover HOPSYS on Simply-Typed Rewriting Systems

Nishida Naoki, Sakai Masahiko, Sakabe Toshiki, 2006 .

Introducing Array Mechanism into High-Level Assembly Language for Malbolge

Nishida Naoki, Sakai Masahiko, Sakabe Toshiki, 2012 .

Behavior Analysis of Scalable CAN Protocol on a Bit-Error Channel

Nishida Naoki, Sakai Masahiko, Takada Hiroaki, 2008 .

A SAT Encoding for Finding Operation Sequences of Malbolge that Implement Trit-wise Functions

Nishida Naoki, Sakabe Toshiki, Kusakari Keiichirou, 2012 .

Programming Method in Obfuscated Language Malbolge

Nishida Naoki, Sakai Masahiko, Sakabe Toshiki, 2005 .

On Turing Completness of an Esoteric Language, Malbolge

Nishida Naoki, Sakai Masahiko, Sakabe Toshiki, 2010 .

Secrecy Verification of Spi Calculus based on Term Regular Expressions

Nishida Naoki, Sakai Masahiko, Sakabe Toshiki, 2006 .

Static Dependeycy Pair Method for Proving Termination of Higher-Order Rewriting Systems

Nishida Naoki, Sakai Masahiko, Sakabe Toshiki, 2007 .

On Rewriting Induction for Presburger-Constrained Term Rewriting Systems

Nishida Naoki, Sakai Masahiko, Sakabe Toshiki, 2008 .

On Rewriting Induction for Simply-typed Term Rewriting Systems

Nishida Naoki, Sakai Masahiko, Sakabe Toshiki, 2012 .

Example programs generated by GeneSys and proposal of Introduction rule

Nishida Naoki, Sakai Masahiko, Sakabe Toshiki, 2006 .

On Decidability of Context-Sensitive Termination for Right-Linear Right-Shallow Term Rewriting Systems

Nishida Naoki, Sakai Masahiko, Sakabe Toshiki, 2009 .

Secrecy Verification by Transforming Cryptographic Protocol Descriptions to Coloured Petri Nets

Nishida Naoki, Sakai Masahiko, Sakabe Toshiki, 2005 .

Argument Filterings and Usable Rules in Higher-Order Rewrite Systems

Nishida Naoki, Sakai Masahiko, Sakabe Toshiki, 2009 .

Elimination Transformations for Associative–Commutative Rewriting Systems

Nakamura Masaki, Kusakari Keiichirou, Toyama Yoshihito, 2006 .

On Proving Termination of Term Rewriting Systems with Higher - Order Variables

Kusakari Keiichirou, 2001 .

Dependency Graph Method for Proving Termination of Narrowing

Nishida Naoki, Sakai Masahiko, Sakabe Toshiki, 2005 .