Showing Invariance Compositionally for a Process Algebra for Network Protocols
This paper presents the mechanization of a process algebra for Mobile Ad hoc Networks and Wireless Mesh Networks, and the development of a compositional framework for proving invariant properties. Mechanizing the core process algebra in Isabelle/HOL is relatively standard, but its layered structure necessitates special treatment. The control states of reactive processes, such as nodes in a network, are modelled by terms of the process algebra. We propose a technique based on these terms to streamline proofs of inductive invariance. This is not sufficient, however, to state and prove invariants that relate states across multiple processes (entire networks). To this end, we propose a novel compositional technique for lifting global invariants stated at the level of individual nodes to networks of nodes.
KeywordsOpen Invariant Sequential Process Wireless Mesh Network Process Algebra Control Term
Unable to display preview. Download preview PDF.
- 3.Bourke, T.: Mechanization of the Algebra for Wireless Networks (AWN). In: Archive of Formal Proofs (2014), http://afp.sf.net/entries/AWN.shtml
- 4.Bourke, T., van Glabbeek, R.J., Höfner, P.: A mechanized proof of loop freedom of the (untimed) AODV routing protocol. See authors’ webpages (2014)Google Scholar
- 6.Fehnker, A., van Glabbeek, R.J., Höfner, P., McIver, A., Portmann, M., Tan, W.L.: A process algebra for wireless mesh networks used for modelling, verifying and analysing AODV. Technical Report 5513, NICTA (2013), http://arxiv.org/abs/1312.7645
- 8.Fokkink, W., Groote, J.F., Reniers, M.: Process algebra needs proof methodology. EATCS Bulletin 82, 109–125 (2004)Google Scholar
- 13.Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer (1995)Google Scholar
- 14.Müller, O.: A Verification Environment for I/O Automata Based on Formalized Meta-Theory. PhD thesis, TU München (1998)Google Scholar
- 16.Paulson, L.C.: The inductive approach to verifying cryptographic protocols. J. Computer Security 6(1-2), 85–128 (1998)Google Scholar
- 17.Perkins, C.E., Belding-Royer, E.M., Das, S.R.: Ad hoc on-demand distance vector (AODV) routing. RFC 3561 (Experimental), Network Working Group (2003)Google Scholar
- 18.de Roever, W.-P., de Boer, F., Hannemann, U., Hooman, J., Lakhnech, Y., Poel, M., Zwiers, J.: Concurrency Verification: Introduction to Compositional and Noncompositional Methods. Cambridge Tracts in Theor. Comp. Sci., vol. 54. CUP (2001)Google Scholar