Symbolic Reachability Analysis Using Narrowing and its Application to Verification of Cryptographic Protocols-Reference-Cited by-同舟云学术

Symbolic Reachability Analysis Using Narrowing and its Application to Verification of Cryptographic Protocols

Published:2005-01 Issue: Volume:117 Page:153-182
ISSN:1571-0661
Container-title:Electronic Notes in Theoretical Computer Science
language:en
Short-container-title:Electronic Notes in Theoretical Computer Science

Author:

Meseguer José,Thati Prasanna

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference42 articles.

1. On the reachability problem in cryptographic primitives;Amadio,2000

2. David Basin, Sebastian Modersheim, and Luca Vigano. Constraint differentiation: A new reduction technique for constraint-based analysis of security protocols. Technical Report TR-405, Swiss Federal Insititute of Technology, Zurich, May 2003

3. An optimal narrowing strategy for general canonical systems;Bockmayr,1992

4. Ahmed Bouajjani and Richard Mayr. Model checking lossy vector addition systems. In STACS, pages 323–333, 1999

5. Verification over Infinite States;Burkart,2001

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parallel Maude-NPA for Cryptographic Protocol Analysis;Rewriting Logic and Its Applications;2022

2. Static correction of Maude programs with assertions;Journal of Systems and Software;2019-07

3. A Finite Representation of the Narrowing Space;Logic-Based Program Synthesis and Transformation;2014

4. Rewriting logic bibliography by topic: 1990–2011;The Journal of Logic and Algebraic Programming;2012-10

5. Twenty years of rewriting logic;The Journal of Logic and Algebraic Programming;2012-10