Ralf Küsters. On the Decidability of Cryptographic Protocols with Open-Ended Data Structures. In Lubos Brim, Petr Jancar, Mojmír Kretínský, Antonín Kucera, editors, CONCUR 2002 - Concurrency Theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002, Proceedings. Volume 2421 of Lecture Notes in Computer Science, pages 515-530, Springer, 2002. [doi]
@inproceedings{Kusters02,
title = {On the Decidability of Cryptographic Protocols with Open-Ended Data Structures},
author = {Ralf Küsters},
year = {2002},
url = {http://link.springer.de/link/service/series/0558/bibs/2421/24210515.htm},
tags = {protocol, data-flow, source-to-source, open-source},
researchr = {https://researchr.org/publication/Kusters02},
cites = {0},
citedby = {0},
pages = {515-530},
booktitle = {CONCUR 2002 - Concurrency Theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002, Proceedings},
editor = {Lubos Brim and Petr Jancar and Mojmír Kretínský and Antonín Kucera},
volume = {2421},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-44043-7},
}