| Publication | Date of Publication | Type |
|---|
Completeness of combinations of constructor systems
Rewriting Techniques and Applications | 2022-12-09 | Paper |
Semantics and strong sequentially of priority term rewriting systems
Rewriting Techniques and Applications | 2022-12-09 | Paper |
Termination for the direct sum of left-linear term rewriting systems
Rewriting Techniques and Applications | 2022-12-09 | Paper |
| Improving rewriting induction approach for proving ground confluence | 2020-05-26 | Paper |
Automated proofs of unique normal forms w.r.t. conversion for term rewriting systems
(available as arXiv preprint) | 2020-05-13 | Paper |
| Parallel closure theorem for left-linear nominal rewriting systems | 2018-01-04 | Paper |
| scientific article; zbMATH DE number 6792365 (Why is no real title available?) | 2017-10-17 | Paper |
| Ground confluence prover based on rewriting induction | 2017-10-17 | Paper |
| Confluence of orthogonal nominal rewriting systems revisited | 2017-07-12 | Paper |
Correctness of Context-Moving Transformations for Term Rewriting Systems
Logic-Based Program Synthesis and Transformation | 2016-02-05 | Paper |
Proving confluence of term rewriting systems via persistency and decreasing diagrams
Lecture Notes in Computer Science | 2014-07-24 | Paper |
| A reduction-preserving completion for proving confluence of non-terminating term rewriting systems | 2012-04-24 | Paper |
A reduction-preserving completion for proving confluence of non-terminating term rewriting systems
(available as arXiv preprint) | 2012-04-24 | Paper |
A reduction-preserving completion for proving confluence of non-terminating term rewriting systems
Logical Methods in Computer Science | 2012-04-03 | Paper |
Proving Confluence of Term Rewriting Systems Automatically
Rewriting Techniques and Applications | 2009-06-30 | Paper |
Rewriting Techniques and Applications
Lecture Notes in Computer Science | 2009-04-30 | Paper |
Rewriting Techniques and Applications
Lecture Notes in Computer Science | 2009-04-30 | Paper |
On the Church-Rosser property for the direct sum of term rewriting systems
Journal of the ACM | 2009-01-13 | Paper |
Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations
Rewriting Techniques and Applications | 2008-08-28 | Paper |
Processes, Terms and Cycles: Steps on the Road to Infinity
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Term Rewriting and Applications
Lecture Notes in Computer Science | 2005-11-11 | Paper |
| scientific article; zbMATH DE number 1759501 (Why is no real title available?) | 2002-11-25 | Paper |
Decidability for left-linear growing term rewriting systems.
Information and Computation | 2002-01-01 | Paper |
| scientific article; zbMATH DE number 1543072 (Why is no real title available?) | 2001-02-26 | Paper |
| scientific article; zbMATH DE number 1487842 (Why is no real title available?) | 2000-08-10 | Paper |
| scientific article; zbMATH DE number 1405630 (Why is no real title available?) | 2000-02-23 | Paper |
| scientific article; zbMATH DE number 1398069 (Why is no real title available?) | 2000-02-03 | Paper |
| scientific article; zbMATH DE number 1380890 (Why is no real title available?) | 1999-12-20 | Paper |
| scientific article; zbMATH DE number 1380902 (Why is no real title available?) | 1999-12-20 | Paper |
| scientific article; zbMATH DE number 1322313 (Why is no real title available?) | 1999-11-08 | Paper |
Semantics and strong sequentiality of priority term rewriting systems
Theoretical Computer Science | 1999-01-12 | Paper |
Termination for direct sums of left-linear complete term rewriting systems
Journal of the ACM | 1998-01-28 | Paper |
| scientific article; zbMATH DE number 1088026 (Why is no real title available?) | 1997-11-17 | Paper |
Modularity of confluence: A simplified proof
Information Processing Letters | 1994-04-04 | Paper |
Completeness of combinations of constructor systems
Journal of Symbolic Computation | 1993-08-22 | Paper |
How to prove equivalence of term rewriting systems without induction
Theoretical Computer Science | 1992-06-28 | Paper |
Fast Knuth-Bendix completion with a term rewriting system compiler
Information Processing Letters | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4106267 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4092756 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4078756 (Why is no real title available?) | 1988-01-01 | Paper |
Counterexamples to termination for the direct sum of term rewriting systems
Information Processing Letters | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3949707 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4047062 (Why is no real title available?) | 1986-01-01 | Paper |
