Normalization of linear horn clauses | 0 | 0.34 | 2010 |
Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case | 2 | 0.41 | 2009 |
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying | 5 | 0.44 | 2008 |
Alternating two-way AC-tree automata | 6 | 0.47 | 2007 |
Abstraction and resolution modulo AC: How to verify Diffie–Hellman-like protocols automatically | 28 | 1.30 | 2005 |
On the complexity of equational horn clauses | 62 | 2.27 | 2005 |
Karp-Miller Trees For A Branching Extension Of Vass | 23 | 0.94 | 2005 |
Alternation in equational tree automata modulo XOR | 3 | 0.46 | 2004 |
On Closure under Complementation of Equational Tree Automata for Theories Extending AC | 7 | 0.48 | 2003 |
Two-way equational tree automata for AC-like theories: decidability and closure properties | 17 | 0.78 | 2003 |
Reflecting BDDs in Coq | 18 | 0.97 | 2000 |