| Publication | Date of Publication | Type |
|---|
| A proof system for conditional algebraic specifications | 2023-03-09 | Paper |
| Any ground associative-commutative theory has a finite canonical system | 2022-12-09 | Paper |
| Unification modulo lists with reverse relation with certain word equations | 2020-03-10 | Paper |
| One-variable context-free hedge automata | 2019-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636284 | 2018-04-23 | Paper |
| Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption | 2017-07-12 | Paper |
| Deciding the confluence of ordered term rewrite systems | 2017-06-13 | Paper |
| Intruder deducibility constraints with negation. Decidability and application to secured service compositions | 2017-02-06 | Paper |
| Satisfiability of general intruder constraints with and without a set constructor | 2017-02-06 | Paper |
| String rewriting and security analysis: an extension of a result of Book and Otto | 2016-09-29 | Paper |
| Parametrized automata simulation and application to service composition | 2015-01-14 | Paper |
| Unification modulo a 2-sorted Equational theory for Cipher-Decipher Block Chaining | 2014-03-24 | Paper |
| Deciding the security of protocols with commuting public key encryption | 2013-09-25 | Paper |
| Automated analysis of security protocols | 2013-08-27 | Paper |
| The practice of cryptographic protocol verification | 2013-07-24 | Paper |
| Rewrite Closure and CF Hedge Automata | 2013-03-18 | Paper |
| Relating two standard notions of secrecy | 2012-09-28 | Paper |
| Unification Modulo Synchronous Distributivity | 2012-09-05 | Paper |
| Decidability of equivalence of symbolic derivations | 2012-07-17 | Paper |
| Unification modulo homomorphic encryption | 2012-07-17 | Paper |
| Unification Modulo Chaining | 2012-06-08 | Paper |
| Combining Satisfiability Procedures for Unions of Theories with a Shared Counting Operator | 2011-03-28 | Paper |
| Compiling and securing cryptographic protocols | 2010-09-02 | Paper |
| Automated Deduction – CADE-19 | 2010-04-20 | Paper |
| Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures | 2010-03-10 | Paper |
| Unification Modulo Homomorphic Encryption | 2010-01-07 | Paper |
| Data Structures with Arithmetic Constraints: A Non-disjoint Combination | 2010-01-07 | Paper |
| Closure properties and decision problems of dag automata | 2009-12-04 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| Combinable Extensions of Abelian Groups | 2009-07-28 | Paper |
| Satisfiability Procedures for Combination of Theories Sharing Integer Offsets | 2009-03-31 | Paper |
| Tree Automata with Equality Constraints Modulo Equational Theories | 2009-03-12 | Paper |
| Relating Two Standard Notions of Secrecy | 2009-03-12 | Paper |
| Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms | 2009-03-06 | Paper |
| Hierarchical Combination of Intruder Theories | 2008-09-25 | Paper |
| Towards an Automatic Analysis of Web Service Security | 2008-09-16 | Paper |
| Closure of Hedge-Automata Languages by Hedge Rewriting | 2008-08-28 | Paper |
| Verifying Cryptographic Protocols with Subterms Constraints | 2008-05-15 | Paper |
| Tree automata with equality constraints modulo equational theories | 2008-04-22 | Paper |
| Hierarchical combination of intruder theories | 2008-04-16 | Paper |
| Intruders with Caps | 2008-01-02 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Relating two standard notions of secrecy | 2007-11-15 | Paper |
| Computer Science Logic | 2007-06-21 | Paper |
| Formal Techniques for Networked and Distributed Systems - FORTE 2005 | 2006-07-07 | Paper |
| Formal design and verification of operational transformation algorithms for copies convergence | 2006-04-06 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Algebraic Methodology and Software Technology | 2005-08-25 | Paper |
| An NP decision procedure for protocol insecurity with XOR | 2005-06-30 | Paper |
| Unification modulo ACUI plus distributivity axioms | 2005-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673388 | 2005-04-29 | Paper |
| Incorporating decision procedures in implicit induction. | 2003-08-21 | Paper |
| A rewriting approach to satisfiability procedures. | 2003-08-19 | Paper |
| Mechanical verification of an ideal incremental ABR conformance algorithm | 2003-06-09 | Paper |
| Protocol insecurity with a finite number of sessions and composed keys is NP-complete. | 2003-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4804908 | 2003-05-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785507 | 2003-01-01 | Paper |
| Observational proofs by rewriting. | 2002-07-31 | Paper |
| Algorithms and reductions for rewriting problems | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2767013 | 2002-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2767094 | 2002-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2778866 | 2002-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754095 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511275 | 2000-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4936127 | 2000-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263810 | 1999-09-22 | Paper |
| Matching a set of strings with variable length don't cares | 1998-07-22 | Paper |
| Any ground associative-commutative theory has a finite canonical system | 1997-12-14 | Paper |
| Undecidability of ground reducibility for word rewriting systems with variables | 1997-02-28 | Paper |
| Reasoning with conditional axioms | 1997-01-14 | Paper |
| Automated Mathematical Induction | 1996-02-20 | Paper |
| Implicit induction in conditional theories | 1995-05-30 | Paper |
| Automated deduction with associative-commutative operators | 1994-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4279086 | 1994-09-21 | Paper |
| Proving refutational completeness of theorem-proving strategies | 1994-08-21 | Paper |
| The term rewriting approach to automated theorem proving | 1992-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4712663 | 1992-06-25 | Paper |
| Theorem-proving with resolution and superposition | 1991-01-01 | Paper |
| On word problems in Horn theories | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798649 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3818295 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3028369 | 1987-01-01 | Paper |
| On termination of the direct sum of term-rewriting systems | 1987-01-01 | Paper |
| Path of subterms ordering and recursive decomposition ordering revisited | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3786024 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3696501 | 1985-01-01 | Paper |
