On the Reachability Problem in Cryptographic Protocols

Roberto M. Amadio, Denis Lugiez. On the Reachability Problem in Cryptographic Protocols. In Catuscia Palamidessi, editor, CONCUR 2000 - Concurrency Theory, 11th International Conference, University Park, PA, USA, August 22-25, 2000, Proceedings. Volume 1877 of Lecture Notes in Computer Science, pages 380-394, Springer, 2000. [doi]

@inproceedings{AmadioL00,
  title = {On the Reachability Problem in Cryptographic Protocols},
  author = {Roberto M. Amadio and Denis Lugiez},
  year = {2000},
  url = {http://link.springer.de/link/service/series/0558/bibs/1877/18770380.htm},
  tags = {protocol},
  researchr = {https://researchr.org/publication/AmadioL00},
  cites = {0},
  citedby = {0},
  pages = {380-394},
  booktitle = {CONCUR 2000 - Concurrency Theory, 11th International Conference, University Park, PA, USA, August 22-25, 2000, Proceedings},
  editor = {Catuscia Palamidessi},
  volume = {1877},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-67897-2},
}