Mechanizing a Process Algebra for Network Protocols

@article{Bourke2015MechanizingAP,
  title={Mechanizing a Process Algebra for Network Protocols},
  author={T. Bourke and R. V. Glabbeek and P. H{\"o}fner},
  journal={Journal of Automated Reasoning},
  year={2015},
  volume={56},
  pages={309-341}
}
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… Expand
Using Process Algebra to Design Better Protocols
TLDR
A combination of pen-and-paper analysis, model checking and interactive theorem proving has helped to perform a formal analysis of the Ad hoc On-Demand Vector (AODV) routing protocol. Expand
Formalising the Optimised Link State Routing Protocol
TLDR
This paper uses the timed process algebra T-AWN for modelling the Optimised Link State Routing protocol (OLSR) version 2.0, which aims to provide more precise and verifiable descriptions of protocols. Expand
Analysing AWN-Specifications Using mCRL2 (Extended Abstract)
TLDR
It is shown that the translation respects strong bisimilarity; hence all safety properties can be automatically checked using the toolset, and the sophisticated toolset of mCRL2 is now available for AWN-specifications. Expand
Split, Send, Reassemble: A Formal Specification of a CAN Bus Protocol Stack
We present a formal model for a fragmentation and a reassembly protocol running on top of the standardised CAN bus, which is widely used in automotive and aerospace applications. Although the CAN busExpand
Depletable channels: dynamics, behaviour, and efficiency in network design
TLDR
A characterization of those graphs, called weak, which admit charge assignments for which the minimum inhibiting flow is strictly less than the maximum flow are proposed and shown that weakness can be checked efficiently by providing an algorithm that does so in polynomial time. Expand
SDN Protocol Analysis with Process Algebra Method
TLDR
A formalization method with algebra to analysis SDN protocol is proposed that is self-contained and universal to any protocol analysis, and can formally analysis the detail ofSDN protocol to find the uncertain and shortcoming aspects. Expand
Culling Concurrency Theory : Reusable and trustworthy meta-theory, proof techniques and separation results
TLDR
As concurrent systems become ever more complex and ever more ubiquitous, the need to understand and verify them grows ever larger, and for this the need for formal modelling languages that are well-understood and able to verify their existence is growing. Expand
Secure mathematically-assured composition of control models
Abstract : The Secure Mathematically-Assured Composition of Control Models project (SMACCM) has developed new tools for building UAV software that is provably secure against many classes ofExpand

References

SHOWING 1-10 OF 48 REFERENCES
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.Expand
Mechanization of the Algebra for Wireless Networks (AWN)
  • T. Bourke
  • Computer Science
  • Arch. Formal Proofs
  • 2014
TLDR
This development mechanises the original operational semantics of AWN and introduces a variant 'open' operational semantics that enables the compositional statement and proof of invariants across distinct network nodes. Expand
Restricted Broadcast Process Theory
TLDR
A process algebra for modeling and reasoning about Mobile Ad hoc Networks (MANETs) and their protocols is presented, eliminating connectivity information from the specification of a network, and transferring its complexity to the semantics. Expand
A Process Calculus for Mobile Ad Hoc Networks
TLDR
The ω-calculus is presented, a process calculus for formally modeling and reasoning about Mobile Ad Hoc Wireless Networks (MANETs) and their protocols, and it is proved that the υ-Calculus is a conservative extension of the π- Calculus, and that late bisimulation is a congruence. Expand
An Observational Theory for Mobile Ad Hoc Networks (full version)
TLDR
This work proposes a process calculus to study the behavioural theory of Mobile Ad Hoc Networks and proves that the two semantics coincide, and uses the (bi)simulation proof method to formally prove a number of non-trivial properties of ad hoc networks. Expand
Process algebra needs proof methodology
TLDR
The main message is that in order to make process algebra the universal tool for the study of correct system behaviour much more of effective proof techniques need to be developed. Expand
A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing Protocol
TLDR
The mechanization of an existing pen-and-paper proof of loop freedom of AODV in the interactive theorem prover Isabelle/HOL is described, which relies on a novel compositional approach for lifting invariants to networks of nodes. Expand
A Calculus for Mobile Ad Hoc Networks
TLDR
A natural reduction semantics and a reduction congruence as well as a labeled transition semantics are defined and a weak contextual bisimulation is proved to be a sound and complete co-inductive characterization of the reductionCongruence. Expand
A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV
TLDR
A rigorous analysis of the Ad hoc On-Demand Distance Vector (AODV) protocol, a popular routing protocol designed for MANETs and WMNs, and one of the four protocols currently standardised by the IETF MANET working group is presented. Expand
A Full Formalisation of pi-Calculus Theory in the Calculus of Constructions
A formalisation of π-calculus in the Coq system is presented. Based on a de Bruijn notation for names, our implementation exploits the mechanisation of some proof techniques described by Sangiorgi inExpand
...
1
2
3
4
5
...