| 2008 |
|---|
| 12 | EE | Helmut Seidl,
Kumar Neeraj Verma:
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying.
ACM Trans. Comput. Log. 9(4): (2008) |
| 2007 |
|---|
| 11 | EE | Kumar Neeraj Verma,
Jean Goubault-Larrecq:
Alternating two-way AC-tree automata.
Inf. Comput. 205(6): 817-869 (2007) |
| 2006 |
|---|
| 10 | EE | Helmut Seidl,
Kumar Neeraj Verma:
Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses.
Program Analysis and Compilation 2006: 97-119 |
| 2005 |
|---|
| 9 | EE | Kumar Neeraj Verma,
Helmut Seidl,
Thomas Schwentick:
On the Complexity of Equational Horn Clauses.
CADE 2005: 337-352 |
| 8 | EE | Helmut Seidl,
Kumar Neeraj Verma:
Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying
CoRR abs/cs/0511014: (2005) |
| 7 | EE | Kumar Neeraj Verma,
Jean Goubault-Larrecq:
Karp-Miller Trees for a Branching Extension of VASS.
Discrete Mathematics & Theoretical Computer Science 7(1): 217-230 (2005) |
| 6 | EE | Jean Goubault-Larrecq,
Muriel Roger,
Kumar Neeraj Verma:
Abstraction and resolution modulo AC: How to verify Diffie-Hellman-like protocols automatically.
J. Log. Algebr. Program. 64(2): 219-251 (2005) |
| 2004 |
|---|
| 5 | EE | Kumar Neeraj Verma:
Alternation in Equational Tree Automata Modulo XOR.
FSTTCS 2004: 518-530 |
| 4 | EE | Helmut Seidl,
Kumar Neeraj Verma:
Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying.
LPAR 2004: 79-94 |
| 2003 |
|---|
| 3 | EE | Kumar Neeraj Verma:
On Closure under Complementation of Equational Tree Automata for Theories Extending AC.
LPAR 2003: 183-197 |
| 2 | EE | Kumar Neeraj Verma:
Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties.
RTA 2003: 180-196 |
| 2000 |
|---|
| 1 | EE | Kumar Neeraj Verma,
Jean Goubault-Larrecq,
Sanjiva Prasad,
S. Arun-Kumar:
Reflecting BDDs in Coq.
ASIAN 2000: 162-181 |
