Plan in Maude specifying an active network programming language

Electronic Notes in Theoretical Computer Science

Volumn 71, Issue , 2004, Pages 240-260

  Stehr, Mark Oliver ^a   Talcott, Carolyn L ^b  

^a UNIVERSITY OF HAMBURG   (Germany)

^b SRI INTERNATIONAL   (United States)

Author keywords

CINNI calculus; Executable specification; Formal analysis; Maude; PLAN

Indexed keywords

ACTIVE NETWORKS; CODES (SYMBOLS); COMPUTER SOFTWARE; FORMAL LOGIC; MATHEMATICAL MODELS; OBJECT ORIENTED PROGRAMMING; SEMANTICS; SPECIFICATIONS;

CINNI CALCULUS; COMPUTER PROGRAMMING LANGUAGE - PLAN; EXECUTABLE SPECIFICATION; FORMAL ANALYSIS; MAUDE;

COMPUTER PROGRAMMING LANGUAGES;

EID: 19044377295     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)82538-1     Document Type: Conference Paper

References (32)

1. Agha G., Mason A., Smith I.F., Talcott S.C.L. A foundation for actor computation. Journal of Functional Programming. 7:1997;1-72
2. Clavel M., Durán F., Eker S., Lincoln P., Martí-Oliet N., Meseguer J., Quesada J. Maude: Specification and Programming in Rewriting Logic. January 1999;SRI International. http://maude.csl.sri.com.
3. DARPA Information and Survivability Conference and Exposition (DISCEX′00). IEEE, January 2000.
4. DARPA Active Networks Conference and Exposition (DANCE). IEEE, May 2002.
5. Denker G., Meseguer J., Talcott C.L. Formal specification and analysis of active networks and communication protocols: The Maude experience. DARPA Information and Survivability Conference and Exposition (DISCEX′00). January 2000;251-265 IEEE
6. S. Eker. Maude 2.0 alpha release notes, 2002.
7. Eker S., Meseguer J., Sridharanarayanan A. The Maude LTL model checker. Gadducci F., Montanari U. The 4th International Workshop on Rewriting Logic and its Applications, Pisa, Italy, September 19-21, 2002, Proceedings, volume 71 of Electronic Notes in Theoretical Computer Science. 2002;Elsevier. http://www.elsevier.nl/locate/entcs/volume71.html.
8. Felleisen M., Friedman D.P. Control operators, the SECD-machine, and the λ-calculus. Wirsing M. Formal Description of Programming Concepts III. 1986;193-217 North-Holland
9. Felleisen M., Hieb R. The revised report on the syntactic theories of sequential control and state. Theoretical Computer Science. 103:1992;235-271
10. C. A. Gunther et al. A packet language for active networks. http://www.cis.upenn.edu/~switchware/PLAN/.
11. C.A. Gunther et al. The switchware project. http://www.cis.upenn.edu/ ~switchware/.
12. M. Hicks, P. Kakkar, J. T. Moore, C. A. Gunter, and S. Nettles. Network programming using PLAN. In Proceedings of the 1998 Workshop on Internet Programming Languages (IPL′98), Part of IEEE International Conference on Computer Languages (ICCL ′98), Chicago, IL, May 1998, May 1998. http://www.cis.upenn.edu/~switchware/papers/progplan.ps.
13. M. Hicks, P. Kakkar, J. T. Moore, C. A. Gunter, and S. Nettles. PLAN: A Packet Language for Active Networks. In Proceedings of the 1998 ACM SIGPLAN International Conference on Functional Programming, Baltimore, Maryland, September 1998, pages 86-93. ACM, 1998. http://www.cis.upenn.edu/~switchware/ papers/plan.ps.
14. Hicks M., Keromytis A.D. A secure PLAN. Covaci S. Active Networks, First International Working Conference, IWAN ′99, Berlin, Germany, June 30 - July 2, 1999, Proceedings, volume 1653 of Lecture Notes in Computer Science. June 1999;307-314 Springer-Verlag. http://www.cis.upenn.edu/~switchware/papers/ iwan99.ps. Extendedq 1 version at http://www.cis.upenn.edu/~switchware/papers/ secureplan.ps.
15. M. Hicks, J. T. Moore, and P. Kakkar. Plan programmers guide for plan version 3.2. http://www.cis.upenn.edu/~switchware/PLAN/docs-ocaml/guide.ps, July 2001.
16. Honsell F., Mason I.A., Smith S.F., Talcott C.L. A Variable Typed Logic of Effects. Information and Computation. 119:(1):1995;55-90
17. P. Kakkar. The specification of PLAN. http://www.cis.upenn.edu/ ~switchware/PLAN/spec/spec.ps, 1999.
18. P. Kakkar, C. A. Gunther, and M. Abadi. Reasoning About Secrecy for Active Networks. In 13th IEEE Computer Security Foundations Workshop (CSFW′00), 3-5 July 2000, Cambridge, England, Proceedings, 2000. http://www.cis.upenn.edu/~switchware/papers/csfw.ps.
19. Kakkar P., Hicks M., Moore J.T., Gunter C.A. Specifying the PLAN networking programming language. HOOTS′99, Higher Order Operational Techniques in Semantics Paris, France, September 30 and October 1, 1999, Proceedings, volume 26 of Electronic Notes in Theoretical Computer Science. 1999;Elsevier. http://www.elsevier.nl/locate/entcs/volume26.html.
20. Mason I.A., Talcott C.L. Programming, transforming, and proving with function abstractions and memories. Proceedings of the 16th EATCS Colloquium on Automata, Languages, and Programming, Stresa, volume 372 of Lecture Notes in Computer Science. 1989;574-588 Springer-Verlag
21. Mason I.A., Talcott C.L. Actor languages: Their syntax, semantics, translation, and equivalence. Theoretical Computer Science. 220:1999;409-467
22. Mason I.A., Talcott C.L. Feferman-Landin Logic. Sieg W., Sommer R., Talcott C.L. Reflections on the Foundations of Mathematics: Essays in honor of Solomon Feferman, Lecture Notes in Logic. 2002;299-344 Association of Symbolic Logic
23. Meseguer J. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science. 96:1992;73-155
24. Meseguer J., Ölveczky P.C., Stehr M.-O., Talcott C.L. Maude as a wide-spectrum framework for formal modeling and analysis of active networks. DARPA Active Networks Conference and Exposition (DANCE). May 2002;494-510 IEEE
25. Moore J.T., Hicks M., Nettles S.M. Chunks in PLAN: Language support for programs as packets. Technical report. April 1999;Department of Computer and Information Science, University of Pennsylvania. http://www.cis.upenn.edu/ ~switchware/papers/planchunks.ps.
26. Sabry A., Felleisen M. Reasoning about programs in continuation-passing style. Lisp and Symbolic Computation. 6:(3/4):1993;287-358
27. S.F. Smith, C.L. Talcott. Specification diagrams for actor systems. Higer-Order and Symbolic Computation, 2002. To appear.
28. Stehr M.-O. CINNI - A Generic Calculus of Explicit Substitutions and its Application to λ-, σ- and π-calculi. Futatsugi K. The 3rd International Workshop on Rewriting Logic and its Applications Kanazawa City Cultural Hall, Kanzawa Japan, September 18-20, 2000, Proceedings, volume 36 of Electronic Notes in Theoretical Computer Science. 2000;71-92 Elsevier. http://www.elsevier.nl/locate/entcs/volume36.html.
29. M.-O. Stehr. Programming, specification, and interactive theorem proving: Towards a unified language based on equational logic, rewriting logic and type theory. Ph.D. thesis, forthcoming, 2002.
30. Talcott C.L. Reasoning about functions with effects. Higher Order Operational Techniques in Semantics. 1996;Cambridge University Press. http://www-formal.stanford.edu/MT/96hoots.ps.Z.
31. Tennenhouse D.L., Smith J.M., Sincoskie W.D., Wetherall D.J., Minden G.J. A survey of active network research. IEEE Communications Magazine. 35:(1):January 1997;80-86
32. Xiao Y., Sabry A., Ariola Z. From syntactic theories to interpreters: Automating the proof of unique decomposition. Higher-Order and Symbolic Computation. 14:(4):2001;387-409