The University of St Andrews

Research@StAndrews:FullText >
University of St Andrews Research >
University of St Andrews Research >
University of St Andrews Research >

Please use this identifier to cite or link to this item:
This item has been viewed 5 times in the last year. View Statistics

Files in This Item:

File Description SizeFormat
SPIN_09.pdf359.02 kBAdobe PDFView/Open
Title: Towards verifying correctness of wireless sensor network applications using Insense and Spin
Authors: Sharma, Oliver
Lewis, Jonathan Peter
Miller, Alice
Dearle, Alan
Balasubramaniam, Dharini
Morrison, Ronald
Sventek, Joe
Editors: Pasareanu, C. S.
Keywords: Concurrency
Distributed systems
Formal Modelling
Wireless Sensor Networks
State concurrent systems
Automatic verification
QA76 Computer software
Issue Date: 2009
Citation: 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_19
Series/Report no.: Lecture Notes in Computer Science
Abstract: 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.
Version: Preprint
ISBN: 978-3-642-02651-5
ISSN: 0302-9743
Type: Conference item
Rights: (c)2010 Springer-Verlag. The original publication is available at
Publisher: Springer
Appears in Collections:University of St Andrews Research
Computer Science Research

This item is protected by original copyright

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


DSpace Software Copyright © 2002-2012  Duraspace - Feedback
For help contact: | Copyright for this page belongs to St Andrews University Library | Terms and Conditions (Cookies)