| Publication | Date of Publication | Type |
|---|
The first-order theory of one-step rewriting is undecidable
Rewriting Techniques and Applications | 2022-12-09 | Paper |
Equational and membership constraints for infinite trees
Rewriting Techniques and Applications | 2022-12-09 | Paper |
How to win a game with features
Constraints in Computational Logics | 2022-08-16 | Paper |
First order data types and first order logic
Lecture Notes in Computer Science | 2022-08-16 | Paper |
| scientific article; zbMATH DE number 7362732 (Why is no real title available?) | 2021-06-24 | Paper |
scientific article; zbMATH DE number 7362732 (Why is no real title available?)
(available as arXiv preprint) | 2021-06-24 | Paper |
Logics for unordered trees with data constraints
Journal of Computer and System Sciences | 2019-06-25 | Paper |
| A formally verified interpreter for a shell-like programming language | 2018-12-07 | Paper |
| Deciding the first-order theory of an algebra of feature trees with updates | 2018-10-18 | Paper |
Automata for unordered trees
Information and Computation | 2017-03-16 | Paper |
Logics for Unordered Trees with Data Constraints on Siblings
Language and Automata Theory and Applications | 2016-04-08 | Paper |
The first-order theory of subtyping constraints
Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-03-17 | Paper |
Reducing equational theories for the decision of static equivalence
Journal of Automated Reasoning | 2012-07-17 | Paper |
Easy intruder deductions
Lecture Notes in Computer Science | 2010-03-23 | Paper |
Reducing equational theories for the decision of static equivalence
Advances in Computer Science - ASIAN 2009. Information Security and Privacy | 2010-01-14 | Paper |
Proving Group Protocols Secure Against Eavesdroppers
Automated Reasoning | 2008-11-27 | Paper |
Symbolic protocol analysis for monoidal equational theories
Information and Computation | 2008-04-16 | 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 |
Term Rewriting and Applications
Lecture Notes in Computer Science | 2005-11-11 | Paper |
On rewrite constraints and context unification
Information Processing Letters | 2002-07-25 | Paper |
| scientific article; zbMATH DE number 1689581 (Why is no real title available?) | 2002-01-13 | Paper |
| scientific article; zbMATH DE number 1688809 (Why is no real title available?) | 2002-01-09 | Paper |
The first-order theory of ordering constraints over feature trees
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2002-01-07 | Paper |
The first-order theory of ordering constraints over feature trees
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2002-01-07 | Paper |
Grid structures and undecidable constraint theories
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1512627 (Why is no real title available?) | 2000-10-03 | Paper |
| scientific article; zbMATH DE number 1456949 (Why is no real title available?) | 2000-06-07 | Paper |
The first-order theory of linear one-step rewriting is undecidable
Theoretical Computer Science | 1999-01-12 | Paper |
How to win a game with features
Information and Computation | 1998-11-10 | Paper |
The first-order theory of lexicographic path orderings is undecidable
Theoretical Computer Science | 1998-07-23 | Paper |
Records for logic programming
The Journal of Logic Programming | 1994-05-05 | Paper |
A new method for undecidability proofs of first order theories
Journal of Symbolic Computation | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 4210102 (Why is no real title available?) | 1990-01-01 | Paper |
