Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Formal specification and analysis of zeroconf using uppaalS

Formal specification and analysis of zeroconf using uppaalS Formal Speci cation and Analysis of Zeroconf Using Uppaal JASPER BERENDSEN, BINIAM GEBREMICHAEL, and FRITS W. VAANDRAGER, Radboud University Nijmegen MIAOMIAO ZHANG, Tongji University The model checker Uppaal is used to formally model and analyze parts of Zeroconf, a protocol for dynamic con guration of IPv4 link-local addresses that has been de ned in RFC 3927 of the IETF. Our goal has been to construct a model that (a) is easy to understand by engineers, (b) comes as close as possible to the informal text (for each transition in the model there should be a corresponding piece of text in the RFC), and (c) may serve as a basis for formal veri cation. Our modeling efforts revealed several errors (or at least ambiguities) in the RFC that no one else spotted before. We present two proofs of the mutual exclusion property for Zeroconf (for an arbitrary number of hosts and IP addresses): a manual, operational proof, and a proof that combines model checking with the application of a new abstraction relation that is compositional with respect to committed locations. The model checking problem has been solved using Uppaal and the abstractions have been checked by hand. Categories and http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Embedded Computing Systems (TECS) Association for Computing Machinery

Formal specification and analysis of zeroconf using uppaalS

Download PDF
32 pages

Loading next page...
 
/lp/association-for-computing-machinery/formal-specification-and-analysis-of-zeroconf-using-uppaals-FGICArCylR

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 2011 by ACM Inc.
ISSN
1539-9087
DOI
10.1145/1952522.1952527
Publisher site
See Article on Publisher Site

Abstract

Formal Speci cation and Analysis of Zeroconf Using Uppaal JASPER BERENDSEN, BINIAM GEBREMICHAEL, and FRITS W. VAANDRAGER, Radboud University Nijmegen MIAOMIAO ZHANG, Tongji University The model checker Uppaal is used to formally model and analyze parts of Zeroconf, a protocol for dynamic con guration of IPv4 link-local addresses that has been de ned in RFC 3927 of the IETF. Our goal has been to construct a model that (a) is easy to understand by engineers, (b) comes as close as possible to the informal text (for each transition in the model there should be a corresponding piece of text in the RFC), and (c) may serve as a basis for formal veri cation. Our modeling efforts revealed several errors (or at least ambiguities) in the RFC that no one else spotted before. We present two proofs of the mutual exclusion property for Zeroconf (for an arbitrary number of hosts and IP addresses): a manual, operational proof, and a proof that combines model checking with the application of a new abstraction relation that is compositional with respect to committed locations. The model checking problem has been solved using Uppaal and the abstractions have been checked by hand. Categories and

Journal

ACM Transactions on Embedded Computing Systems (TECS) – Association for Computing Machinery

Published: Apr 1, 2011

There are no references for this article.