Showing Invariance Compositionally for a Process Algebra for Network Protocols

DOI10.1007/978-3-319-08970-6_10zbMath1416.68153arXiv1407.3519OpenAlexW85190413MaRDI QIDQ2879249

Peter Höfner, Timothy Bourke, Robert J. van Glabbeek

Publication date: 8 September 2014

Published in: Interactive Theorem Proving (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.3519

Mathematics Subject Classification ID

Related Items (2)

Mechanizing a process algebra for network protocols ⋮ Modelling and verifying the AODV routing protocol

Uses Software

• Isabelle
• Isabelle/HOL
• TPTP
• HOL
• Isabelle/jEdit
• Isabelle/Circus
• AWN

This page was built for publication: Showing Invariance Compositionally for a Process Algebra for Network Protocols