Communicating sequential processes
Communicating sequential processes
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Design and validation of protocols: a tutorial
Computer Networks and ISDN Systems - Special issue on protocol specification, testing and verification
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Combining Partial Order and Symmetry Reductions
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
The nesC language: A holistic approach to networked embedded systems
PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
TOSSIM: accurate and scalable simulation of entire TinyOS applications
Proceedings of the 1st international conference on Embedded networked sensor systems
Interface contracts for TinyOS
Proceedings of the 6th international conference on Information processing in sensor networks
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Software design patterns for TinyOS
ACM Transactions on Embedded Computing Systems (TECS) - Special Section LCTES'05
Program representations for testing wireless sensor network applications
Workshop on Domain specific approaches to software test automation: in conjunction with the 6th ESEC/FSE joint meeting
Slede: a domain-specific verification framework for sensor network security protocol implementations
WiSec '08 Proceedings of the first ACM conference on Wireless network security
An analyzer for extended compositional process algebras
Companion of the 30th international conference on Software engineering
Deriving State Machines from TinyOS Programs Using Symbolic Execution
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
PAT: Towards Flexible Verification under Fairness
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
TinyOS Programming
TOSThreads: thread-safe and non-invasive preemption in TinyOS
Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
Fair Model Checking with Process Counter Abstraction
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Verifying Stateful Timed CSP Using Implicit Clocks and Zone Abstraction
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
T-check: bug finding for sensor networks
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Software verification for TinyOS
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Developing model checkers using PAT
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Model checking hierarchical probabilistic systems
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
On combining state space reductions with global fairness assumptions
FM'11 Proceedings of the 17th international conference on Formal methods
| Hi-index | 0.00 |
Wireless sensor networks (WSNs) are expected to run unattendedly for critical tasks. To guarantee the correctness of WSNs is important, but highly nontrivial due to the distributed nature. In this work, we present an automatic approach to directly verify WSNs built with TinyOS applications implemented in the NesC language. To achieve this target, we firstly define a set of formal operational semantics for most of the NesC language structures for the first time. This allows us to capture the behaviors of sensors by labelled transition systems (LTSs), which are the underlying semantic models of NesC programs. Secondly, WSNs are modeled as the composition of sensors with a network topology. Verifications of individual sensors and the whole WSN become possible by exploring the corresponding LTSs using model checking. With substantial engineering efforts, we implemented this approach in the tool NesC@PAT to support verifications of deadlock-freeness, state reachability and temporal properties for WSNs. NesC@PAT has been applied to analyze and verify WSNs, with unknown bugs being detected. To the best of our knowledge, NesC@PAT is the first model checker which takes NesC language as the modeling language and completely preserves the interrupt-driven feature of the TinyOS execution model.