Kumar Neeraj Verma

According to our database, Kumar Neeraj Verma authored at least 12 papers between 2000 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2010

Normalization of Linear Horn Clauses.

Thomas Martin Gawlitza, Helmut Seidl, Kumar Neeraj Verma

Proceedings of the Formal Methods: Foundations and Applications, 2010

2009

Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case.

Helmut Seidl, Kumar Neeraj Verma

Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

2008

Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying.

Helmut Seidl, Kumar Neeraj Verma

ACM Trans. Comput. Log., 2008

2007

Alternating two-way AC-tree automata.

Kumar Neeraj Verma, Jean Goubault-Larrecq

Inf. Comput., 2007

2006

Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses.

Helmut Seidl, Kumar Neeraj Verma

Proceedings of the Program Analysis and Compilation, 2006

2005

Abstraction and resolution modulo AC: How to verify Diffie-Hellman-like protocols automatically.

Jean Goubault-Larrecq, Muriel Roger, Kumar Neeraj Verma

J. Log. Algebraic Methods Program., 2005

Karp-Miller Trees for a Branching Extension of VASS.

Kumar Neeraj Verma, Jean Goubault-Larrecq

Discret. Math. Theor. Comput. Sci., 2005

On the Complexity of Equational Horn Clauses.

Kumar Neeraj Verma, Helmut Seidl, Thomas Schwentick

Proceedings of the Automated Deduction, 2005

2004

Alternation in Equational Tree Automata Modulo XOR.

Kumar Neeraj Verma

Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

2003

Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties.

Kumar Neeraj Verma

Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003

On Closure under Complementation of Equational Tree Automata for Theories Extending AC.

Kumar Neeraj Verma

Proceedings of the Logic for Programming, 2003

2000

Reflecting BDDs in Coq.

Kumar Neeraj Verma, Jean Goubault-Larrecq, Sanjiva Prasad, S. Arun-Kumar

Proceedings of the Advances in Computing Science, 2000