ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Electronic Notes in Theoretical Computer Science
Volume 159, 24 May 2006, Pages 139-154
Proceedings of the First IPM International Workshop on Foundations of Software Engineering (FSEN 2005)
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (275 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.entcs.2005.12.066    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2006 Elsevier B.V. All rights reserved.

Formal Verification of the IEEE 802.1D Spanning Tree Protocol Using Extended View the MathML sourceebeca

Hossein Hojjata, E-mail The Corresponding Author, Hootan Nakhostb, E-mail The Corresponding Author and Marjan Sirjanic, E-mail The Corresponding Author

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

Available online 18 May 2006.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

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 View the MathML sourceebeca. 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 View the MathML sourceebeca suggests that this language can be used for verifying more network protocols in future.

Keywords: View the MathML sourceebeca; Spanning Tree Protocol (STP); IEEE 802.1D; formal verification; compositional verification


Electronic Notes in Theoretical Computer Science
Volume 159, 24 May 2006, Pages 139-154
Proceedings of the First IPM International Workshop on Foundations of Software Engineering (FSEN 2005)
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.