Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols

Electronic Notes in Theoretical Computer Science

Volumn 117, Issue SPEC. ISS., 2005, Pages 153-182

  Meseguer, José ^a   Thati, Prasanna ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Narrowing; Reachability; Rewriting logic; Security protocols

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL METHODS; LOGIC PROGRAMMING; NETWORK PROTOCOLS; PROBLEM SOLVING; SECURITY OF DATA;

NARROWING; REACHABILITY PROBLEMS; REWRITING LOGIC; SECURITY PROTOCOLS;

CRYPTOGRAPHY;

EID: 12344293529     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2004.06.024     Document Type: Conference Paper

References (42)

1. th International conference on concurrency theory (CONCUR '00) Lecture Notes in Computer Science volume 1877 2000 Springer 380 394
2. David Basin, Sebastian Modersheim, and Luca Vigano. Constraint differentiation: A new reduction technique for constraint-based analysis of security protocols. Technical Report TR-405, Swiss Federal Insititute of Technology, Zurich, May 2003
3. rd International Workshop on Conditional Term Rewrite systems Lecture Notes in Computer Science volume 656 1992 Springer 483 497
4. Ahmed Bouajjani and Richard Mayr. Model checking lossy vector addition systems. In STACS, pages 323-333, 1999
5. O. Burkart, D. Caucal, F. Moller, and B. Steffen Verification over Infinite States Handbook of Process Algebra 2001 Elsevier Publishing 545 623
6. K.M. Chandy, and J. Misra Parallel programming design - A foundation 1988 Addison Wesley Publishing Company
7. rd Conference on Foundations Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, 2003. to appear
8. th Annual IEEE Symposium on Logic in Computer Science (LICS '03), 2003
9. E.M. Clarke, O. Grumberg, and D.A. Peled Model Checking 1999 MIT Press
10. Edmund M. Clarke, Orna Grumberg, and David E. Long Model checking and abstraction ACM Transactions on Programming Languages and Systems 16 5 September 1994 1512 1542
11. th Annual IEEE Symposium on Logic in Computer Science (LICS '03), pages 271-280, 2003
12. Grit Denker, José Meseguer, and Carolyn L. Talcott Protocol specification and analysis in Maude N. Heintze J. Wing Proceedings of Workshop on Formal Methods and Security Protocols June 25, 1998, Indianapolis, Indiana 1998 http://www.cs.bell-labs.com/who/nch/fmsp/index.html
13. D. Dolev, and A. Yao On the security of public key protocols IEEE Transaction on Information Theory 29 2 1983 198 208
14. N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. Undecidability of bounded security protocols. In Workshop on formal methods and security protocols, 1999. FLOC
15. A. Emerson and K. Namjoshi. On model checking for nondeterministic infinite state systems. In IEEE Symposium on Logic in Computer Science, 1998
16. th Conference on Automated Deduction Lecture Notes in Computer Science volume 87 1979 Springer 161 167
17. Alain Finkel, and Ph. Schnoebelen Well-structured transition systems everywhere! Theoretical Computer Science 256 1 2001 63 92
18. th International Conference on Logic for Programming Lecture Notes in Computer Science volume 2250 2001
19. Susanne Graf, and Hassen Saidi Construction of abstract state graphs with PVS Orna Grumberg Computer Aided Verification. 9th International Conference, Proceedings CAV'97, Haifa, Israel, June 22-25, 1997 Lecture Notes in Computer Science volume 1254 1997 Springer-Verlag 72 83
20. A. Huima. Efficient infinite state analysis of security protocols. In Workshop on formal methods and security protocols, 1999. FLOC
21. th Conference on Automated Deduction of Lecture Notes in Computer Science volume 87 1980 Springer 318 334
22. Florent Jacquemard, Michaël Rusinowitch, and Laurent Vigneron. Compiling and verifying security protocols. In Logic Programming and Automated Reasoning, pages 131-160, 2000
23. th International Colloquium on Automata, Languages and Programming Lecture Notes in Computer Science volume 154 1983 Springer 361 373
24. Y. Kaji, T. Fujiwara, and T. Kasami Solving a unification problem under constrained substitutions using tree automata Journal of Symbolic Computation 23 1 1997 79 118
25. Yonit Kesten, and Amir Pnueli Control and data abstraction: The cornerstones of practical formal verification International Journal on Software Tools for Technology Transfer 4 2 2000 328 342
26. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem Property preserving abstractions for the verification of concurrent systems Formal Methods in System Design 6 1995 1 36
27. G. Lowe Breaking and fixing the Needham-Schroeder public-key protocol using fdr Tools and algorithms for construction and analysis of systems (TACAS '96) Lecture Notes in Computer Science volume 1055 1996 Springer 147 166
28. Zohar Manna, and Amir Pnueli Completing the temporal picture Theoretical Computer Science 83 1991 97 130
29. Catherine Meadows The NRL protocol analyzer: An overview Journal of logic programming 26 2 1996 113 131
30. José Meseguer Conditional rewriting logic as a unified model of concurrency Theoretical Computer Science 96 1 1992 73 155
31. José Meseguer Membership algebra as a logical framework for equational specification F. Parisi-Presicce Proc. WADT'97 LNCS 1376 1998 Springer 18 61
32. th European Conference on Object-Oriented Programming Lecture Notes in Computer Science volume 2374 2002 Springer 1 36
33. th ACM Conference on Computer and Communications Security (CCS '01), pages 166-175, 2001
34. th IEEE Computer Security Foundations Workshop (CSFW-16), pages 47-61, 2003
35. th International Conference on Rewriting Techniques and Applications Lecture notes in computer science volume 2706 2003 Springer Verlag 483 498
36. S. Owre, N. Shankar, J. Rushby, and D. Stringer-Calvert PVS system guide, PVS language reference, and PVS prover guide version 2.4 2001 Computer Science Laboratory, SRI International
37. Larry Paulson Isabelle: A Generic Theorem Prover Lecture Notes in Computer Science volume 828 1994 Springer Verlag
38. th IEEE Computer Security Foundations Workshop, pages 174-190, 2001
39. P. Ryan, and S. Schneider An attack on a recursive authentication protocol Information Processing Letters 65 1998
40. Hassen Saïdi, and Natarajan Shankar Abstract and model check while you prove Nicolas Halbwachs Doron Peled Computer Aided Verification. 11th International Conference, Proceedings CAV'99, Trento, Italy, July 6-10, 1999 Lecture Notes in Computer Science volume 1633 1999 Springer-Verlag 443 454
41. Mark-Oliver Stehr, José Meseguer, and Peter Csaba Ölveczky Rewriting logic as a unifying framework for Petri nets H. Ehrig G. Juhas J. Padberg G. Rozenberg Unifying Petri Nets Lecture Notes in Computer Science 2001 Springer-Verlag
42. P. Viry Rewriting: An effective model of concurrency C. Halatsis D. Maritsas G. Philokyprou S. Theodoridis PARLE'94 Parallel Architectures and Languages Europe, 6th International PARLE Conference, Proceedings Athens, Greece, July 4-8, 1994 Lecture Notes in Computer Science volume 817 1994 Springer-Verlag 648 660