A Calculus for Mobile Ad Hoc Networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4467 LNCS, Issue , 2007, Pages 132-150

  Godskesen, Jens Chr ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCASTING; CRYPTOGRAPHY; ELECTRIC NETWORK TOPOLOGY; MESSAGE PASSING; MOBILE DEVICES; ROUTING PROTOCOLS; SEMANTICS;

CRYPTOGRAPHIC ROUTING PROTOCOL; MOBILE AD HOC NETWORKS; REDUCTION CONGRUENCE;

AD HOC NETWORKS;

EID: 37149042964     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72794-1_8     Document Type: Conference Paper

References (18)

1. Abadi, M., Blanchet, B.: Analyzing Security Protocols with Secrecy Types and Logic Programs. Journal of the ACM 52(1), 102-146 (January 2005)
2. Abadi, M., Fournet, C.: Mobile vales, new names, and secure communication. In: Nielson, H.R. (ed.) 28th ACM Symposium on Principles of Programming Languages, London, UK, pp. 104-115. ACM Press, New York (2001)
3. Cardelli, L., Gordon, A.D.: Mobile ambients. In: Nivat, M. (ed.) ETAPS 1998 and FOSSACS 1998. LNCS, vol. 1378, Springer, Heidelberg (1998)
4. Castagna, G., Vitek, J., Nardelli, F.Z.: The seal calculus. Information and Computation 201(1), 1-51 (2005)
5. Ene, C., Muntean, T.: A broadcast-based calculus for communicating systems. In: 6th International Workshop on formal Methods for Parallel Programming: Theory and Applications, San Francisco (2001)
6. Godskesen, J.Chr.: Formal verification of the ARAN protocol using the applied π-calculus. In: Proceedings of Sixth International IFIP WG 1.7 Workshop on Issuses in the Theory of Security, (WITS), pp. 99-113, Vienna, Austria (March 2006)
7. Godskesen, J.Chr., Hildebrandt, T.: Extending Howe's method to early bisimulations for typed mobile embedded resources with local names. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 140-151. Springer, Heidelberg (December 2005)
8. Merro, M.: An observational theory for mobile ad hoc networks. Electron. Notes Theor. Comput. Sci. 173, 275-293 (2007)
9. Mezzetti, N., Sangiorgi, D.: Towards a calculus for wireless systems. Electr. Notes Theor. Comput. Sci. 158, 331-353 (2006)
10. Milner, R.: Functions as processes. In: Proceedings of the seventeenth international colloquium on Automata, languages and programming, New York, NY, USA, pp. 167-180. Springer, Heidelberg (1990)
11. Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, part I/II. Journal of Information and Computation 100, 1-77 (September 1992)
12. Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Proceedings ICALP '92, vol. 623, pp. 685-695. Springer-Verlag, Heidelberg (1992)
13. Nanz, S., Hankin, C.: A framework for security analysis of mobile wireless networks. Theor. Comput. Sci. 367(1), 203-227 (2006)
14. De Nicola, R., Gorla, D., Pugliese, R.: Basic observables for a calculus for global computing. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1226-1238. Springer, Heidelberg (2005)
15. Ostrovsky, K., Prasad, K.V.S., Taha, W.: Towards a primitive higher order calculus of broadcasting systems. In: PPDP '02: Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming, pp. 2-13. ACM Press, New York (2002)
16. Prasad, K.V.S.: A calculus of broadcasting systems. Sci. Comput. Program 25(2-3), 285-327 (1995)
17. Riely, J., Hennessy, M.: A typed language for distributed mobile processes (extended abstract). In: Conference Record of POPL '98: The 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Diego, California, pp. 378-390 (1998)
18. Sanzgiri, K., LaFlamme, D., Dahill, B., Levine, B.N., Shields, C., Belding-Royer, E.M.: Authenticated routing for ad hoc networks. IEEE Journal on Selected Areas in Communication, special issue on Wireless Ad. hoc Networks 23(3), 598-610 (March 2005)