Live heap space bounds for real-time systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6461 LNCS, Issue , 2010, Pages 287-303

  Kero, Martin ^a   Pietrzak, Paweł ^a   Nordlander, Johan ^a  

^a LULEÅ UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ACCURATE PREDICTION; EMBEDDED REAL TIME SYSTEMS; GARBAGE COLLECTORS; INTEGER LINEAR PROGRAMMING; KEY COMPONENT; LIVE HEAP SPACE ANALYSIS; NON-DETERMINISTIC FINITE STATE MACHINE; PERSISTENT STATE; PROGRAMMING MODELS; RUNNING TIME; SCHEDULABILITY ANALYSIS; SEQUENTIAL PROGRAMMING; SEQUENTIAL TASK; SPACE BOUNDS; SPACE USAGE; STATE-DEPENDENT; TASK EXECUTIONS; TIMING ASSUMPTIONS; UPPER BOUND;

COMPUTER SYSTEMS PROGRAMMING; EMBEDDED SYSTEMS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; INTERACTIVE COMPUTER SYSTEMS;

REAL TIME SYSTEMS;

EID: 78650753664     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17164-2_20     Document Type: Conference Paper

References (18)

1. Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: Cost Analysis of Java Bytecode. In: 16th European Symposium on Programming (2007)
2. Albert, E., Genaim, S., Gómez-Zamalloa, M.: Live heap space analysis for languages with garbage collection. In: ISMM (2009)
3. Albert, E., Genaim, S., Gómez-Zamalloa, M.: Parametric inference of memory requirements for garbage collected languages. In: ISMM (2010)
4. Alur, R.: Timed automata. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 8-22. Springer, Heidelberg (1999)
5. Alur, R., Dill, D.: A theory of timed automata. Journal of Theoretical Computer Science 126(2) (1994)
6. Baker, T.P.: Stack-based scheduling for realtime processes. Real-Time Syst. 3(1), 67-99 (1991)
7. Bengtsson, J., Yi, W.: Timed automata: Semantics, algorithms and tools. In: Lectures on Concurrency and Petri Nets (2003)
8. Benoy, F., King, A.: Inferring argument size relationships with CLPR. In: Workshop on Logic-based Program Synthesis and Transformation (1997)
9. Chin, W.N., Nguyen, H.H., Popeea, C., Qin, S.: Analysing memory resource bounds for low-level programs. In: ISMM (2008)
10. Courcoubetis, C., Yannakakis, M.: Minimum and maximum delay problems in realtime systems. Formal Methods in System Design 1(4) (1992)
11. Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: POPL (1978)
12. Jaffar, J., Maher, M., Marriott, K., Stuckey, P.: The semantics of constraint logic programs. Journal of Logic Programming 37 (1-3) (1998)
13. Jaffar, J., Maher, M.J.: Constraint logic programming: A survey. Journal of Logic Programming 19 & 20 (1994)
14. Jost, S., Loid, H.W., Hammond, K., Hofmann, M.: Static determination of quantitative resource usage for higher-order programs. In: POPL (2010)
15. Kero, M., Aittamaa, S.: Scheduling garbage collection in real-time systems. In: CODES (2010)
16. Krishna, C.M., Shin, K.G.: Real-Time Systems. McGraw-Hill, New York (1997)
17. Nordlander, J., Carlsson, M., Gill, A., Lindgren, P., von Sydow, B.: The Timber home page (2008), http://timber-lang.org
18. Unnikrishnan, L., Stoller, S.D., Liu, Y.A.: Optimized live heap bound analysis. In: Zuck, L.D., et al. (eds.) VMCAI 2003. LNCS, vol. 2575, pp. 70-85. Springer, Heidelberg (2002)