| Inter-context control-flow and data-flow test adequacy criteria for nesC applications |
| Full text |
Pdf
(1.38 MB)
|
| Source
|
Foundations of Software Engineering
archive
Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering
table of contents
Atlanta, Georgia
SESSION: Testing
table of contents
Pages 94-104
Year of Publication: 2008
ISBN:978-1-59593-995-1
|
|
Authors
|
|
Zhifeng Lai
|
Hong Kong University of Science and Technology, Kowloon, Hong Kong
|
|
S. C. Cheung
|
Hong Kong University of Science and Technology, Kowloon, Hong Kong
|
|
W. K. Chan
|
University of Hong Kong, Hong Kong
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 22, Downloads (12 Months): 188, Citation Count: 0
|
|
|
ABSTRACT
NesC is a programming language for applications that run on top of networked sensor nodes. Such an application mainly uses an interrupt to trigger a sequence of operations, known as contexts, to perform its actions. However, a high degree of inter-context interleaving in an application can cause it to be error-prone. For instance, a context may mistakenly alter another context's data kept at a shared variable. Existing concurrency testing techniques target testing programs written in general-purpose programming languages, where a small scale of inter-context interleaving between program executions may make these techniques inapplicable. We observe that nesC blocks new context interleaving when handling interrupts, and this feature significantly restricts the scale of inter-context interleaving that may occur in a nesC application. This paper models how operations on different contexts may interleave as inter-context flow graphs. Based on these graphs, it proposes two test adequacy criteria, one on inter-context data-flows and another on inter-context control-flows. It evaluates the proposal by a real-life open-source nesC application. The empirical results show that the new criteria detect significantly more failures than their conventional counterparts.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Alfred V. Aho , Ravi Sethi , Jeffrey D. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
|
 |
2
|
|
| |
3
|
|
 |
4
|
|
| |
5
|
Dennis Brylow , Niels Damgaard , Jens Palsberg, Static checking of interrupt-driven software, Proceedings of the 23rd International Conference on Software Engineering, p.47-56, May 12-19, 2001, Toronto, Ontario, Canada
|
 |
6
|
|
 |
7
|
Nathan Cooprider , Will Archer , Eric Eide , David Gay , John Regehr, Efficient memory safety for TinyOS, Proceedings of the 5th international conference on Embedded networked sensor systems, November 06-09, 2007, Sydney, Australia
[doi> 10.1145/1322263.1322283]
|
| |
8
|
|
| |
9
|
|
 |
10
|
David Gay , Philip Levis , Robert von Behren , Matt Welsh , Eric Brewer , David Culler, The nesC language: A holistic approach to networked embedded systems, Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation, June 09-11, 2003, San Diego, California, USA
|
 |
11
|
|
 |
12
|
Chih-Chieh Han , Ram Kumar , Roy Shea , Eddie Kohler , Mani Srivastava, A dynamic operating system for sensor nodes, Proceedings of the 3rd international conference on Mobile systems, applications, and services, June 06-08, 2005, Seattle, Washington
[doi> 10.1145/1067170.1067188]
|
 |
13
|
|
 |
14
|
Jason Hill , Robert Szewczyk , Alec Woo , Seth Hollar , David Culler , Kristofer Pister, System architecture directions for networked sensors, ACM SIGOPS Operating Systems Review, v.34 n.5, p.93-104, Dec. 2000
|
| |
15
|
Hill, T. and Lewicki, P. 2007. STATISTICS Methods and Applications. StatSoft, Tulsa, OK, 2007.
|
 |
16
|
|
| |
17
|
Monica Hutchins , Herb Foster , Tarak Goradia , Thomas Ostrand, Experiments of the effectiveness of dataflow- and controlflow-based test adequacy criteria, Proceedings of the 16th international conference on Software engineering, p.191-200, May 16-21, 1994, Sorrento, Italy
|
| |
18
|
Tapas Kanungo , David M. Mount , Nathan S. Netanyahu , Christine D. Piatko , Ruth Silverman , Angela Y. Wu, An Efficient k-Means Clustering Algorithm: Analysis and Implementation, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.24 n.7, p.881-892, July 2002
[doi> 10.1109/TPAMI.2002.1017616]
|
 |
19
|
Sukun Kim , Shamim Pakzad , David Culler , James Demmel , Gregory Fenves , Steven Glaser , Martin Turon, Health monitoring of civil infrastructures using wireless sensor networks, Proceedings of the 6th international conference on Information processing in sensor networks, April 25-27, 2007, Cambridge, Massachusetts, USA
[doi> 10.1145/1236360.1236395]
|
| |
20
|
|
 |
21
|
Philip Levis , Nelson Lee , Matt Welsh , David Culler, TOSSIM: accurate and scalable simulation of entire TinyOS applications, Proceedings of the 1st international conference on Embedded networked sensor systems, November 05-07, 2003, Los Angeles, California, USA
[doi> 10.1145/958491.958506]
|
 |
22
|
|
 |
23
|
|
 |
24
|
|
 |
25
|
|
 |
26
|
|
 |
27
|
|
| |
28
|
TinyOS Tutorials. Modules and the TinyOS execution model. http://docs.tinyos.net/index.php/Modules_and_the_TinyOS_Execution_Model.
|
| |
29
|
|
| |
30
|
|
| |
31
|
|
 |
32
|
|
 |
33
|
Cheer-Sun D. Yang , Amie L. Souter , Lori L. Pollock, All-du-path coverage for parallel programs, Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis, p.153-162, March 02-04, 1998, Clearwater Beach, Florida, United States
|
| |
34
|
|
 |
35
|
|
|