Showing Invariance Compositionally for a Process Algebra for Network Protocols - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Showing Invariance Compositionally for a Process Algebra for Network Protocols

Résumé

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.

Dates et versions

hal-01092348 , version 1 (08-12-2014)

Identifiants

Citer

Timothy Bourke, Robert J. van Glabbeek, Peter Höfner. Showing Invariance Compositionally for a Process Algebra for Network Protocols. ITP 2014: Interactive Theorem Proving, Jul 2014, Vienna, Austria. pp.16, ⟨10.1007/978-3-319-08970-6_10⟩. ⟨hal-01092348⟩
130 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More