Kumar Neeraj Verma - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 13 from 13

2010

Normalization of Linear Horn ClausesThomas Martin Gawlitza, Helmut Seidl, Kumar Neeraj Verma. sbmf 2011: 242-257 [doi]

2009

Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR CaseHelmut Seidl, Kumar Neeraj Verma. RTA 2009: 118-132 [doi]

2008

Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copyingHelmut Seidl, Kumar Neeraj Verma. tocl, 9(4), 2008. [doi]

2007

Alternating two-way AC-tree automataKumar Neeraj Verma, Jean Goubault-Larrecq. iandc, 205(6):817-869, 2007. [doi]

2006

Cryptographic Protocol Verification Using Tractable Classes of Horn ClausesHelmut Seidl, Kumar Neeraj Verma. birthday 2007: 97-119 [doi]

2005

Abstraction and resolution modulo AC: How to verify Diffie-Hellman-like protocols automaticallyJean Goubault-Larrecq, Muriel Roger, Kumar Neeraj Verma. jlp, 64(2):219-251, 2005. [doi]

Karp-Miller Trees for a Branching Extension of VASSKumar Neeraj Verma, Jean Goubault-Larrecq. dmtcs, 7(1):217-230, 2005. [doi]

On the Complexity of Equational Horn ClausesKumar Neeraj Verma, Helmut Seidl, Thomas Schwentick. cade 2005: 337-352 [doi]

2004

Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind CopyingHelmut Seidl, Kumar Neeraj Verma. lpar 2005: 79-94 [doi]

Alternation in Equational Tree Automata Modulo XORKumar Neeraj Verma. fsttcs 2004: 518-530 [doi]

2003

Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure PropertiesKumar Neeraj Verma. RTA 2003: 180-196 [doi]

On Closure under Complementation of Equational Tree Automata for Theories Extending ACKumar Neeraj Verma. lpar 2003: 183-197 [doi]

2000

Reflecting BDDs in CoqKumar Neeraj Verma, Jean Goubault-Larrecq, Sanjiva Prasad, S. Arun-Kumar. asian 2000: 162-181 [doi]

Sign in or sign up to see more results.

runs on WebDSL