| Publication | Date of Publication | Type |
|---|
Higher order disunification: some decidable cases
Constraints in Computational Logics | 2022-08-16 | Paper |
| On Symbolic Heaps Modulo Permission Theories | 2020-11-25 | Paper |
A logic you can count on
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-11-11 | Paper |
Forward analysis of dynamic network of pushdown systems is easier without order
International Journal of Foundations of Computer Science | 2011-07-14 | Paper |
Complexity of modal logics with Presburger constraints
Journal of Applied Logic | 2010-09-15 | Paper |
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
Lecture Notes in Computer Science | 2009-11-19 | Paper |
Presburger Modal Logic Is PSPACE-Complete
Automated Reasoning | 2009-03-12 | Paper |
Towards an Automatic Analysis of Web Service Security
Frontiers of Combining Systems | 2008-09-16 | Paper |
Verifying Cryptographic Protocols with Subterms Constraints
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-15 | Paper |
Symbolic protocol analysis for monoidal equational theories
Information and Computation | 2008-04-16 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or
Automata, Languages and Programming | 2007-09-11 | Paper |
Intruder deduction for the equational theory of abelian groups with distributive encryption
Information and Computation | 2007-04-16 | Paper |
XML schema, tree logic and sheaves automata
Applicable Algebra in Engineering, Communication and Computing | 2007-01-24 | Paper |
Decidable first-order transition logics for PA-processes
Information and Computation | 2005-12-07 | Paper |
A partial order semantics approach to the clock explosion problem of timed automata
Theoretical Computer Science | 2005-12-06 | Paper |
Term Rewriting and Applications
Lecture Notes in Computer Science | 2005-11-11 | Paper |
Implementation and Application of Automata
Lecture Notes in Computer Science | 2005-08-17 | Paper |
Multitree automata that count
Theoretical Computer Science | 2005-04-06 | Paper |
| scientific article; zbMATH DE number 2087632 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2043533 (Why is no real title available?) | 2004-02-16 | Paper |
| scientific article; zbMATH DE number 1956522 (Why is no real title available?) | 2003-07-30 | Paper |
| scientific article; zbMATH DE number 1864593 (Why is no real title available?) | 2003-02-06 | Paper |
On the symbolic reduction of processes with cryptographic functions.
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1759624 (Why is no real title available?) | 2002-11-28 | Paper |
Algorithms and reductions for rewriting problems
Fundamenta Informaticae | 2002-07-14 | Paper |
The regular viewpoint on PA-processes
Theoretical Computer Science | 2002-03-03 | Paper |
| scientific article; zbMATH DE number 1670836 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1638660 (Why is no real title available?) | 2001-08-29 | Paper |
| scientific article; zbMATH DE number 1346499 (Why is no real title available?) | 1999-10-04 | Paper |
| scientific article; zbMATH DE number 1304991 (Why is no real title available?) | 1999-09-23 | Paper |
Positive and negative results for higher-order disunification
Journal of Symbolic Computation | 1996-11-17 | Paper |
Tree automata help one to solve equational formulae in AC-theories
Journal of Symbolic Computation | 1995-06-08 | Paper |
| scientific article; zbMATH DE number 512857 (Why is no real title available?) | 1994-07-18 | Paper |
| scientific article; zbMATH DE number 176149 (Why is no real title available?) | 1993-05-18 | Paper |
A rewrite-based type discipline for a subset of computer algebra
Journal of Symbolic Computation | 1992-06-25 | Paper |
A knowledge-based system for computer algebra
ACM SIGSAM Bulletin | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3997161 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3984564 (Why is no real title available?) | 1986-01-01 | Paper |
Fast Hensel's lifting implementation using partial fraction decomposition
Discrete Mathematics | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3958729 (Why is no real title available?) | 1984-01-01 | Paper |
