Verification of Correspondence Assertions in a Calculus for Mobile Ad Hoc Networks

DOI10.1016/j.entcs.2009.06.030zbMath1347.68028OpenAlexW2135168699MaRDI QIDQ5179206

Jens Chr. Godskesen, Hans Hüttel, Morten Kühnrich

Publication date: 19 March 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.06.030

zbMATH Keywords

mobile ad hoc networksmobilitybroadcast communicationMANETtype and effect systemsprocess calculus theory

Mathematics Subject Classification ID

Cryptography (94A60) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14) Network protocols (68M12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A framework for security analysis of mobile wireless networks
• A process calculus for mobile ad hoc networks
• A calculus for cryptographic protocols: The spi calculus
• Typing correspondence assertions for communication protocols
• A Distributed Pi-Calculus
• Type-Based Verification of Correspondence Assertions for Communication Protocols
• A Calculus for Mobile Ad Hoc Networks
• On the security of public key protocols
• Mobile values, new names, and secure communication
• An Observational Theory for Mobile Ad Hoc Networks
• A Prospectus for Mobile Broadcasting Systems
• Programming Languages and Systems

This page was built for publication: Verification of Correspondence Assertions in a Calculus for Mobile Ad Hoc Networks