Towards verifying correctness of wireless sensor network applications using Insense and Spin
MetadataShow full item record
The design and implementation of wireless sensor network applications often require domain experts, who may lack expertise in software engineering, to produce resource-constrained, concurrent, real-time software without the support of high-level software engineering facilities. The Insense language aims to address this mismatch by allowing the complexities of synchronisation, memory management and event-driven programming to be borne by the language implementation rather than by the programmer. The main contribution of this paper is all initial step towards verifying the correctness of WSN applications with a focus on concurrency. We model part of the synchronisation mechanism of the Insense language implementation using Promela constructs and verify its correctness using SPIN. We demonstrate how a previously published version of the mechanism is shown to be incorrect by SPIN, and give complete verification results for the revised mechanism.
Sharma , O , Lewis , J P , Miller , A , Dearle , A , Balasubramaniam , D , Morrison , R & Sventek , J 2009 , ' Towards verifying correctness of wireless sensor network applications using Insense and Spin ' . in C S Pasareanu (ed.) , Model Checking Software : 16th International SPIN Workshop, Grenoble, France, June 26-28, 2009, Proceedings . Lecture Notes in Computer Science , vol. 5578 , Springer , pp. 223-240 , 16th International SPIN Workshop on Model Checking in Software , Grenoble , France , 26-28 June . , 10.1007/978-3-642-02652-2_19conference
Model Checking Software
(c)2010 Springer-Verlag. The original publication is available at www.springerlink.com
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.