{"alternative_title":["LNCS"],"intvolume":"      2694","doi":"10.1007/3-540-44898-5_7","quality_controlled":0,"_id":"3898","year":"2003","day":"28","page":"109 - 126","title":"Stack size analysis for interrupt-driven programs","date_updated":"2021-01-12T07:53:02Z","date_created":"2018-12-11T12:05:46Z","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Krishnendu Chatterjee"},{"first_name":"Di","last_name":"Ma","full_name":"Ma, Di"},{"full_name":"Majumdar, Ritankar S","first_name":"Ritankar","last_name":"Majumdar"},{"first_name":"Tian","last_name":"Zhao","full_name":"Zhao, Tian"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Thomas Henzinger"},{"first_name":"Jens","last_name":"Palsberg","full_name":"Palsberg, Jens"}],"date_published":"2003-05-28T00:00:00Z","conference":{"name":"SAS: Static Analysis Symposium"},"acknowledgement":"Jens Palsberg, Di Ma, and Tian Zhao were supported by the NSF ITR award 0112628. Thomas A. Henzinger, Krishnendu Chatterjee, and Rupak Majumdar were supported by the AFOSR grant F49620-00-1-0327, the DARPA grants F33615-C-98-3614 and F33615-00-C-1693, the MARCO grant 98-DT-660, and the NSF grants CCR-0208875 and CCR-0085949.","abstract":[{"text":"We study the problem of determining stack boundedness and the exact maximum stack size for three classes of interrupt-driven programs. Interrupt-driven programs axe used in many real-time applications that require responsive interrupt handling. In order to ensure responsiveness, programmers often enable interrupt processing in the body of lower-priority interrupt handlers. In such programs a programming error can allow interrupt handlers to be interrupted in cyclic fashion to lead to an unbounded stack, causing the system to crash. For a restricted class of interrupt-driven programs, we show that there is a polynomial-time procedure to check stack boundedness, while determining the exact maximum stack size is PSPACE-complete. For a larger class of programs, the two problems are both PSPACE-complete, and for the largest class of programs we consider, the two problems are PSPACE-hard and can be solved in exponential time.","lang":"eng"}],"status":"public","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Stack Size Analysis for Interrupt-Driven Programs</i>. Vol. 2694, Springer, 2003, pp. 109–26, doi:<a href=\"https://doi.org/10.1007/3-540-44898-5_7\">10.1007/3-540-44898-5_7</a>.","ista":"Chatterjee K, Ma D, Majumdar R, Zhao T, Henzinger TA, Palsberg J. 2003. Stack size analysis for interrupt-driven programs. SAS: Static Analysis Symposium, LNCS, vol. 2694, 109–126.","short":"K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T.A. Henzinger, J. Palsberg, in:, Springer, 2003, pp. 109–126.","ieee":"K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T. A. Henzinger, and J. Palsberg, “Stack size analysis for interrupt-driven programs,” presented at the SAS: Static Analysis Symposium, 2003, vol. 2694, pp. 109–126.","chicago":"Chatterjee, Krishnendu, Di Ma, Ritankar Majumdar, Tian Zhao, Thomas A Henzinger, and Jens Palsberg. “Stack Size Analysis for Interrupt-Driven Programs,” 2694:109–26. Springer, 2003. <a href=\"https://doi.org/10.1007/3-540-44898-5_7\">https://doi.org/10.1007/3-540-44898-5_7</a>.","ama":"Chatterjee K, Ma D, Majumdar R, Zhao T, Henzinger TA, Palsberg J. Stack size analysis for interrupt-driven programs. In: Vol 2694. Springer; 2003:109-126. doi:<a href=\"https://doi.org/10.1007/3-540-44898-5_7\">10.1007/3-540-44898-5_7</a>","apa":"Chatterjee, K., Ma, D., Majumdar, R., Zhao, T., Henzinger, T. A., &#38; Palsberg, J. (2003). Stack size analysis for interrupt-driven programs (Vol. 2694, pp. 109–126). Presented at the SAS: Static Analysis Symposium, Springer. <a href=\"https://doi.org/10.1007/3-540-44898-5_7\">https://doi.org/10.1007/3-540-44898-5_7</a>"},"publisher":"Springer","month":"05","extern":1,"volume":2694,"publication_status":"published","publist_id":"2260","type":"conference"}