Kumar Neeraj Verma

Available identifiers

zbMath Open verma.kumar-neerajMaRDI QIDQ2373698

List of research outcomes

Publication	Date of Publication	Type
Flat and one-variable clauses: complexity of verifying cryptographic protocols with single blind copying	2017-07-12	Paper
Normalization of linear Horn clauses	2011-05-12	Paper
On closure under complementation of equational tree automata for theories extending AC	2010-02-24	Paper
Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case	2009-06-30	Paper
Karp-Miller trees for a branching extension of VASS	2008-05-27	Paper
Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses	2007-09-24	Paper
Alternating two-way AC-tree automata	2007-07-16	Paper
Automated Deduction – CADE-20	2006-11-01	Paper
Logic for Programming, Artificial Intelligence, and Reasoning	2005-11-10	Paper
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science	2005-08-12	Paper
Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically	2005-08-01	Paper
https://portal.mardi4nfdi.de/entity/Q4447233	2004-02-16	Paper
https://portal.mardi4nfdi.de/entity/Q2766536	2002-07-08	Paper

Research outcomes over time

This page was built for person: Kumar Neeraj Verma