Verification of a Leader Election Protocol: Formal Methods Applied to IEEE 1394
Formal Methods in System Design
Distributed Algorithms
Compositional Specification of Timed Systems (Extended Abstract)
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
The Compositional Specification of Timed Systems - A Tutorial
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Applying Formal Methods to a Protocol Standard and its Implementations
PDSE '98 Proceedings of the International Symposium on Software Engineering for Parallel and Distributed Systems
PRISM 2.0: A Tool for Probabilistic Model Checking
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Testing real-time embedded software using UPPAAL-TRON: an industrial case study
Proceedings of the 5th ACM international conference on Embedded software
Efficient on-the-fly algorithms for the analysis of timed games
CONCUR 2005 - Concurrency Theory
Specifying Urgency in Timed I/O Automata
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Analysis of the zeroconf protocol using UPPAAL
EMSOFT '06 Proceedings of the 6th ACM & IEEE International conference on Embedded software
Analysis of a biphase mark protocol with Uppaal and PVS
Formal Aspects of Computing
Zero Configuration Networking: The Definitive Guide
Zero Configuration Networking: The Definitive Guide
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Compositional Abstraction in Real-Time Model Checking
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Verification and improvement of the sliding window protocol
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
| Hi-index | 0.00 |
The model checker Uppaal is used to formally model and analyze parts of Zeroconf, a protocol for dynamic configuration of IPv4 link-local addresses that has been defined 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 verification. 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.