A Symbolic Logic with Exact Bounds for Cryptographic Protocols

John C. Mitchell. A Symbolic Logic with Exact Bounds for Cryptographic Protocols. In Lev D. Beklemishev, Ruy de Queiroz, editors, Logic, Language, Information and Computation - 18th International Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18-20, 2011. Proceedings. Volume 6642 of Lecture Notes in Computer Science, pages 3, Springer, 2011. [doi]

@inproceedings{Mitchell11,
  title = {A Symbolic Logic with Exact Bounds for Cryptographic Protocols},
  author = {John C. Mitchell},
  year = {2011},
  doi = {10.1007/978-3-642-20920-8_3},
  url = {http://dx.doi.org/10.1007/978-3-642-20920-8_3},
  tags = {protocol, C++, logic},
  researchr = {https://researchr.org/publication/Mitchell11},
  cites = {0},
  citedby = {0},
  pages = {3},
  booktitle = {Logic, Language, Information and Computation - 18th International Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18-20, 2011. Proceedings},
  editor = {Lev D. Beklemishev and Ruy de Queiroz},
  volume = {6642},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-20919-2},
}