Automated Formal Verification of the DHCP Failover Protocol Using Timeout Order Abstraction
Name
Lynch_Automated formal.pdf
Size
297.55 KB
Format
Adobe PDF
Checksum (MD5)
d700266698539a7dee4cbe9bce696370
Author(s)
Umeno, Shinya
Lynch, Nancy A.
Date Issued
November 2010
Journal
Proceedings of the 15th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS), 2010
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Umeno, Shinya, and Nancy Lynch. “Automated Formal Verification of the DHCP Failover Protocol Using Timeout Order Abstraction.” Proceedings of the 15th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS), 2010. 136–145. © Copyright 2010 IEEE
Version
Final published version
Abstract
In this paper, we present automated formal verification of the DHCP Failover protocol. We conduct bounded model-checking for the protocol using Timeout Order Abstraction (TO-Abstraction), a technique to abstract a given timed model in a certain sub-class of loosely synchronized real-time distributed systems into an untimed model. A resulting untimed model from TO-abstraction is a finite state machine, and therefore one can verify the model using a conventional model-checker. We have verified the protocol by bounded model-checking up to depth 20. We also experimented with "mutating" the original code to examine the efficiency of bug-finding using TO-Abstraction. We used two mutated pieces of the original code. The first one represents a model that uses a stronger failure assumption. The second one represents a model that the protocol implementer has forgot to add a certain check of a received message. We found one counterexample for each of two pieces of mutated code. In particular, the counterexample that was found for the second mutated code had a complex scenario, and we believe that it is considerably difficult to find the counterexample by human or simulations.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ICECCS.2010.14
