Formal specification and analysis of active networks and communication protocols: The Maude experience

Proceedings - DARPA Information Survivability Conference and Exposition, DISCEX 2000

Volumn 1, Issue , 2000, Pages 251-265

  Denker, G ^a   Meseguer, J ^a   Talcott, C ^b  

^a SRI INTERNATIONAL   (United States)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACTIVE NETWORKS; FORMAL SPECIFICATION; MODEL CHECKING; MODELING LANGUAGES; NETWORK PROTOCOLS; SPECIFICATIONS;

CRITICAL COMPONENT; EXECUTABLE SPECIFICATIONS; EXPERIMENTS AND CASE STUDIES; FORMAL MODELING AND ANALYSIS; FORMAL SPECIFICATION AND ANALYSIS; MAUDE LANGUAGES; REWRITING LOGIC; SECURITY PROTOCOLS;

NETWORK SECURITY;

EID: 84961707449     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DISCEX.2000.825030     Document Type: Conference Paper

References (44)

1. G. Agha. Abstracting interaction patterns: A programming paradigm for open distribute systems. In H. Bowman and J. Derrick, editors, Formal Methods for Open Object-Based Distributed Systems (FMOODS'97), Volume 2, IFIP TC6 WG6.1 Intern. Workshop, 21-23 July, Canterbury, Kent, UK, pages 135-153. Chapman & Hall, 1997.
2. R. Allen and D. Garlan. Formalizing architectural connection. In Proceedings 16th International Conference on Software Engineering, 1994.
3. M. Astley. Customization and Composition of Distributed Objects: Policy Management in Distributed Software Architectures. PhD thesis, University of Illinois, Urbana-Champaign, 1999.
4. M. Clavel, F. Durán, S. Eker, and J. Meseguer. Building equational proving tools by reflection in rewriting logic. In Proc. of the CafeOBJ Symposium '98, Numazu, Japan. CafeOBJ Project, April 1998. http://maude.csl.sri.com.
5. M. Clavel, S. Eker, P. Lincoln, and J. Meseguer. Principles of Maude. In Meseguer [31], pages 65-89.
6. M. Clavel and J. Meseguer. Reflection and Strategies in Rewriting Logic. In Meseguer [31], pages 125-147.
7. Clavel, M. and Durán, F. and Eker, S. and Lincoln, P. and Martí-Oliet, N. and Meseguer, J. and Quesada, J. Maude: Specification and Programming in Rewriting Logic. SRI International, Computer Science Laboratory, Menlo Park, CA, January 1999. http://maude.csl.sri.com/manual/.
8. G. Denker. From Rewrite Theories to Temporal Logic Theories. In H. Kirchner and C. Kirchner, editors, 2nd Int. Workshop on Rewriting Logic and Its Applications (WRLA'98), Pont-A-Mousson, France, September 1-4, 1998. Elsevier Science B.V., Volume 15 of Electronic Notes in Theoretical Computer Science, http://www.elsevier.nl/locate/entcs/volume15.html, 1998.
9. G. Denker and H.-D. Ehrich. Specifying Distributed Information Systems: Fundamentals of an Object-Oriented Approach Using Distributed Temporal Logic. In H. Bowman and J. Derrick, editors, Formal Methods for Open Object-Based Distributed Systems (FMOODS'97), Volume 2, IFIP TC6 WG6.1 Intern. Workshop, 21-23 July, Canterbury, Kent, UK, pages 89-104. Chapman & Hall, 1997.
10. G. Denker, J. Meseguer, and C. Talcott. Protocol Specification and Analysis in Maude. In N. Heintze and J. Wing, editors, Proc. of Workshop on Formal Methods and Security Protocols, 25 June 1998, Indianapolis, Indiana, 1998. http://www.cs.bell-labs.com/who/nch/fmsp/index.html.
11. G. Denker, J. Meseguer, and C. Talcott. Rewriting Semantics of Distributed Meta Objects and Composable Communication Services, 1999. working draft.
12. G. Denker and J. Millen. CAPSL and CIL Language Design: A Common Authentication Protocol Specification Language and Its Intermediate Language. CSL Report SRI-CSL-99-02, Computer Science Laboratory, SRI International, Menlo Park, CA 94025, 1999. http://www.csl.sri.com/~denker/pub-99.html.
13. G. Denker and J. Millen. CAPSL Intermediate Language. In N. Heintze and E. Clarke, editors, Workshop on Formal Methods and Security Protocols (FMSP'99), July 5, 1999, Trento, Italy (part of FLOC'99), 1999. http://cm.bell-labs.com/cm/cs/who/nch/fmsp99/.
14. Denker, G. and Garcia-Luna-Aceves, J.J. and Meseguer, J. and Ölveczky, P. and Raju, J. and Smith, B. and Talcott, C. Specification and Analysis of a Reliable Broadcasting Protocol in Maude. In B. Hajek and R. Sreenivas, editors, Proc. 37th Allerton Conference on Communication, Control and Computation, 1999. url-http://www.comm.csl.uiuc.edu/allerton.
15. Denker, G. and Garcia-Luna-Aceves, J.J. and Meseguer, J. and Ölveczky, P. and Raju, J. and Smith, B. and Talcott, C. Specifying a Reliable Broadcasting Protocol in Maude. Internal report, Computer Science Laboratory, SRI International, Menlo Park, CA 94025, 1999. http://www.csl.sri.com/?denker/pub-99.html.
16. D. E. Denning and G. M. Sacco. Timestamps in Key Distribution Protocols. Communications of the ACM, 24(8):533-536, 1981.
17. C. H. C. Duarte. Proof-theoretic Foundations for the Design of Extensible Software Systems. PhD thesis, Imperial College, University of London, 1999.
18. H.-D. Ehrich, C. Caleiro, A. Sernadas, and G. Denker. Logics for Specifying Concurrent Information Systems. In J. Chomicki and G. Saake, editors, Logics for Databases and Information Systems, pages 167-198. Kluwer Academic Publishers, 1998.
19. M. Fay. First-order unification in an equational theory. In Proceedings of the 4th Workshop on Automated Deduction, pages 161-167, 1979.
20. J. J. García-Luna. Reliable Broadcasing in Computer Networks. Manuscript; University of California at Santa Cruz, Computer Science Department, January 1998.
21. J. W. Gray and J. D. McLean. Using Temporal Logic to Specify and Verify Cryptographic Protocols (Progress Report). In Proc. of the 8th IEEE Computer Security Foundations Workshop, pages 108-116. IEEE Computer Society Press, 1995.
22. M. Hicks, P. Kakkar, J. T. Moore, C. A. Gunter, and S. Nettles. PLAN: A Packet Language for Active Networks. In Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming Languages, pages 86-93. ACM, 1998.
23. C. Hoare. Communicating Sequential Processes. Prentice Hall International, 1985.
24. U. Lechner and C. Lengauer. Modal-μ-Maude - Specification and Properties of Concurrent Objects. In B. Freitag and C.B. Jones and C. Lengauer and H.-J. Schek, editor, Object Orientation with Parallelism and Persistence, pages 23-46. Kluwer, 1996.
25. G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In Proceedings of TACAS, volume 1055 of Lecture Notes in Computer Science, pages 147-166. Springer-Verlag, 1996.
26. C. A. Meadows. Formal Verification of Cryptographic Protocols: A Survey. In J. Pieprzyk and R. Savafi-Naini, editors, Advances in Cryptology - Asiacrypt '94, pages 133-150. Springer, 1995. LNCS 917.
27. C. A. Meadows. Analyzing the Needham-Schroeder Public Key Protocol: A Comparison of Two Approaches. In E. Bertino, H. Kurth, G. Martella, and E. Montolivo, editors, Proc. of European Symposium on Research in Computer Security (ESORICS'96), pages 351-364. Springer, 1996. LNCS 1146.
28. C. A. Meadows. Language Generation and Verification in the NRL Protocol Analyzer. In Proc. 9th Computer Security Foundations Workshop, pages 48-61. IEEE Computer Society Press, June 1996.
29. J. Meseguer. Conditional Rewriting Logic as a Unified Model of Concurrency. Theoretical Computer Science, 96(1):73-155, 1992.
30. J. Meseguer. A Logical Theory of Concurrent Objects and Its Realization in the Maude Language. In G. Agha, P. Wegner, and A. Yonezawa, editors, Research Directions in Concurrent Object-Oriented Programming, pages 314-390. The MIT Press, 1993.
31. J. Meseguer, editor. Rewriting Logic and Its Applications, First International Workshop, Asilomar Conference Center, Pacific Grove, CA, September 3-6, 1996. Elsevier Science B.V., Electronic Notes in Theoretical Computer Science, Volume 4, http://www.elsevier.nl/locate/entcs/volume4.html, 1996.
32. J. Meseguer. Rewriting logic as a semantic framework for concurrency: a progress report. In Proc. CONCUR'96, Pisa, August 1996, pages 331-372. Springer LNCS 1119, 1996.
33. J. Meseguer. Rewriting Logic as a Semantic Framework for Concurrency: A Progress Report. In U. Montanari and V. Sassone, editors, Proc. 7th Intern. Conf. on Concurrency Theory: CONCUR'96, Pisa, August 1996, pages 331-372, 1996. LNCS 1119.
34. R. Needham and M. Schroeder. Using encryption for authentication in large networks of computers. Communications of the ACM, 21(12):993-999, 1978.
35. L. Paulson. The inductive approach to verifying cryptographic protocols. Journal of Computer Security, 6(1):85-128, 1998.
36. J. Peleska. On a unified formal approach for the development of fault-tolerant and secure systems. In H. Rischel, editor, Nordic Seminar on Dependable Computing Systems, Lyngby, Denmark, August 1994. Technical University of Denmark, pages 69-80, 1994.
37. W. Roscoe. Theory and Practice of Concurrency. Prentice Hall, 1998.
38. J. Rushby. Critical system properties: Survey and taxonomy. Reliability Engineering and System Safety, 43(2):189-219, 1994.
39. J. Rushby. Combining system properties: A cautionary example and formal examination. Technical report, Computer Science Laboratory, SRI International, Menlo Park, CA, June 1995. Unpublished project report; available at http://www.csl.sri.com/?rushby/combined.html.
40. Syverson, P. and Meadows, C. A. A Logical Language for Specifying Cryptographic Protocol Requirements. In Proc. IEEE Computer Society Symp. on Research in Security and Privacy, Oakland, CA, pages 165-177, May 1993.
41. N. Venkatasubramanian. Resource Management in Open Distributed Systems with Applications to Multimedia. PhD thesis, University of Illinois, Urbana-Champaign, 1998.
42. N. Venkatasubramanian, G. Agha, and C. L. Talcott. Specifying composable services for qos-based distributed resource management, 1998. submitted.
43. Venkatasubramanian, N and Talcott, C. L. Reasoning about Meta Level Activities in Open Distributed Systems. In Principles of Distributed Computation. ACM, 1995.
44. B.-Y. Wang, J. Meseguer, and C. A. Gunter. Specification and formal analysis of a PLAN algorithm in Maude. Manuscript, September 1999.