Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols

Author： Meseguer José  

Publisher： Springer Publishing Company

ISSN： 1388-3690

Source： LISP and Symbolic Computation, Vol.20, Iss.1-2, 2007-06, pp. : 123-160

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Using Forward Reachability Analysis for Verification of Lossy Channel Systems

By Abdulla Parosh Aziz   Collomb-Annichini Aurore   Bouajjani Ahmed   Jonsson Bengt  

Formal Methods in System Design, Vol. 25, Iss. 1, 2004-07 ,pp. : 39-65

Springer Publishing Company

Access to resources Recommend Favorite

On the Verification of Cryptographic Protocols - A Tale of Two Committees

By Gollmann D.  

Electronic Notes in Theoretical Computer Science, Vol. 32, Iss. 1, 2004-01 ,pp. : 1-17

Elsevier

Access to resources Recommend Favorite

A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems

By Cortier Véronique   Kremer Steve   Warinschi Bogdan  

Journal of Automated Reasoning, Vol. 46, Iss. 3-4, 2011-04 ,pp. : 225-259

Springer Publishing Company

Access to resources Recommend Favorite

Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations

By Bouajjani A.   Habermehl P.  

Theoretical Computer Science, Vol. 221, Iss. 1, 1999-06 ,pp. : 211-250

Elsevier

Access to resources Recommend Favorite

Deductive verification of cryptographic software

By Almeida José  

Innovations in Systems and Software Engineering, Vol. 6, Iss. 3, 2010-09 ,pp. : 203-218

Springer Publishing Company

Access to resources Recommend Favorite