Search Results1-20 of  26

  • 1 / 2
  • 草刈 圭一朗 ID: 9000276430412

    Articles in CiNii:1

    • Implicit Induction for Proving Behavioral Equivalence by Equational Rewriting (2007)
  • 草刈 圭一朗 ID: 9000276430429

    Articles in CiNii:1

    • Argument Filtering Method for Second-Order Higher-Order Rewrite Systems (2007)
  • 草刈 圭一朗 ID: 9000277057117

    Articles in CiNii:1

    • On Turing Completeness of an Esoteric Language, Malbolge (2010)
  • 草刈 圭一朗 ID: 9000277057127

    Articles in CiNii:1

    • On Decidability of Context-Sensitive Termination for Right-Linear Right-Shallow Term Rewriting Systems (2009)
  • 草刈 圭一朗 ID: 9000277057138

    Articles in CiNii:1

    • Program Generation Based on Transformation of Conditional Equations (2009)
  • 草刈 圭一朗 ID: 9000277057145

    Articles in CiNii:1

    • Argument Filtering and Usable Rules in Higher-Order Rewrite Systems (2009)
  • 草刈 圭一朗 ID: 9000277057158

    Articles in CiNii:1

    • A Sufficient Condition for Termination of Transformations from Equations to Rewrite Rules (2008)
  • 草刈 圭一朗 ID: 9000277057188

    Articles in CiNii:1

    • Proving Non-termination of Logic Programs by Detecting Loops in Derivation Trees (2007)
  • 草刈 圭一朗 ID: 9000277863381

    Articles in CiNii:1

    • Rewriting Induction for Constrained Term Rewriting Systems (2009)
  • 草刈 圭一朗 ID: 9000277863390

    Articles in CiNii:1

    • Approach to Procedural-program Verification Based on Implicit Induction of Constrained Term Rewriting Systems (2008)
  • 草刈 圭一朗 ID: 9000277863410

    Articles in CiNii:1

    • Error Detection with Soft Typing for Dynamically Typed Languages (2008)
  • 草刈 圭一朗 ID: 9000277863416

    Articles in CiNii:1

    • Static Dependency Pair Method for Simply-Typed Term Rewriting and Related Techniques (2008)
  • 草刈 圭一朗 ID: 9000277863423

    Articles in CiNii:1

    • A Type System for Analyzing Secure Information Flow in Object-Oriented Programs with Exception Handling (2008)
  • 草刈 圭一朗 ID: 9000277863435

    Articles in CiNii:1

    • On non-termination proof of right-linear and right-shallow term rewriting systems based on forward narrowing (2010)
  • 草刈 圭一朗 ID: 9000277863445

    Articles in CiNii:1

    • On DPLL Transition Systems Modulo Equational Theories (2010)
  • 草刈 圭一朗 ID: 9000345434697

    名古屋大学 (2012 from CiNii)

    Articles in CiNii:1

    • 基本対称関数に基づく節をもつCNF論理式の充足可能性判定 (2012)
  • 草刈 圭一朗 ID: 9000351090304

    Articles in CiNii:1

    • 項書換え系の停止性証明のための重み付き経路順序の抽象化 (計算理論とアルゴリズムの新潮流) (2015)
  • 草刈 圭一朗 ID: 9000397666408

    岐阜大学 工学部 (2014 from CiNii)

    Articles in CiNii:1

    • Size complexity of BDD construction of Pseudo-Boolean constraints in binary/mixed-radix base form (2014)
  • KUSAKARI Keiichirou ID: 1000090323112

    岐阜大学工学部 (2015 from CiNii)

    Articles in CiNii:106

    • On Proving Termination of Simply-Typed Term Rewriting Systems Based on Strong Computability (2005)
    • Programming Method in Obfuscated Language Malbolge (2005)
    • Dependency Graph Method for Proving Termination of Narrowing (2005)
  • KUSAKARI Keiichirou ID: 9000107367099

    Articles in CiNii:1

    • On non-termination proof of right-linear and right-shallow term rewriting systems based on forward narrowing (2010)
  • 1 / 2
Page Top