Inter-Context Control-Flow and Data-Flow Test Adequacy Criteria to get nesC Applications* Zhifeng Psaume and S. C. CheungвЂ
Department of Computer Research and Executive Hong Kong College or university of Scientific research and Technology Kowloon, Hong Kong
W. T. Chan
Section of Pc Science City University of Hong Kong Tat Chee Avenue, Hong Kong
zflai, scc @cse. ust. hk
[email protected] cityu. edu. hk
NesC is known as a programming language for applications that run along with networked sensor nodes. Such an application largely uses an interrupt to trigger a chain of businesses, known as contexts, to perform their actions. However , a high amount of inter-context interleaving in an app can cause this to be error-prone. For instance, a context may well mistakenly modify another context's data stored at a shared variable. Existing concurrency testing techniques target testing programs created in general-purpose programming languages, where a small scale of inter-context interleaving among program executions may make these kinds of techniques inapplicable. We note that nesC obstructs new circumstance interleaving when ever handling interrupts, and this feature significantly restricts the scale of inter-context interleaving that may occur in a nesC application. This kind of paper designs how businesses on several contexts may well interleave since inter-context stream graphs. Based on these charts, it offers two evaluation adequacy requirements, one on inter-context data-flows and an additional on intercontext control-flows. It evaluates the proposal by a real-life open-source nesC app. The scientific results show that the fresh criteria identify significantly more failures than their conventional equivalent.
1 . INTRO
NesC dialect  is made for programming wireless sensor network (WSN) applications that are deployed on a number of small low-powered low-capability products known as motes. Each divisa usually features sensing and wireless conversation capabilities. WSN applications are helpful for monitoring their physical environments. Most nesC applications running on motes happen to be interrupt-driven, therefore hardware processors of these terme can sleeping and spend less energy once there is no interrupt. In general, event-driven programming is definitely popular to get handling interrupts in networked embedded devices running over TinyOS , TinyGALS , or SOS . In the event-driven programming paradigm, developers put into practice application reasoning through cooperative event handlers. A high level of interruptbased concurrency complicates this program design to undertake the desired cooperation . For instance, an abrupt interrupt may arise during the time when an event has been handled. The occurrence with the interrupt might interfere with the event handler through unforeseen dependencies between the function handler and the code that handles the interrupt. Coding nesC applications is a great error-prone process: developers of nesC applications need to clearly handle quite a few interrupts within their code. Experts have reported the problems of data races , interface-contract violation , and storage safety  in these applications. Although nesC is designed to relieve static examination, existing stationary checking  and runtime verification  tactics do not offer a satisfactory answer to these concerns. For instance, useful race detectors  might not exactly identify some race circumstances (c. n. TinyOS-Help1, a serious discussion mailing-list of TinyOS related problems); powerful contest detector , however , is susceptible to scalability and precision concerns. Even if the problems identified simply by these methods have been corrected, the revised nesC applications may have latent problems. Testing is known as a major means to assure the caliber of software. Nevertheless , existing tests techniques for continuous programs  address the interactions amongst interrupts inadequately. In continuous programs, terme conseille call one other (termed a calling context). In nesC applications, a great...
References:  Aho, A. V., Sethi, R., and Ullman, T. D. 1988. Compilers: Rules, Techniques, and Tools, Chapter 10. AddisonWesley Pub. Company., 1988.  Ammons, G., Ball, T., and Larus, J. L. 1997. Taking advantage of hardware overall performance counters with flow and context sensitive profiling. SIGPLAN Not. 32, 5 (May. 1997), 85-96.  Andrews, J. L., Briand, D. C., Labiche, Y., and Namin, A. S. 06\. Using veranderung analysis pertaining to assessing and comparing testing coverage criteria. IEEE Trans. Softw. Eng. 32, eight (Aug. 2006), 608-624.  Archer, W., Levis, G., and Regehr, J. 3 years ago. Interface contracts for TinyOS. In Proc. of IPSN '07, 158-165.  Brylow, D., Damgaard, N., and Palsberg, J. 2001. Stationary checking of interrupt-driven software. In Proc. of ICSE '01, 47-56.  Cheong, E., Liebman, J., Liu, J., and Zhao, Farreneheit. 2003. TinyGALS: a programming model for event-driven inserted systems. In Proc. of SAC '03, 698-704.  Cooprider, D., Archer, T., Eide, E., Gay, D., and Regehr, J. 3 years ago. Efficient recollection safety to get TinyOS. In Proc. of SenSys '07, 205-218.  Frankl, P. G. and Weiss, T. N. 1993. An fresh comparison of the potency of branch screening and data flow tests. IEEE Trans. Softw. Eng. 19, almost eight (Aug. 1993), 774-787.  Frankl, P. G. and Weyuker, At the. J. 1988. An appropriate family of info flow assessment criteria. IEEE Trans. Softw. Eng. 16, 10 (Oct. 1988), 1483-1498.  Gay and lesbian, D., Levis, P., vonseiten Behren, Ur., Welsh, Meters., Brewer, Electronic., and Culler, D. 2003. The nesC language: A holistic approach to networked embedded systems. In Proc. of PLDI '03, 1-11.  Harrold, M. M. and Soffa, M. 1994. Efficient calculation of interprocedural definition-use stores. ACM Trans. Program. Lang. Syst. 16, 2 (Mar. 1994), 175-204.  Ryan, C., Kumar, R., Shea, R., Kohler, E., and Srivastava, Meters. 2005. HELP: A powerful operating system for sensor systems. In Proc. of MobiSys '05.  Henzinger, To. A., Jhala, R., and Majumdar, Ur. 2004. Competition checking by simply context inference. In Proc. of PLDI '04, 1-13.  Hill, J., Szewczyk, R., Woo, A., Derribar, S., Culler, D., and Pister, T. 2000. System architecture guidelines for networked sensors. SIGOPS Oper. Syst. Rev. thirty four, 5 (Dec. 2000), 93-104.  Mountain, T. and Lewicki, L. 2007. STATS Methods and Applications. StatSoft, Tulsa, FINE, 2007.  Huang, M. C. 1975. An approach to plan testing. ACM Comput. Surv. 7, three or more (Sep. 1975), 113-128.  Hutchins, M., Foster, H., Goradia, To., and Ostrand, T. year 1994. Experiments of the effectiveness of dataflow- and
  
            
controlflow-based test adequacy criteria. In Proc. of ICSE '94, 191-200. Kanungo, T., Mount, Deb. M., Netanyahu, N. S i9000., Piatko, C. D., Silverman, R., and Wu, A. Y. 2002. An efficient k-means clustering criteria: analysis and implementation. IEEE Trans. Routine Anal. Mach. Intell. 24, 7 (Jul. 2002), 881-892. Kim, S., Pakzad, H., Culler, G., Demmel, J., Fenves, G., Glaser, S., and Turon, M. 3 years ago. Health monitoring of city infrastructures employing wireless sensor networks. In Proc. of IPSN '07, 254-263. Legisla??o, Y., and Carver, R. H. 06\. Reachability testing of contingency programs. IEEE Trans. Softw. Eng. 32, 6 (Jun. 2006), 382-403. Levis, S., Lee, In., Welsh, Meters., and Culler, D. the year 2003. TOSSIM: correct and scalable simulation of entire TinyOS applications. In Proc. of SenSys '03, 126-137. Lu, H., Chan, W. K., and Tse, T. They would. 2006. Screening contextaware middleware-centric programs: an information flow strategy and a great RFID-based testing. In Proc. of SIGSOFT '06/FSE-14, 242-252. Lu, They would., Chan, T. K., and Tse, T. H. 08. Testing pervasive software inside the presence of context disparity resolution providers. In Proc. of ICSE '08, 61-70. Memon, A. M., Soffa, M. D., and Pollack, M. E. 2001. Protection criteria to get GUI testing. In Proc. of ESEC/FSE-9, 256-267. Nguyen, N. T. and Soffa, M. M. 2007. Plan representations for testing cellular sensor network applications. In Proc. of DOSTA '07, 20-26. Regehr, J. june 2006. Random tests of interrupt-driven software. In Proc. of EMSOFT '05, 290-298. Rutherford, M. T., Carzaniga, A., and Wolf, A. L. 2006. Simulation-based test adequacy criteria to get distributed devices. In Proc. of SIGSOFT '06/FSE-14, 231-241. TinyOS Lessons. Modules as well as the TinyOS delivery model. http://docs.tinyos.net/index.php/Modules_and_the_TinyOS_ Execution_Model. Titzer, B. T., Lee, D. K., and Palsberg, T. 2005. Avrora: scalable sensor network simulation with exact timing. In Proc. of IPSN '05, 477-482. Tse, T. H., Yau, S. S., Chan, W. T., Lu, L., and Chen, T. Con. 2004. Tests context-sensitive middleware-based software applications. In Compsac '04, 458-466. Wang, Z., Elbaum, S., and Rosenblum, G. S. 3 years ago. Automated technology of context-aware tests. In Proc. of ICSE '07, 406-415. Xie, Q. and Memon, A. M. 2007. Designing and comparing automatic test oracles for GUI-based software applications. ACM Trans. Softw. Eng. Methodol. 16, 1 (Feb. 2007), 4. Yang, C. G., Souter, A. L., and Pollock, M. L. 98. All-dupath protection for seite an seite programs. In Proc. of ISSTA '98, 153-162. Zhang, Y. and West, R. 2006. Process-aware interrupt booking and accounting. In Proc. of RTSS '06, 191-201. Zhu, H., Hall, P. A., and may even, J. L. 1997. Software unit test out coverage and adequacy. ACM Comput. Surv. 29, four (Dec. 1997), 366-427.
Anna Hazare's Movement Against Corruption A brand new landmark inside the history of self-employed ..
" The theme is definitely an attempt to trace the disorders of world ..
Siddhartha Biswas SOME FINDINGS REGARDING VIOLENCE Frantz Fanon, ‘Concerning Violence' National freedom, national renaissance, the ..