| Publication | Date of Publication | Type |
|---|
| Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting | 2023-09-25 | Paper |
| On transforming cut- and quantifier-free cyclic proofs into rewriting-induction proofs | 2022-08-10 | Paper |
| Transforming orthogonal inductive definition sets into confluent term rewrite systems | 2022-05-25 | Paper |
| Determinization of inverted grammar programs via context-free expressions | 2021-09-03 | Paper |
| ReverCSP: time-travelling in CSP computations | 2021-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4994129 | 2021-06-17 | Paper |
| Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems | 2021-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4993364 | 2021-06-15 | Paper |
| Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems | 2019-10-24 | Paper |
| Inverse Unfold Problem and Its Heuristic Solving | 2019-10-24 | Paper |
| On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings | 2019-10-24 | Paper |
| Characterizing Compatible View Updates in Syntactic Bidirectionalization | 2019-10-17 | Paper |
| Loop detection by logically constrained term rewriting | 2018-12-07 | Paper |
| A theory of reversibility for Erlang | 2018-10-01 | Paper |
| Cauder: a causal-consistent reversible debugger for Erlang | 2018-07-09 | Paper |
| Reversible computation in term rewriting | 2017-12-01 | Paper |
| Reversible Term Rewriting | 2017-10-17 | Paper |
| A reversible semantics for Erlang | 2017-10-13 | Paper |
| Verifying Procedural Programs via Constrained Rewriting Induction | 2017-07-13 | Paper |
| Relative termination via dependency pairs | 2017-06-29 | Paper |
| Automatic Constrained Rewriting Induction towards Verifying Procedural Programs | 2016-02-26 | Paper |
| Constrained Term Rewriting tooL | 2016-01-12 | Paper |
| Confluence Competition 2015 | 2015-12-02 | Paper |
| Reducing Relative Termination to Dependency Pair Problems | 2015-12-02 | Paper |
| A Finite Representation of the Narrowing Space | 2015-11-30 | Paper |
| A framework for computing finite SLD trees | 2015-02-27 | Paper |
| Completion after Program Inversion of Injective Functions | 2014-07-22 | Paper |
| Conversion to tail recursion in term rewriting | 2014-02-25 | Paper |
| Transformation for Refining Unraveled Conditional Term Rewriting Systems | 2013-12-06 | Paper |
| Term Rewriting with Logical Constraints | 2013-09-20 | Paper |
| Computing More Specific Versions of Conditional Rewriting Systems | 2013-09-13 | Paper |
| Improving Determinization of Grammar Programs for Program Inversion | 2013-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2844056 | 2013-08-27 | Paper |
| Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity | 2012-08-15 | Paper |
| Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity | 2012-04-24 | Paper |
| Program Inversion for Tail Recursive Functions | 2012-04-24 | Paper |
| On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs | 2011-07-29 | Paper |
| Termination of narrowing via termination of rewriting | 2010-05-07 | Paper |
| Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing | 2010-05-04 | Paper |
| Proving Injectivity of Functions via Program Inversion in Term Rewriting | 2010-05-04 | Paper |
| Term Rewriting and Applications | 2005-11-11 | Paper |
