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

José Meseguer, Prasanna Thati. Symbolic Reachability Analysis Using Narrowing and its Application to Verification of Cryptographic Protocols. Electronic Notes in Theoretical Computer Science, 117:153-182, 2005. [doi]

@article{MeseguerT05,
  title = {Symbolic Reachability Analysis Using Narrowing and its Application to Verification of Cryptographic Protocols},
  author = {José Meseguer and Prasanna Thati},
  year = {2005},
  doi = {10.1016/j.entcs.2004.06.024},
  url = {http://dx.doi.org/10.1016/j.entcs.2004.06.024},
  tags = {protocol, analysis},
  researchr = {https://researchr.org/publication/MeseguerT05},
  cites = {0},
  citedby = {0},
  journal = {Electronic Notes in Theoretical Computer Science},
  volume = {117},
  pages = {153-182},
}