Stack size analysis for interrupt-driven programs

DOI10.1016/J.IC.2004.06.001MaRDI QIDQ703848zbMATH OpenOpenAlexFDO

Authors Krishnendu Chatterjee, Di Ma, Rupak Majumdar, Tian Zhao, Thomas A. Henzinger, 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)

Recommendations

• scientific article; zbMATH DE number 2090843
• A typed interrupt calculus
• Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol
• Investigating time properties of interrupt-driven programs
• A Refinement of the μ-measure for Stack Programs

Cites work

• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 2090847 (Why is no real title available?)
• A typed interrupt calculus
• The complexity of facets (and some facets of complexity)
• Undecidable boundedness problems for datalog programs

Cited in

(4)

• Model-checking structured context-free languages
• Model checking procedural programs
• A typed interrupt calculus
• scientific article; zbMATH DE number 2090843 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703848)