Verification of Correspondence Assertions in a Calculus for Mobile Ad Hoc Networks
DOI10.1016/j.entcs.2009.06.030zbMath1347.68028MaRDI 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
mobile ad hoc networks; mobility; broadcast communication; MANET; type and effect systems; process calculus theory
94A60: Cryptography
68Q55: Semantics in the theory of computing
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68M14: Distributed systems
68M12: Network protocols
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