메뉴 건너뛰기




Volumn , Issue , 2008, Pages 141-150

Parametric prediction of heap memory requirements

Author keywords

Heap consumption; Heap space analysis; Java; Memory regions

Indexed keywords

BERNSTEIN BASES; DYNAMIC MEMORIES; HEAP CONSUMPTION; HEAP SPACE ANALYSIS; IMPERATIVE PROGRAMS; INITIAL CONFIGURATIONS; JAVA; LIFE-TIMES; MEMORY CONSUMPTIONS; MEMORY MANAGEMENTS; MEMORY REGIONS; MEMORY REQUIREMENTS; OBJECT ALLOCATIONS; OUT OF MEMORIES; POLYHEDRAL DOMAINS; POLYNOMIAL OPTIMIZATION PROBLEMS;

EID: 57349149456     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1375634.1375655     Document Type: Conference Paper
Times cited : (53)

References (29)
  • 1
  • 4
    • 27644567432 scopus 로고    scopus 로고
    • Garbage collection for embedded systems
    • ACM
    • D. Bacon, P. Cheng, D. Grove. Garbage collection for embedded systems. EMSOFT'04, ACM 2004.
    • (2004) EMSOFT'04
    • Bacon, D.1    Cheng, P.2    Grove, D.3
  • 5
    • 84883279063 scopus 로고    scopus 로고
    • Precise analysis of memory consumption using program logics
    • IEEE
    • G. Barthe, M. Pavlova, G. Schneider. Precise analysis of memory consumption using program logics. SEFM'05. IEEE 2005.
    • (2005) SEFM'05
    • Barthe, G.1    Pavlova, M.2    Schneider, G.3
  • 7
    • 33746310302 scopus 로고    scopus 로고
    • A static analysis for synthesizing parametric specifications of dynamic memory consumption
    • V. Braberman, D. Garbervetsky, S. Yovine. A static analysis for synthesizing parametric specifications of dynamic memory consumption. JOT 5(5):31-58, 2006.
    • (2006) JOT , vol.5 , Issue.5 , pp. 31-58
    • Braberman, V.1    Garbervetsky, D.2    Yovine, S.3
  • 8
    • 0035177463 scopus 로고    scopus 로고
    • Data flow analysis for software prefetching linked data structures in lava
    • IEEE
    • B. Cahoon, K. S. McKinley. Data flow analysis for software prefetching linked data structures in lava. PACT'01, IEEE 2001.
    • (2001) PACT'01
    • Cahoon, B.1    McKinley, K.S.2
  • 9
    • 21644451309 scopus 로고    scopus 로고
    • Region analysis and transformation for Java programs
    • ACM
    • S. Cherem, R. Rugina. Region analysis and transformation for Java programs. ISMM'04, ACM 2004.
    • (2004) ISMM'04
    • Cherem, S.1    Rugina, R.2
  • 10
    • 33244466036 scopus 로고    scopus 로고
    • Verifying safety policies with size properties and alias controls
    • ACM
    • W. Chin, S. Khoo, S. Qin, C. Popeea, H. Nguyen. Verifying safety policies with size properties and alias controls. ICSE'05, ACM 2005.
    • (2005) ICSE'05
    • Chin, W.1    Khoo, S.2    Qin, S.3    Popeea, C.4    Nguyen, H.5
  • 11
    • 33646074545 scopus 로고    scopus 로고
    • Memory usage verification for oo programs. SAS'05
    • W. Chin, H. H. Nguyen, S. Qin. M. Rinard. Memory usage verification for oo programs. SAS'05, LNCS 3672, 2005.
    • (2005) LNCS , vol.3672
    • Chin, W.1    Nguyen, H.H.2    Qin, S.3    Rinard, M.4
  • 12
    • 57349128886 scopus 로고    scopus 로고
    • W.N. Chin, H.H. Nguyen, C. Popeea, S. Qin Analysing memory resource bounds for low-level programs. In ISMM 08, 2008.
    • W.N. Chin, H.H. Nguyen, C. Popeea, S. Qin Analysing memory resource bounds for low-level programs. In ISMM 08, 2008.
  • 13
    • 57349195352 scopus 로고    scopus 로고
    • A symbolic approach to Bernstein expansion for program analysis and optimization
    • Ph. Clauss, I. Tchoupaeva. A symbolic approach to Bernstein expansion for program analysis and optimization. CC'04, 2004.
    • (2004) CC'04
    • Clauss, P.1    Tchoupaeva, I.2
  • 14
    • 57349100611 scopus 로고    scopus 로고
    • Ph. Clauss, F. Fernández, D. Garbervetsky, S. Verdoolaege. Symbolic polynomial maximization over convex sets and its application to memory requirement estimation. TR06-04, Univ. L. Pasteur, 2006.
    • Ph. Clauss, F. Fernández, D. Garbervetsky, S. Verdoolaege. Symbolic polynomial maximization over convex sets and its application to memory requirement estimation. TR06-04, Univ. L. Pasteur, 2006.
  • 15
    • 4544361198 scopus 로고    scopus 로고
    • A hard look at hard real-time garbage collection
    • IEEE
    • D. Detlefs. A hard look at hard real-time garbage collection. ISORC'04, IEEE 2004.
    • (2004) ISORC'04
    • Detlefs, D.1
  • 18
    • 0034826994 scopus 로고    scopus 로고
    • Language support for regions
    • ACM
    • D. Gay, A. Aiken.Language support for regions.PLDI'01,ACM 2001.
    • (2001) PLDI'01
    • Gay, D.1    Aiken, A.2
  • 19
    • 57349140108 scopus 로고    scopus 로고
    • O. Gheorghioiu. Statically determining memory consumption of real-time Java threads. MEng, MIT, 2002.
    • O. Gheorghioiu. Statically determining memory consumption of real-time Java threads. MEng, MIT, 2002.
  • 20
    • 33746290077 scopus 로고    scopus 로고
    • Static prediction of heap usage for first-order functional programs
    • ACM
    • M. Hofman, S. Jost. Static prediction of heap usage for first-order functional programs. POPL'03, ACM 2003.
    • (2003) POPL'03
    • Hofman, M.1    Jost, S.2
  • 21
    • 35248842253 scopus 로고    scopus 로고
    • Type-based amortised heap-space analysis
    • M. Hofman, S. Jost. Type-based amortised heap-space analysis. In ESOP '06, 2006.
    • (2006) ESOP '06
    • Hofman, M.1    Jost, S.2
  • 22
    • 0013115226 scopus 로고    scopus 로고
    • Recursion and dynamic data-structures in bounded space: Towards embedded ML programming
    • SIGPLAN Notices , ACM 1999
    • J. Hughes, L. Pareto. Recursion and dynamic data-structures in bounded space: towards embedded ML programming. ICFP'99, SIGPLAN Notices 34(9), ACM 1999.
    • ICFP'99 , vol.34 , Issue.9
    • Hughes, J.1    Pareto, L.2
  • 23
    • 0029717391 scopus 로고    scopus 로고
    • Proving the correctness of reactive systems using sized types
    • ACM
    • J. Hughes, L. Pareto, A. Sabry. Proving the correctness of reactive systems using sized types. POPL'96, ACM 1996.
    • (1996) POPL'96
    • Hughes, J.1    Pareto, L.2    Sabry, A.3
  • 24
    • 57349132245 scopus 로고    scopus 로고
    • V. Sundaresan, P. Lam, E. Gagnon, R. Vallée-Rai, L. Hendren, P. Co. Soot: A java optimization framework. CASCON'99, IBM 1999.
    • V. Sundaresan, P. Lam, E. Gagnon, R. Vallée-Rai, L. Hendren, P. Co. Soot: A java optimization framework. CASCON'99, IBM 1999.
  • 25
    • 46449121309 scopus 로고    scopus 로고
    • Semi-automatic region-based memory management for real-time java embedded systems
    • IEEE
    • G. Salagnac, Ch. Rippert, S. Yovine. Semi-automatic region-based memory management for real-time java embedded systems. RTCSA'07, IEEE 2007.
    • (2007) RTCSA'07
    • Salagnac, G.1    Rippert, C.2    Yovine, S.3
  • 26
    • 19044384556 scopus 로고    scopus 로고
    • Fast escape analysis for region-based memory management
    • G. Salagnac, S. Yovine, D. Garbervetsky. Fast escape analysis for region-based memory management. ENTCS, 131:99-110, 2005.
    • (2005) ENTCS , vol.131 , pp. 99-110
    • Salagnac, G.1    Yovine, S.2    Garbervetsky, D.3
  • 27
    • 0034824488 scopus 로고    scopus 로고
    • Pointer and escape analysis for multithreaded programs
    • SIGPLAN Notices , ACM 2001
    • A. Salcianu, M. Rinard. Pointer and escape analysis for multithreaded programs. PPoPP'01, SIGPLAN Notices 36(7), ACM 2001.
    • PPoPP'01 , vol.36 , Issue.7
    • Salcianu, A.1    Rinard, M.2
  • 28
    • 0002997049 scopus 로고    scopus 로고
    • Region-based memory management
    • M. Tofte, J.P. Talpin. Region-based memory management. Inf. Comput. 132(2): 109-176, 1997.
    • (1997) Inf. Comput , vol.132 , Issue.2 , pp. 109-176
    • Tofte, M.1    Talpin, J.P.2
  • 29
    • 33746269839 scopus 로고    scopus 로고
    • Optimized live heap bound analysis. VMCAI'03
    • L. Unnikrishnan, S.D. Stoller, Y.A. Liu. Optimized live heap bound analysis. VMCAI'03, LNCS 2575, 2003.
    • (2003) LNCS , vol.2575
    • Unnikrishnan, L.1    Stoller, S.D.2    Liu, Y.A.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.