| Publication | Date of Publication | Type |
|---|
| Theorem proving modulo associativity | 2024-06-21 | Paper |
| Constrained dynamic partial order reduction | 2023-05-05 | Paper |
| A precedence-based total AC-compatible ordering | 2022-12-09 | Paper |
| A recursive path ordering for higher-order terms in η-long β-normal form | 2022-12-09 | Paper |
| Using automated reasoning techniques for enhancing the efficiency and security of (Ethereum) smart contracts | 2022-12-07 | Paper |
| Distilling Constraints in Zero-Knowledge Protocols | 2022-12-07 | Paper |
| Lower-bound synthesis using loop specialization and Max-SMT | 2022-03-25 | Paper |
| SDN-actors: modeling and verification of SDN programs | 2021-05-04 | Paper |
| Actor-based model checking for software-defined networks | 2021-02-26 | Paper |
| Proving Termination Through Conditional Termination | 2020-08-05 | Paper |
| Resource Analysis driven by (Conditional) Termination Proofs | 2020-05-04 | Paper |
| AC-superposition with constraints: No AC-unifiers needed | 2020-01-21 | Paper |
| Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers | 2019-11-22 | Paper |
| Extension orderings | 2019-01-10 | Paper |
| Speeding up the Constraint-Based Method in Difference Logic | 2016-09-05 | Paper |
| Termination Competition (termCOMP 2015) | 2015-12-02 | Paper |
| The computability path ordering | 2015-10-29 | Paper |
| Normal Higher-Order Termination | 2015-09-17 | Paper |
| SMT-Based Array Invariant Generation | 2014-11-03 | Paper |
| Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions | 2014-09-26 | Paper |
| Paramodulation with non-monotonic orderings and simplification | 2013-07-05 | Paper |
| The recursive path and polynomial ordering for first-order and higher-order terms | 2013-04-19 | Paper |
| Nominal Completion for Rewrite Systems with Binders | 2012-11-01 | Paper |
| SAT modulo linear arithmetic for solving polynomial constraints | 2012-07-31 | Paper |
| A Monotonic Higher-Order Semantic Path Ordering | 2011-05-06 | Paper |
| Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic | 2009-07-28 | Paper |
| Paramodulation with Well-founded Orderings | 2009-04-16 | Paper |
| Orderings and Constraints: Theory and Practice of Proving Termination | 2009-03-06 | Paper |
| Polymorphic higher-order recursive path orderings | 2008-12-21 | Paper |
| The Computability Path Ordering: The End of a Quest | 2008-11-20 | Paper |
| Higher-Order Orderings for Normal Rewriting | 2008-09-25 | Paper |
| Higher-Order Termination: From Kruskal to Computability | 2008-05-27 | Paper |
| Recursive Path Orderings Can Also Be Incremental | 2008-05-27 | Paper |
| HORPO with Computability Closure: A Reconstruction | 2008-05-15 | Paper |
| Challenges in Satisfiability Modulo Theories | 2008-01-02 | Paper |
| Automated Reasoning | 2007-09-25 | Paper |
| Term Rewriting and Applications | 2005-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4809078 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4809069 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4447239 | 2004-02-16 | Paper |
| Paramodulation and Knuth-Bendix completion with nontotal and nonmonotonic orderings | 2003-06-09 | Paper |
| Paramodulation-based theorem proving | 2002-08-27 | Paper |
| A fully syntactic AC-RPO. | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723431 | 2001-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4518870 | 2000-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938602 | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4264721 | 1999-10-10 | Paper |
| Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering | 1999-01-12 | Paper |
| Paramodulation with built-in AC-theories and symbolic constraints | 1997-05-28 | Paper |
| A total AC-compatible ordering based on RPO | 1997-02-28 | Paper |
| Theorem proving with ordering and equality constrained clauses | 1995-09-04 | Paper |
