Showing invariance compositionally for a process algebra for network protocols

Select |




Print


Bourke, Timothy; van Glabbeek, Robert; Höfner, Peter

Bourke, Timothy; van Glabbeek, Robert; Höfner, Peter


2014-07-14


Conference Material


International Conference on Interactive Theorem Proving (ITP '14)


Vienna, Austria


44-59


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.


Springer


Isabelle/HOL, process algebra, reactive systems, invariance proofs, network protocols


http://www.cs.uwyo.edu/~ruben/itp-2014/


nicta:7863


Bourke, Timothy; van Glabbeek, Robert; Höfner, Peter. Showing invariance compositionally for a process algebra for network protocols. In: G. Klein and R. Gamboa Editor, editor/s. International Conference on Interactive Theorem Proving (ITP '14); Vienna, Austria. Springer; 2014-07-14. 44-59.



Loading citation data...

Citation counts
(Requires subscription to view)