Kumar Neeraj Verma

14 papers A 1B 2Journal 5Unranked 6
YearRankTypeTitle / Venue / Authors
2010 — conf
Normalization of Linear Horn Clauses.
SBMF
Thomas Martin Gawlitza, Helmut Seidl, Kumar Neeraj Verma
2009 — conf
Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case.
RTA
Helmut Seidl, Kumar Neeraj Verma
2008 J jnl
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying.
ACM Trans. Comput. Log.
Helmut Seidl, Kumar Neeraj Verma
2007 J jnl
Alternating two-way AC-tree automata.
Inf. Comput.
Kumar Neeraj Verma, Jean Goubault-Larrecq
2006 — conf
Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses.
Program Analysis and Compilation
Helmut Seidl, Kumar Neeraj Verma
2005 J jnl
Abstraction and resolution modulo AC: How to verify Diffie-Hellman-like protocols automatically.
J. Log. Algebraic Methods Program.
Jean Goubault-Larrecq, Muriel Roger, Kumar Neeraj Verma
2005 J jnl
Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying
CoRR
Helmut Seidl, Kumar Neeraj Verma
2005 J jnl
Karp-Miller Trees for a Branching Extension of VASS.
Discret. Math. Theor. Comput. Sci.
Kumar Neeraj Verma, Jean Goubault-Larrecq
2005 A conf
On the Complexity of Equational Horn Clauses.
CADE
Kumar Neeraj Verma, Helmut Seidl, Thomas Schwentick
2004 — conf
Alternation in Equational Tree Automata Modulo XOR.
FSTTCS
Kumar Neeraj Verma
2004 B conf
Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying.
LPAR
Helmut Seidl, Kumar Neeraj Verma
2003 B conf
On Closure under Complementation of Equational Tree Automata for Theories Extending AC.
LPAR
Kumar Neeraj Verma
2003 — conf
Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties.
RTA
Kumar Neeraj Verma
2000 — conf
Reflecting BDDs in Coq.
ASIAN
Kumar Neeraj Verma, Jean Goubault-Larrecq, Sanjiva Prasad, S. Arun-Kumar