Formal Verification of the IEEE 802.1D Spanning Tree Protocol Using Extended Rebeca

Authors:
Hossein Hojjat;Hootan Nakhost;Marjan Sirjani
Affiliations:
Department of Electrical and Computer Engineering, University of Tehran, Tehran, Iran;Department of Electrical and Computer Engineering, University of Tehran, Tehran, Iran;Department of Electrical and Computer Engineering, University of Tehran, Tehran, Iran
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 14
Cited 1

Actors: a model of concurrent computation in distributed systems

Actors: a model of concurrent computation in distributed systems
Compositional model checking

Proceedings of the Fourth Annual Symposium on Logic in computer science
Completing the temporal picture

Selected papers of the 16th international colloquium on Automata, languages, and programming
Temporal verification of reactive systems: safety

Temporal verification of reactive systems: safety
An algorithm for distributed computation of a spanningtree in an extended LAN

SIGCOMM '85 Proceedings of the ninth symposium on Data communications
Leader Election in Asynchronous Distributed Systems

IEEE Transactions on Computers
Concurrency verification: introduction to compositional and noncompositional methods

Concurrency verification: introduction to compositional and noncompositional methods
A Timed Verification of the IEEE 1394 Leader Election Protocol

Formal Methods in System Design
Formal verification of standards for distance vector routing protocols

Journal of the ACM (JACM)
Verifying End-to-End Protocols using Induction with CSP/FDR

Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
A Front-End Tool for Automated Abstraction and Modular Verification of Actor-Based Models

ACSD '04 Proceedings of the Fourth International Conference on Application of Concurrency to System Design
Extended Rebeca: A Component-Based Actor Language with Synchronous Message Passing

ACSD '05 Proceedings of the Fifth International Conference on Application of Concurrency to System Design
Modeling and Verification of Reactive Systems using Rebeca

Fundamenta Informaticae
Model checking large network protocol implementations

NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1

Rebeca: theory, applications, and tools

FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects

Quantified Score

Hi-index	0.00

Visualization

Abstract

The STP (Spanning Tree Protocol) which is standardized as IEEE 802.1D has been used in many bridges and switches of networks. This algorithm tries to eliminate loops in bridged networks. In this study the correctness of STP algorithm is formally verified using Extended Rebeca. In order to not to be confined to a specific case or set of cases we used a compositional verification approach. This allows us to gain generality in verifying the algorithm. The clarity and convenience in model checking by means of Extended Rebeca suggests that this language can be used for verifying more network protocols in future.