Kumar Neeraj Verma

Publication Activity (10 Years)

Years Active: 2000-2010
Publications (10 Years): 0

Publications

Thomas Martin Gawlitza, Helmut Seidl, Kumar Neeraj Verma
Normalization of Linear Horn Clauses. SBMF (2010)
Helmut Seidl, Kumar Neeraj Verma
Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case. RTA (2009)
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)
Kumar Neeraj Verma, Jean Goubault-Larrecq
Alternating two-way AC-tree automata. Inf. Comput. 205 (6) (2007)
Helmut Seidl, Kumar Neeraj Verma
Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses. Program Analysis and Compilation (2006)
Helmut Seidl, Kumar Neeraj Verma
Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying CoRR (2005)
Jean Goubault-Larrecq, Muriel Roger, Kumar Neeraj Verma
Abstraction and resolution modulo AC: How to verify Diffie-Hellman-like protocols automatically. J. Log. Algebraic Methods Program. 64 (2) (2005)
Kumar Neeraj Verma, Jean Goubault-Larrecq
Karp-Miller Trees for a Branching Extension of VASS. Discret. Math. Theor. Comput. Sci. 7 (1) (2005)
Kumar Neeraj Verma, Helmut Seidl, Thomas Schwentick
On the Complexity of Equational Horn Clauses. CADE (2005)
Helmut Seidl, Kumar Neeraj Verma
Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying. LPAR (2004)
Kumar Neeraj Verma
Alternation in Equational Tree Automata Modulo XOR. FSTTCS (2004)
Kumar Neeraj Verma
On Closure under Complementation of Equational Tree Automata for Theories Extending AC. LPAR (2003)
Kumar Neeraj Verma
Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties. RTA (2003)
Kumar Neeraj Verma, Jean Goubault-Larrecq, Sanjiva Prasad, S. Arun-Kumar
Reflecting BDDs in Coq. ASIAN (2000)