| Publication | Date of Publication | Type |
|---|
| Higher order disunification: Some decidable cases | 2022-08-16 | Paper |
| On Symbolic Heaps Modulo Permission Theories | 2020-11-25 | Paper |
| A logic you can count on | 2015-11-11 | Paper |
| FORWARD ANALYSIS OF DYNAMIC NETWORK OF PUSHDOWN SYSTEMS IS EASIER WITHOUT ORDER | 2011-07-14 | Paper |
| Complexity of modal logics with Presburger constraints | 2010-09-15 | Paper |
| Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order | 2009-11-19 | Paper |
| Presburger Modal Logic Is PSPACE-Complete | 2009-03-12 | Paper |
| Towards an Automatic Analysis of Web Service Security | 2008-09-16 | Paper |
| Verifying Cryptographic Protocols with Subterms Constraints | 2008-05-15 | Paper |
| Symbolic protocol analysis for monoidal equational theories | 2008-04-16 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-28 | Paper |
| Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or | 2007-09-11 | Paper |
| Intruder deduction for the equational theory of abelian groups with distributive encryption | 2007-04-16 | Paper |
| XML schema, tree logic and sheaves automata | 2007-01-24 | Paper |
| Decidable first-order transition logics for PA-processes | 2005-12-07 | Paper |
| A partial order semantics approach to the clock explosion problem of timed automata | 2005-12-06 | Paper |
| Term Rewriting and Applications | 2005-11-11 | Paper |
| Implementation and Application of Automata | 2005-08-17 | Paper |
| Multitree automata that count | 2005-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738481 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4447237 | 2004-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417868 | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4791271 | 2003-02-06 | Paper |
| On the symbolic reduction of processes with cryptographic functions. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536615 | 2002-11-28 | Paper |
| Algorithms and reductions for rewriting problems | 2002-07-14 | Paper |
| The regular viewpoint on PA-processes | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754156 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2736358 | 2001-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4266522 | 1999-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251913 | 1999-09-23 | Paper |
| Positive and negative results for higher-order disunification | 1996-11-17 | Paper |
| Tree automata help one to solve equational formulae in AC-theories | 1995-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281554 | 1994-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035251 | 1993-05-18 | Paper |
| A rewrite-based type discipline for a subset of computer algebra | 1992-06-25 | Paper |
| A knowledge-based system for computer algebra | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4723297 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3747717 | 1986-01-01 | Paper |
| Fast Hensel's lifting implementation using partial fraction decomposition | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727382 | 1984-01-01 | Paper |
