Author:
Comon Hubert,Cortier Véronique
Subject
General Computer Science,Theoretical Computer Science
Reference28 articles.
1. A calculus for cryptographic protocols;Abadi;Inform. Comput.,1999
2. Introduction to set constraint-based program analysis;Aiken;Sci. Comput. Program.,1999
3. R. Amadio, D. Lugiez, On the reachability problem in cryptographic protocols, in Proc. CONCUR’00, Lecture Notes in Computer Science, Vol. 1877, 2000.
4. B. Bogaert, S. Tison, Equality and disequality constraints on brother terms in tree automata, in: A. Finkel (Ed.), Porc. 9th Symp. on Theoretical Aspects of Computer Science, Cachan, France, 1992.
5. A meta-notation for protocol analysis;Cervesato,1999
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献