Takahito Aoto

Naoki Nishida

Jonas Schöpf

CoRR, 2024

Proving Uniqueness of Normal Forms w.r.t Reduction of Term Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the Logic-Based Program Synthesis and Transformation, 2024

Equational Theories and Validity for Logically Constrained Term Rewriting.

[BibT_eX]

[DOI]

Naoki Nishida

Jonas Schöpf

Proceedings of the 9th International Conference on Formal Structures for Computation and Deduction, 2024

2023

A Critical Pair Criterion for Level-Commutation of Conditional Term Rewriting Systems.

[BibT_eX]

[DOI]

Ryota Haga

Yuki Kagaya

Proceedings of the Frontiers of Combining Systems - 14th International Symposium, 2023

2021

Commutative Rational Term Rewriting.

[BibT_eX]

[DOI]

Mamoru Ishizuka

Munehiro Iwami

Proceedings of the Language and Automata Theory and Applications, 2021

A Proof Method for Local Sufficient Completeness of Term Rewriting Systems.

[BibT_eX]

[DOI]

Tomoki Shiraishi

Proceedings of the Theoretical Aspects of Computing - ICTAC 2021, 2021

Simple Derivation Systems for Proving Sufficient Completeness of Non-Terminating Term Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020

Confluence and Commutation for Nominal Rewriting Systems with Atom-Variables.

[BibT_eX]

[DOI]

Proceedings of the Logic-Based Program Synthesis and Transformation, 2020

A Fast Decision Procedure For Uniqueness of Normal Forms w.r.t. Conversion of Shallow Term Rewriting Systems.

[BibT_eX]

[DOI]

Masaomi Yamaguchi

Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020

2019

Inductive Theorem Proving in Non-terminating Rewriting Systems and Its Application to Program Transformation.

[BibT_eX]

[DOI]

Isao Sasano

Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages, 2019

Automated Proofs of Unique Normal Forms w.r.t. Conversion for Term Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Combining Systems - 12th International Symposium, 2019

2018

Confluence Competition 2018.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018

2017

Improving Rewriting Induction Approach for Proving Ground Confluence.

[BibT_eX]

[DOI]

Yuta Kimura

Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

Parallel Closure Theorem for Left-Linear Nominal Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Combining Systems - 11th International Symposium, 2017

2016

Critical Pair Analysis in Nominal Rewriting.

[BibT_eX]

[DOI]

Proceedings of the 7th International Symposium on Symbolic Computation in Software Science, 2016

Ground Confluence Prover based on Rewriting Induction.

[BibT_eX]

[DOI]

Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

Nominal Confluence Tool.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning - 8th International Joint Conference, 2016

2015

Confluence of Orthogonal Nominal Rewriting Systems Revisited.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

Correctness of Context-Moving Transformations for Term Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the Logic-Based Program Synthesis and Transformation, 2015

Confluence Competition 2015.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction - CADE-25, 2015

2014

Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams.

[BibT_eX]

[DOI]

Kazumasa Uchida

Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

Decision Procedures for Proving Inductive Theorems without Induction.

[BibT_eX]

[DOI]

Sorin Stratulat

Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming, 2014

2013

Termination of Rule-Based Calculi for Uniform Semi-Unification.

[BibT_eX]

[DOI]

Munehiro Iwami

Proceedings of the Language and Automata Theory and Applications, 2013

Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Combining Systems, 2013

2012

Preface.

[BibT_eX]

[DOI]

Aart Middeldorp

Theor. Comput. Sci., 2012

A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2012

Rational Term Rewriting Revisited: Decidability and Confluence.

[BibT_eX]

[DOI]

Jeroen Ketema

Proceedings of the Graph Transformations - 6th International Conference, 2012

2011

Natural Inductive Theorems for Higher-Order Rewriting.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

2010

Program Transformation Templates for Tupling Based on Term Rewriting.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2010

Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

2009

Proving Confluence of Term Rewriting Systems Automatically.

[BibT_eX]

[DOI]

Junichi Yoshida

Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

Argument Filterings and Usable Rules for Simply Typed Dependency Pairs.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Combining Systems, 7th International Symposium, 2009

2008

Automatic Construction of Program Transformation Templates.

[BibT_eX]

[DOI]

Inf. Media Technol., 2008

Soundness of Rewriting Induction Based on an Abstract Principle.

[BibT_eX]

[DOI]

Inf. Media Technol., 2008

Sound Lemma Generation for Proving Inductive Validity of Equations.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

2007

Program Transformation by Templates: A Rewriting Framework.

[BibT_eX]

[DOI]

Inf. Media Technol., 2007

2006

RAPT: A Program Transformation System Based on Term Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

Dealing with Non-orientable Equations in Rewriting Induction.

[BibT_eX]

[DOI]

Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

2005

Dependency Pairs for Simply Typed Term Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

Program transformation by templates based on term rewriting.

[BibT_eX]

[DOI]

Proceedings of the 7th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2005

2004

Inductive Theorems for Higher-Order Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 15th International Conference, 2004

2003

Termination of Simply Typed Term Rewriting by Translation and Labelling.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003

2001

Solution to the Problem of Zantema on a Persistent Property of Term Rewriting Systems.

[BibT_eX]

[DOI]

J. Funct. Log. Program., 2001

1999

On the Finite Model Property of Intuitionistic Modal Logics over MIPC.

[BibT_eX]

[DOI]

Hiroyuki Shirasu

Math. Log. Q., 1999

Uniqueness of Normal Proofs in Implicational Intuitionistic Logic.

[BibT_eX]

[DOI]

J. Log. Lang. Inf., 1999

1998

Termination Transformation by Tree Lifting Ordering.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998

1997

Persistency of Confluence.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1997

On Composable Properties of Term Rewriting Systems.

[BibT_eX]

[DOI]