| Publication | Date of Publication | Type |
|---|
| Graph-embedded rewrite systems: combination and undecidability results | 2026-02-26 | Paper |
CryptoSolve: towards a tool for the symbolic analysis of cryptographic algorithms
(available as arXiv preprint) | 2024-02-08 | Paper |
| CryptoSolve: towards a tool for the symbolic analysis of cryptographic algorithms | 2024-02-08 | Paper |
| Existence and Construction of a Gr\"obner Basis for a Polynomial Ideal | 2023-06-15 | Paper |
| Some results on equational unification | 2023-04-28 | Paper |
Any ground associative-commutative theory has a finite canonical system
Rewriting Techniques and Applications | 2022-12-09 | Paper |
Some independence results for equational unification
Rewriting Techniques and Applications | 2022-12-09 | Paper |
It is undecidable whether the Knuth-Bendix completion procedure generates a crossed pair
STACS 89 | 2022-08-16 | Paper |
| Algorithmic problems in the symbolic approach to the verification of automatically synthesized cryptosystems | 2022-03-24 | Paper |
Asymmetric unification and disunification
(available as arXiv preprint) | 2020-06-04 | Paper |
| Reviving basic narrowing modulo | 2020-05-13 | Paper |
On asymmetric unification for the theory of XOR with a homomorphism
(available as arXiv preprint) | 2020-05-13 | Paper |
| Unification modulo lists with reverse relation with certain word equations | 2020-03-10 | Paper |
| scientific article; zbMATH DE number 7075873 (Why is no real title available?) | 2019-07-03 | Paper |
Unification and matching modulo nilpotence
Automated Deduction — Cade-13 | 2019-01-15 | Paper |
The word matching problem is undecidable for finite special string-rewriting systems that are confluent
Automata, Languages and Programming | 2018-07-04 | Paper |
Deciding the confluence of ordered term rewrite systems
ACM Transactions on Computational Logic | 2017-06-13 | Paper |
Unification and matching in hierarchical combinations of syntactic theories
Frontiers of Combining Systems | 2017-02-27 | Paper |
Unification over distributive exponentiation (sub)theories
Journal of Automata, Languages and Combinatorics | 2016-09-29 | Paper |
String rewriting and security analysis: an extension of a result of Book and Otto
Journal of Automata, Languages and Combinatorics | 2016-09-29 | Paper |
On unification modulo one-sided distributivity: algorithms, variants and asymmetry
Logical Methods in Computer Science | 2015-08-25 | Paper |
On Asymmetric Unification and the Combination Problem in Disjoint Theories
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Unification modulo a 2-sorted equational theory for cipher-decipher block chaining
Logical Methods in Computer Science | 2014-03-24 | Paper |
On Forward Closure and the Finite Variant Property
Frontiers of Combining Systems | 2013-09-20 | Paper |
Hierarchical Combination
Automated Deduction – CADE-24 | 2013-06-14 | Paper |
Asymmetric unification: a new unification paradigm for cryptographic protocol analysis
Automated Deduction – CADE-24 | 2013-06-14 | Paper |
Unification modulo synchronous distributivity
Automated Reasoning | 2012-09-05 | Paper |
New algorithms for unification modulo one-sided distributivity and its variants
Automated Reasoning | 2012-09-05 | Paper |
Unification modulo homomorphic encryption
Journal of Automated Reasoning | 2012-07-17 | Paper |
Unification Modulo Chaining
Language and Automata Theory and Applications | 2012-06-08 | Paper |
Unification modulo ACUI plus homomorphisms/distributivity.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Unification modulo homomorphic encryption
Frontiers of Combining Systems | 2010-01-07 | Paper |
Closure properties and decision problems of dag automata
Information Processing Letters | 2009-12-04 | Paper |
On Extended Regular Expressions
Language and Automata Theory and Applications | 2009-04-02 | Paper |
Unification and Matching Modulo Leaf-Permutative Equational Presentations
Automated Reasoning | 2008-11-27 | Paper |
Intruders with Caps
Lecture Notes in Computer Science | 2008-01-02 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Mechanizing Mathematical Reasoning
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Unification modulo ACUI plus distributivity axioms
Journal of Automated Reasoning | 2005-05-17 | Paper |
| scientific article; zbMATH DE number 2043528 (Why is no real title available?) | 2004-02-16 | Paper |
Complexity of nilpotent unification and matching problems.
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1696827 (Why is no real title available?) | 2002-04-28 | Paper |
Unification of concept terms in description logics
Journal of Symbolic Computation | 2001-04-16 | Paper |
| scientific article; zbMATH DE number 1392288 (Why is no real title available?) | 2000-01-24 | Paper |
| scientific article; zbMATH DE number 1342225 (Why is no real title available?) | 1999-09-22 | Paper |
| scientific article; zbMATH DE number 1189061 (Why is no real title available?) | 1999-01-04 | Paper |
| scientific article; zbMATH DE number 1189065 (Why is no real title available?) | 1998-08-13 | Paper |
Equational unification, word unification, and 2nd-order equational unification
Theoretical Computer Science | 1998-08-13 | Paper |
Single versus simultaneous equational unification and equational unification for variable-permuting theories
Journal of Automated Reasoning | 1998-02-04 | Paper |
Any ground associative-commutative theory has a finite canonical system
Journal of Automated Reasoning | 1997-12-14 | Paper |
| scientific article; zbMATH DE number 1047943 (Why is no real title available?) | 1997-11-09 | Paper |
On the unification problem for Cartesian closed categories
Journal of Symbolic Logic | 1997-01-01 | Paper |
| scientific article; zbMATH DE number 845925 (Why is no real title available?) | 1996-02-20 | Paper |
Codes modulo finite monadic string-rewriting systems
Theoretical Computer Science | 1995-11-06 | Paper |
Theorem proving using equational matings and rigid E -unification
Journal of the ACM | 1994-11-13 | Paper |
On weakly confluent monadic string-rewriting systems
Theoretical Computer Science | 1994-01-09 | Paper |
Complexity of unification problems with associative-commutative operators
Journal of Automated Reasoning | 1993-12-20 | Paper |
| scientific article; zbMATH DE number 176741 (Why is no real title available?) | 1993-05-18 | Paper |
An algorithm for finding canonical sets of ground rewrite rules in polynomial time
Journal of the ACM | 1993-05-16 | Paper |
It is undecidable whether a finite special string-rewriting system presents a group
Discrete Mathematics | 1992-06-28 | Paper |
Sufficient-completeness, ground-reducibility and their complexity
Acta Informatica | 1991-01-01 | Paper |
Automating inductionless induction using test sets
Journal of Symbolic Computation | 1991-01-01 | Paper |
Semi-unification
Theoretical Computer Science | 1991-01-01 | Paper |
On ground-confluence of term rewriting systems
Information and Computation | 1990-01-01 | Paper |
Rigid E-unification: NP-completeness and applications to equational matings
Information and Computation | 1990-01-01 | Paper |
It is decidable whether a monadic thue system is canonical over a regular set
Mathematical Systems Theory | 1990-01-01 | Paper |
Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems
Theoretical Computer Science | 1989-01-01 | Paper |
Cancellativity in finitely presented semigroups
Journal of Symbolic Computation | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4109028 (Why is no real title available?) | 1989-01-01 | Paper |
Only prime superpositions need be considered in the Knuth-Bendix completion procedure
Journal of Symbolic Computation | 1988-01-01 | Paper |
Church-Rosser Thue systems and formal languages
Journal of the ACM | 1988-01-01 | Paper |
Elements of finite order for finite weight-reducing and confluent Thue systems
Acta Informatica | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4080962 (Why is no real title available?) | 1988-01-01 | Paper |
Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule
Information Processing Letters | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4092757 (Why is no real title available?) | 1988-01-01 | Paper |
Complexity of matching problems
Journal of Symbolic Computation | 1987-01-01 | Paper |
On sufficient-completeness and related properties of term rewriting systems
Acta Informatica | 1987-01-01 | Paper |
Matching, unification and complexity
ACM SIGSAM Bulletin | 1987-01-01 | Paper |
Special monoids and special Thue systems
Journal of Algebra | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4049047 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4047063 (Why is no real title available?) | 1986-01-01 | Paper |
The problems of cyclic equality and conjugacy for finite complete rewriting systems
Theoretical Computer Science | 1986-01-01 | Paper |
On the regular equivalence problem for regular Thue systems
Theoretical Computer Science | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4011938 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3930347 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3921983 (Why is no real title available?) | 1985-01-01 | Paper |
A finite Thue system with decidable word problem and without equivalent finite canonical system
Theoretical Computer Science | 1985-01-01 | Paper |
The Knuth-Bendix Completion Procedure and Thue Systems
SIAM Journal on Computing | 1985-01-01 | Paper |
On recursive path ordering
Theoretical Computer Science | 1985-01-01 | Paper |
Complexity of certain decision problems about congruential languages
Journal of Computer and System Sciences | 1985-01-01 | Paper |
Complexity results on the conjugacy problem for monoids
Theoretical Computer Science | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3905845 (Why is no real title available?) | 1985-01-01 | Paper |
An \(O(| T| ^ 3)\) algorithm for testing the Church-Rosser property of Thue systems
Theoretical Computer Science | 1985-01-01 | Paper |
The Church-Rosser property and special Thue systems
Theoretical Computer Science | 1985-01-01 | Paper |
The uniform conjugacy problem for finite church—Rosser thue systems is NP-complete
Information and Control | 1984-01-01 | Paper |
The undecidability of the preperfectness of Thue systems
Theoretical Computer Science | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3850464 (Why is no real title available?) | 1983-01-01 | Paper |
