Kumar Neeraj Verma

From MaRDI portal
Person:2373698



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!

PublicationDate of PublicationType
Flat and one-variable clauses: complexity of verifying cryptographic protocols with single blind copying
ACM Transactions on Computational Logic
2017-07-12Paper
Normalization of linear Horn clauses
Lecture Notes in Computer Science
2011-05-12Paper
On closure under complementation of equational tree automata for theories extending AC2010-02-24Paper
Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case
Rewriting Techniques and Applications
2009-06-30Paper
Karp-Miller trees for a branching extension of VASS2008-05-27Paper
Karp-Miller trees for a branching extension of VASS2008-05-27Paper
Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses
Program Analysis and Compilation, Theory and Practice
2007-09-24Paper
Alternating two-way AC-tree automata
Information and Computation
2007-07-16Paper
Automated Deduction – CADE-20
Lecture Notes in Computer Science
2006-11-01Paper
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying
Lecture Notes in Computer Science
2005-11-10Paper
Alternation in equational tree automata modulo XOR
Lecture Notes in Computer Science
2005-08-12Paper
Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically
The Journal of Logic and Algebraic Programming
2005-08-01Paper
Two-way equational tree automata for AC-like theories: Decidability and closure properties
Lecture Notes in Computer Science
2004-02-16Paper
Reflecting BDDs in Coq
Lecture Notes in Computer Science
2002-07-08Paper


Research outcomes over time


This page was built for person: Kumar Neeraj Verma