Nao Hirokawa

Log. Methods Comput. Sci., 2024

Certification of Confluence- and Commutation-Proofs via Parallel Critical Pairs.

[BibT_eX]

[DOI]

Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2024

2023

Hydra Battles and AC Termination, Revisited.

[BibT_eX]

[DOI]

CoRR, 2023

Generalizing Weighted Path Orders.

[BibT_eX]

[DOI]

Teppei Saito

CoRR, 2023

Hydra Battles and AC Termination.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

Weighted Path Orders Are Semantic Path Orders.

[BibT_eX]

[DOI]

Teppei Saito

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

Left-Linear Completion with AC Axioms.

[BibT_eX]

[DOI]

Johannes Niederhauser

Proceedings of the Automated Deduction - CADE 29, 2023

2021

Completion and Reduction Orders (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 6th International Conference on Formal Structures for Computation and Deduction, 2021

2019

Abstract Completion, Formalized.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2019

Confluence by Critical Pair Analysis Revisited (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2019

Confluence by Critical Pair Analysis Revisited.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction - CADE 27, 2019

2018

Confluence Competition 2018.

[BibT_eX]

[DOI]

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

Cops and CoCoWeb: Infrastructure for Confluence Tools.

[BibT_eX]

[DOI]

Julian Nagele

Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

2017

Critical Peaks Redefined - $Φ\sqcup Ψ= \top$.

[BibT_eX]

[DOI]

CoRR, 2017

Infinite Runs in Abstract Completion.

[BibT_eX]

[DOI]

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

2016

AC-KBO revisited.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2016

2015

Leftmost Outermost Revisited.

[BibT_eX]

[DOI]

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

CoLL: A Confluence Tool for Left-Linear Term Rewrite Systems.

[BibT_eX]

[DOI]

Kiraku Shintani

Proceedings of the Automated Deduction - CADE-25, 2015

Confluence Competition 2015.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction - CADE-25, 2015

2014

Automated Complexity Analysis Based on Context-Sensitive Rewriting.

[BibT_eX]

[DOI]

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

A New and Formalized Proof of Abstract Completion.

[BibT_eX]

[DOI]

Christian Sternagel

Proceedings of the Interactive Theorem Proving - 5th International Conference, 2014

2013

Uncurrying for Termination and Complexity.

[BibT_eX]

[DOI]

J. Autom. Reason., 2013

2012

Confluence of Non-Left-Linear TRSs via Relative Termination.

[BibT_eX]

[DOI]

Dominik Klein

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2012

2011

Decreasing Diagrams and Relative Termination.

[BibT_eX]

[DOI]

J. Autom. Reason., 2011

Maximal Completion.

[BibT_eX]

[DOI]

Dominik Klein

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

2010

Uncurrying for Innermost Termination and Derivational Complexity

[BibT_eX]

[DOI]

Proceedings of the Proceedings 5th International Workshop on Higher-Order Rewriting, 2010

2009

KBO Orientability.

[BibT_eX]

[DOI]

J. Autom. Reason., 2009

2008

Uncurrying for Termination.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2008

Complexity, Graphs, and the Dependency Pair Method.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2008

Automated Complexity Analysis Based on the Dependency Pair Method.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning, 4th International Joint Conference, 2008

2007

Tyrolean termination tool: Techniques and features.

[BibT_eX]

[DOI]

Inf. Comput., 2007

Constraints for Argument Filterings.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

2006

Predictive Labeling.

[BibT_eX]

[DOI]

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

2005

Automating the dependency pair method.

[BibT_eX]

[DOI]

Inf. Comput., 2005

Tyrolean Termination Tool.

[BibT_eX]

[DOI]

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

2004

Dependency Pairs Revisited.

[BibT_eX]

[DOI]

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

Polynomial Interpretations with Negative Coefficients.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence and Symbolic Computation, 2004

2003

Tsukuba Termination Tool.

[BibT_eX]

[DOI]