Mechanizing a Process Algebra for Network Protocols

TL;DR

This paper introduces a mechanized process algebra framework in Isabelle/HOL for modeling and verifying invariants in network protocols like MANETs and wireless mesh networks, with novel compositional techniques for network-wide properties.

Contribution

It develops a layered, mechanized process algebra in Isabelle/HOL and introduces a new compositional method to lift node invariants to entire networks.

Findings

Streamlined proof technique for inductive invariance.

Novel compositional method for network invariants.

Mechanization of process algebra in Isabelle/HOL.

Abstract

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.