Lazy preemption to enable path-based analysis of interrupt-driven code

Authors:
Wei Le;Jing Yang;Mary Lou Soffa;Kamin Whitehouse
Affiliations:
University of Virginia, Charlottesville, VA, USA;University of Virginia, Charlottesville, VA, USA;University of Virginia, Charlottesville, VA, USA;University of Virginia, Charlottesville, VA, USA
Venue:
Proceedings of the 2nd Workshop on Software Engineering for Sensor Network Applications
Year:
2011

Citing 13
Cited 0

Static checking of interrupt-driven software

ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Random testing of interrupt-driven software

Proceedings of the 5th ACM international conference on Embedded software
Eliminating stack overflow by abstract interpretation

ACM Transactions on Embedded Computing Systems (TECS)
Clairvoyant: a comprehensive source-level debugger for wireless sensor networks

Proceedings of the 5th international conference on Embedded networked sensor systems
Efficient memory safety for TinyOS

Proceedings of the 5th international conference on Embedded networked sensor systems
Model Checking Medium Access Control for Sensor Networks

ISOLA '06 Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation
Inter-context control-flow and data-flow test adequacy criteria for nesC applications

Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering
Marple: a demand-driven path-sensitive buffer overflow detector

Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering
Model checking of software for microcontrollers

ACM Transactions on Embedded Computing Systems (TECS)
T-check: bug finding for sensor networks

Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Anquiro: enabling efficient static verification of sensor network software

Proceedings of the 2010 ICSE Workshop on Software Engineering for Sensor Network Applications
Path-based fault correlations

Proceedings of the eighteenth ACM SIGSOFT international symposium on Foundations of software engineering
Life, death, and the critical transition: finding liveness bugs in systems code

NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the important factors in ensuring the correct functionality of wireless sensor networks (WSNs) is the reliability of the software running on individual sensor nodes. Research has shown that path-sensitive static analysis is effective for bug detection and fault diagnosis; however, path-sensitive analysis is prohibitively expensive when applied to a WSN application due to the large state space caused by arbitrary interrupt preemptions. In this paper, we propose a new execution model called lazy preemption that reduces this state space by restricting interrupt handlers to a set of predetermined preemption points, if possible. This execution model allows us to represent the program with an inter-interrupt control flow graph (IICFG), which is easier to analyze than the original CFGs with arbitrary interrupt preemptions.