Rewriting for Cryptographic Protocol Verification-Reference-Cited by-同舟云学术

Rewriting for Cryptographic Protocol Verification

Published:2000 Issue: Volume: Page:271-290
ISSN:0302-9743
Container-title:Automated Deduction - CADE-17
language:
Short-container-title:

Author:

Genet Thomas,Klay Francis

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/10721959_21

Reference22 articles.

1. Lecture Notes in Computer Science;D. Bolignano,1997

2. Borovanský, P., Kirchner, C., Kirchner, H., Moreau, P.-E., Vittek, M.: ELAN: A logical framework based on computational systems. In: Proc. 1st WRLA. ENTCS, vol. 4, Asilomar, California (1996)

3. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997), http://l3ux02.univ-lille3.fr/tata/

4. Lecture Notes in Computer Science;J. Coquidé,1991

5. Dauchet, M., Tison, S.: The theory of ground rewrite systems is decidable. In: Proc. 5th LICS Symp., Philadelphia (Pa., USA), pp. 242–248 (June 1990)

Cited by 49 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. SAT-Based Automated Completion for Reachability Analysis;Lecture Notes in Computer Science;2024

2. Security Verification of Instant Messaging Cryptographic Protocols;Communications in Computer and Information Science;2023

3. Scalable, password-based and threshold authentication for smart homes;International Journal of Information Security;2022-02-07

4. Practical Approach in Verification of Security Systems Using Satisfiability Modulo Theories;Logic Journal of the IGPL;2020-11-02

5. Efficient Verification of Security Protocols Time Properties Using SMT Solvers;Advances in Intelligent Systems and Computing;2019-04-28