Stack size analysis for interrupt-driven programs

Information and Computation

Volumn 194, Issue 2 SPEC. ISS., 2004, Pages 144-174

  Chatterjee, Krishnendu ^a   Ma, Di ^b   Majumdar, Rupak ^c   Zhao, Tian ^d   Henzinger, Thomas A ^a,e   Palsberg, Jens ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Purdue University   (United States)

^c University of California   (United States)

^d University of Wisconsin Milwaukee   (United States)

^e EPFL   (Switzerland)

Author keywords

Interrupt programs; Program analysis; Stack bounds

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; POLYNOMIALS; PROBLEM SOLVING; REAL TIME SYSTEMS;

INTERRUPT PROGRAMS; PROGRAM ANALYSIS; STACK BOUNDS;

COMPUTER PROGRAM LISTINGS;

EID: 6344226429     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2004.06.001     Document Type: Article

References (12)

1. D. Brylow, N. Damgaard, J. Palsberg, Static checking of interrupt-driven software, in: ICSE: International Conference on Software Engineering, ACM/IEEE, New York, 2001, pp. 47-56.
2. G.G. Hillebrand, P.C. Kanellakis, H.G. Mairson, M.Y. Vardi, Undecidable boundedness problems for datalog programs, J. Logic Program. 25 (2) (1995) 163-190.
3. J. Hughes; L. Pareto, A. Sabry, Proving the correctness of reactive systems using sized types, in: POPL: Principles of Programming Languages, ACM, New York, 1996, pp. 410-423.
4. J. Palsberg, D. Ma, A typed interrupt calculus, in: FTRTFT: Formal Techniques in Real-Time and Fault-tolerant Systems, LNCS 2469, Springer, Berlin, 2002, pp. 291-310.
5. C.H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
6. C.H. Papadimitriou, M. Yannakakis, The complexity of facets (and some facets of complexity), J. Comput. Syst. Sci. 28 (1984) 244-259.
7. L. Pareto, Types for crash prevention, Ph.D. thesis, Chalmers University of Technology, 2000.
8. J. Regehr, A. Reid, K. Webb, Eliminating stack overflow by abstract interpretation, in: R. Alur, I. Lee (Eds.), EMSOFT'03: Third International Workshop on Embedded Software, LNCS 2855, Springer, Berlin, 2003, pp. 306-322.
9. T.W. Reps, S. Horwitz, M. Sagiv, Precise interprocedural dataflow analysis via graph reachability, in: POPL 95: Principles of Programming Languages, ACM, New York, 1995, pp. 49-61.
10. T.W. Reps, S. Schwoon, S. Jha, Weighted pushdown systems and their application to interprocedural dataflow analysis, in: SAS 03: Static Analysis Symposium, LNCS 2694, Springer, Berlin, 2003, pp. 189-213.
11. Z. Wan, W. Taha, P. Hudak, Event-driven FRF, in: PADL: Practical Aspects of Declarative Languages, LNCS 2257, Springer, Berlin, 2002, pp. 155-172.
12. M. Yannakakis, Graph-theoretic methods in database theory, in: PODS: Principles of Database Systems, ACM, New York, 1990, pp. 203-242.