Kumar Neeraj Verma

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Flat and one-variable clauses: complexity of verifying cryptographic protocols with single blind copying ACM Transactions on Computational Logic	2017-07-12	Paper
Normalization of linear Horn clauses Lecture Notes in Computer Science	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 Rewriting Techniques and Applications	2009-06-30	Paper
Karp-Miller trees for a branching extension of VASS	2008-05-27	Paper
Karp-Miller trees for a branching extension of VASS	2008-05-27	Paper
Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses Program Analysis and Compilation, Theory and Practice	2007-09-24	Paper
Alternating two-way AC-tree automata Information and Computation	2007-07-16	Paper
Automated Deduction – CADE-20 Lecture Notes in Computer Science	2006-11-01	Paper
Logic for Programming, Artificial Intelligence, and Reasoning Lecture Notes in Computer Science	2005-11-10	Paper
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science Lecture Notes in Computer Science	2005-08-12	Paper
Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically The Journal of Logic and Algebraic Programming	2005-08-01	Paper
scientific article; zbMATH DE number 2043529 (Why is no real title available?)	2004-02-16	Paper
scientific article; zbMATH DE number 1696436 (Why is no real title available?)	2002-07-08	Paper

Research outcomes over time

This page was built for person: Kumar Neeraj Verma