Author:
Rosa-Velardo Fernando,Martos-Salgado María
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference47 articles.
1. I. Cervesato, N.A. Durgin, P. Lincoln, J.C. Mitchell, A. Scedrov, A meta-notation for protocol analysis, in: CSFW, 1999, pp. 55–69.
2. A calculus for cryptographic protocols: The spi calculus;Abadi;Inf. Comput.,1999
3. Notes on nominal calculi for security and mobility;Gordon,2000
4. Typed msr: Syntax and examples;Cervesato,2001
5. An overview of msr(c): A clp-based framework for the symbolic verification of parameterized concurrent systems;Delzanno;Electr. Notes Theor. Comput. Sci.,2002
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. FORWARD ANALYSIS FOR WSTS, PART III: KARP-MILLER TREES;LOG METH COMPUT SCI;2020
2. Ordinal recursive complexity of Unordered Data Nets;Information and Computation;2017-06
3. The Complexity of Coverability in ν-Petri Nets;Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science;2016-07-05
4. The complexity of reachability in vector addition systems;ACM SIGLOG News;2016-02-17
5. Bounds on Mobility;CONCUR 2014 – Concurrency Theory;2014