Lehrstuhl Informatik II   
Sprachen und Beschreibungsstrukturen      
   Home Personen Ehemalige Dr. Kumar Neeraj Verma login

Dr. Kumar Neeraj Verma

Name:Dr. Kumar Neeraj Verma
Raum:-
Tel:-
eMail:verma<at>in.tum.de
Visitenkarte:

Die private Homepage ist über den folgenden Link erreichbar: http://www2.in.tum.de/~verma

Publications of Neeraj Verma

Journal Articles

The following articles appeared in peer-reviewed journals. The copyright of these articles lies with the respective journals.

  1. Helmut Seidl and Kumar Neeraj Verma. Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying. ACM Trans. Comput. Log., 9(4), 2008.

    Detail: Abstract Download: PDF Reference: Bibtex


Conference Papers

The following papers were published in peer-reviewed conferences. The copyright of these papers lies with the respective publishers.

  1. Helmut Seidl and Kumar Neeraj Verma. Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case. In Ralf Treinen, editor, Rewriting Techniques and Applications, volume 5595 of Lecture Notes in Computer Science, pages 118-132, Brasília, Brazil, June 2009. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  2. Helmut Seidl and Kumar Neeraj Verma. Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses. In Thomas W. Reps, Mooly Sagiv and Jörg Bauer, editors, Program Analysis and Compilation, Theory and Practice, volume 4444 of Lecture Notes in Computer Science, pages 97-119, 2007. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  3. Kumar Neeraj Verma, Helmut Seidl and Thomas Schwentick. On the Complexity of Equational Horn Clauses. In Robert Nieuwenhuis, editor, Automated Deduction - CADE-20, volume 3632 of Lecture Notes in Computer Science, pages 337-352, Tallinn, Estonia, July 2005. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  4. Helmut Seidl and Kumar Neeraj Verma. Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying. In Franz Baader and Andrei Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning, volume 3452 of Lecture Notes in Computer Science, pages 79-94, Montevideo, Uruguay, March 2004. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com


Workshop Papers and Technical Reports

  1. Helmut Seidl and Kumar Neeraj Verma. Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying. , volume abs/cs/0511014 of Forschungsbericht, 2005. Universität Trier, Mathematik/Informatik.

    Detail: Abstract Download: PDF Reference: Bibtex



TUM - Lehrstuhl Informatik II (Sprachen und Beschreibungsstrukturen) Thanks: Tango and TinyMCE     Generationszeit: 11 ms