skip to main content
10.1145/1988051.1988060acmconferencesArticle/Chapter ViewAbstractPublication PagesicseConference Proceedingsconference-collections
research-article

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

Authors Info & Claims
Published:22 May 2011Publication History

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.

References

  1. P. Ballarini and A. Miller. Model Checking Medium Access Control for Sensor Networks. In ISoLA '06, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. D. Brylow, N. Damgaard, and J. Palsberg. Static Checking of Interrupt-Driven Software. In ICSE '01, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. N. Cooprider, W. Archer, E. Eide, D. Gay, and J. Regehr. Efficient Memory Safety for TinyOS. In SenSys '07, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. C. Killian, J. Anderson, R. Jhala, and A. Vahdat. Life, Death, and the Critical Transition: Finding Liveness Bugs in Systems Code. In NSDI '07, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Z. Lai, S. Cheung, and W. Chan. Inter-Context Control-Flow and Data-Flow Test Adequacy Criteria for nesC Applications. In FSE '08, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. W. Le and M. L. Soffa. Marple: A Demand-Driven Path-Sensitive Buffer Overflow Detector. In FSE '08, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. W. Le and M. L. Soffa. Path-Based Fault Correlation. In FSE '10, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. P. Li and J. Regehr. T-Check: Bug Finding for Sensor Networks. In IPSN '10, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. L. Mottola, T. Voigt, F. Osterlind, J. Eriksson, L. Baresi, and C. Ghezzi. Anquiro: Enabling Efficient Static Verification of Sensor Network Software. In SESENA '10, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. J. Regehr. Random Testing of Interrupt-Driven Software. In EMSOFT '05, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. Regehr, A. Reid, and K. Webb. Eliminating Stack Overflow by Abstract Interpretation. ACM Trans. Embed. Comput. Syst., 4(4), 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. B. Schlich. Model Checking of Software for Microcontrollers. ACM Trans. Embed. Comput. Syst., 9(4), 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. J. Yang, M. L. Soffa, L. Selavo, and K. Whitehouse. Clairvoyant: A Comprehensive Source-Level Debugger for Wireless Sensor Networks. In SenSys '07, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

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

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        SESENA '11: Proceedings of the 2nd Workshop on Software Engineering for Sensor Network Applications
        May 2011
        74 pages
        ISBN:9781450305839
        DOI:10.1145/1988051

        Copyright © 2011 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 22 May 2011

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Upcoming Conference

        ICSE 2025

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader