Exhaustive and mechanized formal verification of wireless networks is hampered by the huge number of possible topologies and the large size of the actual networks. However, the generic communication structure in such networks allows for reducing the root causes of faults to faulty (sub-)topologies, called anti-patterns, of small size. We propose techniques to find such anti-patterns using a combination of model-checking and automated debugging. We apply the proposed technique on two well-known protocols for wireless sensor networks and show that the techniques indeed find the root causes in terms of canonical topologies featuring the fault.
|Title of host publication||Integrated Formal Methods (9th International Conference, IFM 2012, Pisa, Italy, June 18-21, 2012. Proceedings)|
|Editors||J. Derrick, S. Gnesi, D. Latella, H. Treharne|
|Place of Publication||Berlin|
|Publication status||Published - 2012|
|Name||Lecture Notes in Computer Science|
Woehrle, M., Bakhshi, R., & Mousavi, M. R. (2012). Mechanized extraction of topology anti-patterns in wireless networks. In J. Derrick, S. Gnesi, D. Latella, & H. Treharne (Eds.), Integrated Formal Methods (9th International Conference, IFM 2012, Pisa, Italy, June 18-21, 2012. Proceedings) (pp. 158-173). (Lecture Notes in Computer Science; Vol. 7321). Berlin: Springer. https://doi.org/10.1007/978-3-642-30729-4_12