| Publication | Date of Publication | Type |
|---|
A proof system for conditional algebraic specifications
Conditional and Typed Rewriting Systems | 2023-03-09 | Paper |
Any ground associative-commutative theory has a finite canonical system
Rewriting Techniques and Applications | 2022-12-09 | Paper |
| Unification modulo lists with reverse relation with certain word equations | 2020-03-10 | Paper |
One-variable context-free hedge automata
Journal of Computer and System Sciences | 2019-06-25 | Paper |
| A parametrized propositional dynamic logic with application to service synthesis | 2018-04-23 | Paper |
Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Deciding the confluence of ordered term rewrite systems
ACM Transactions on Computational Logic | 2017-06-13 | Paper |
Intruder deducibility constraints with negation. Decidability and application to secured service compositions
Journal of Symbolic Computation | 2017-02-06 | Paper |
Intruder deducibility constraints with negation. Decidability and application to secured service compositions
Journal of Symbolic Computation | 2017-02-06 | Paper |
Satisfiability of general intruder constraints with and without a set constructor
Journal of Symbolic Computation | 2017-02-06 | 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 |
Parametrized automata simulation and application to service composition
Journal of Symbolic Computation | 2015-01-14 | Paper |
Unification modulo a 2-sorted equational theory for cipher-decipher block chaining
Logical Methods in Computer Science | 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
Electronic Notes in Theoretical Computer Science | 2013-07-24 | Paper |
Rewrite Closure and CF Hedge Automata
Language and Automata Theory and Applications | 2013-03-18 | Paper |
| Relating two standard notions of secrecy | 2012-09-28 | Paper |
Unification modulo synchronous distributivity
Automated Reasoning | 2012-09-05 | Paper |
Decidability of equivalence of symbolic derivations
Journal of Automated Reasoning | 2012-07-17 | 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 |
Combining satisfiability procedures for unions of theories with a shared counting operator
Fundamenta Informaticae | 2011-03-28 | Paper |
Compiling and securing cryptographic protocols
Information Processing Letters | 2010-09-02 | Paper |
Unification modulo ACUI plus homomorphisms/distributivity.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures
Theoretical Computer Science | 2010-03-10 | Paper |
Unification modulo homomorphic encryption
Frontiers of Combining Systems | 2010-01-07 | Paper |
Data structures with arithmetic constraints: A non-disjoint combination
Frontiers of Combining Systems | 2010-01-07 | Paper |
Closure properties and decision problems of dag automata
Information Processing Letters | 2009-12-04 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | Paper |
Combinable Extensions of Abelian Groups
Automated Deduction – CADE-22 | 2009-07-28 | Paper |
Satisfiability Procedures for Combination of Theories Sharing Integer Offsets
Tools and Algorithms for the Construction and Analysis of Systems | 2009-03-31 | Paper |
Tree Automata with Equality Constraints Modulo Equational Theories
Automated Reasoning | 2009-03-12 | Paper |
Relating Two Standard Notions of Secrecy
Computer Science Logic | 2009-03-12 | Paper |
Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms
Rewriting, Computation and Proof | 2009-03-06 | Paper |
Hierarchical Combination of Intruder Theories
Lecture Notes in Computer Science | 2008-09-25 | Paper |
Towards an Automatic Analysis of Web Service Security
Frontiers of Combining Systems | 2008-09-16 | Paper |
Closure of Hedge-Automata Languages by Hedge Rewriting
Rewriting Techniques and Applications | 2008-08-28 | Paper |
Verifying Cryptographic Protocols with Subterms Constraints
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-15 | Paper |
Tree automata with equality constraints modulo equational theories
The Journal of Logic and Algebraic Programming | 2008-04-22 | Paper |
Hierarchical combination of intruder theories
Information and Computation | 2008-04-16 | 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 |
Relating two standard notions of secrecy
Logical Methods in Computer Science | 2007-11-15 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
Formal Techniques for Networked and Distributed Systems - FORTE 2005
Lecture Notes in Computer Science | 2006-07-07 | Paper |
Formal design and verification of operational transformation algorithms for copies convergence
Theoretical Computer Science | 2006-04-06 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Algebraic Methodology and Software Technology
Lecture Notes in Computer Science | 2005-08-25 | Paper |
An NP decision procedure for protocol insecurity with XOR
Theoretical Computer Science | 2005-06-30 | Paper |
Unification modulo ACUI plus distributivity axioms
Journal of Automated Reasoning | 2005-05-17 | Paper |
| scientific article; zbMATH DE number 2163007 (Why is no real title available?) | 2005-04-29 | Paper |
Incorporating decision procedures in implicit induction.
Journal of Symbolic Computation | 2003-08-21 | Paper |
A rewriting approach to satisfiability procedures.
Information and Computation | 2003-08-19 | Paper |
Mechanical verification of an ideal incremental ABR conformance algorithm
Journal of Automated Reasoning | 2003-06-09 | Paper |
Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
Theoretical Computer Science | 2003-05-25 | Paper |
| scientific article; zbMATH DE number 1903364 (Why is no real title available?) | 2003-05-01 | Paper |
| scientific article; zbMATH DE number 1848313 (Why is no real title available?) | 2003-01-01 | Paper |
Observational proofs by rewriting.
Theoretical Computer Science | 2002-07-31 | Paper |
Algorithms and reductions for rewriting problems
Fundamenta Informaticae | 2002-07-14 | Paper |
| scientific article; zbMATH DE number 1696763 (Why is no real title available?) | 2002-06-30 | Paper |
| scientific article; zbMATH DE number 1696827 (Why is no real title available?) | 2002-04-28 | Paper |
| scientific article; zbMATH DE number 1722694 (Why is no real title available?) | 2002-03-21 | Paper |
| scientific article; zbMATH DE number 1670787 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1523000 (Why is no real title available?) | 2000-10-30 | 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 |
Matching a set of strings with variable length don't cares
Theoretical Computer Science | 1998-07-22 | Paper |
Any ground associative-commutative theory has a finite canonical system
Journal of Automated Reasoning | 1997-12-14 | Paper |
Undecidability of ground reducibility for word rewriting systems with variables
Information Processing Letters | 1997-02-28 | Paper |
Reasoning with conditional axioms
Annals of Mathematics and Artificial Intelligence | 1997-01-14 | Paper |
Automated Mathematical Induction
Journal Of Logic And Computation | 1996-02-20 | Paper |
Implicit induction in conditional theories
Journal of Automated Reasoning | 1995-05-30 | Paper |
Automated deduction with associative-commutative operators
Applicable Algebra in Engineering, Communication and Computing | 1994-12-14 | Paper |
| scientific article; zbMATH DE number 500953 (Why is no real title available?) | 1994-09-21 | Paper |
Proving refutational completeness of theorem-proving strategies
Journal of the ACM | 1994-08-21 | Paper |
The term rewriting approach to automated theorem proving
The Journal of Logic Programming | 1992-11-10 | Paper |
| scientific article; zbMATH DE number 4776 (Why is no real title available?) | 1992-06-25 | Paper |
Theorem-proving with resolution and superposition
Journal of Symbolic Computation | 1991-01-01 | Paper |
On word problems in Horn theories
Journal of Symbolic Computation | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4064978 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4089521 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4016226 (Why is no real title available?) | 1987-01-01 | Paper |
On termination of the direct sum of term-rewriting systems
Information Processing Letters | 1987-01-01 | Paper |
Path of subterms ordering and recursive decomposition ordering revisited
Journal of Symbolic Computation | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4049135 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3921961 (Why is no real title available?) | 1985-01-01 | Paper |
