Stack size analysis for interrupt-driven programs

DOI10.1016/j.ic.2004.06.001zbMath1090.68024OpenAlexW2166521230MaRDI QIDQ703848

Rupak Majumdar, Tian Zhao, Di Ma, Thomas A. Henzinger, Krishnendu Chatterjee, Jens Palsberg

Publication date: 11 January 2005

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2004.06.001

zbMATH Keywords

Program analysisInterrupt programsStack bounds

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Theory of software (68N99)

Related Items (2)

Model-checking structured context-free languages ⋮ Model Checking Procedural Programs

Cites Work

• The complexity of facets (and some facets of complexity)
• Undecidable boundedness problems for datalog programs
• A Typed Interrupt Calculus
• Unnamed Item
• Unnamed Item

This page was built for publication: Stack size analysis for interrupt-driven programs