Stack size analysis for interrupt-driven programs

Authors:
Krishnendu Chatterjee;Di Ma;Rupak Majumdar;Tian Zhao;Thomas A. Henzinger;Jens Palsberg
Affiliations:
University of California, Berkeley;Purdue University;University of California, Berkeley;University of Wisconsin, Milwaukee;University of California, Berkeley;Purdue University
Venue:
SAS'03 Proceedings of the 10th international conference on Static analysis
Year:
2003

Citing 6
Cited 9

Precise interprocedural dataflow analysis via graph reachability

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proving the correctness of reactive systems using sized types

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Graph-theoretic methods in database theory

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Static checking of interrupt-driven software

ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Event-Driven FRP

PADL '02 Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages
A Typed Interrupt Calculus

FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2

Visibly pushdown languages

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Analysis of recursive state machines

ACM Transactions on Programming Languages and Systems (TOPLAS)
A fixpoint calculus for local and global program flows

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Eliminating stack overflow by abstract interpretation

ACM Transactions on Embedded Computing Systems (TECS)
Memory overflow protection for embedded systems using run-time checks, reuse, and compression

ACM Transactions on Embedded Computing Systems (TECS)
Analysing memory resource bounds for low-level programs

Proceedings of the 7th international symposium on Memory management
CaRet With Forgettable Past

Electronic Notes in Theoretical Computer Science (ENTCS)
Alternating automata and a temporal fixpoint calculus for visibly pushdown languages

CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Investigating time properties of interrupt-driven programs

SBMF'12 Proceedings of the 15th Brazilian conference on Formal Methods: foundations and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of determining stack boundedness and the exact maximum stack size for three classes of interrupt-driven programs. Interrupt-driven programs are 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.