메뉴 건너뛰기




Volumn , Issue , 2010, Pages 121-130

Parametric inference of memory requirements for garbage collected languages

Author keywords

garbage collection; java bytecode; live heap space analysis; low level languages; peak memory consumption

Indexed keywords

GARBAGE COLLECTION; JAVA BYTE CODES; LOW-LEVEL LANGUAGE; MEMORY CONSUMPTION; SPACE ANALYSIS;

EID: 77954733872     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806651.1806671     Document Type: Conference Paper
Times cited : (26)

References (24)
  • 1
    • 37149044828 scopus 로고    scopus 로고
    • Cost Analysis of Java Bytecode
    • Rocco De Nicola, editor, 16th European Symposium on Programming, ESOP'07, Springer, March
    • E. Albert, P. Arenas, S. Genaim, G. Puebla, and D. Zanardini. Cost Analysis of Java Bytecode. In Rocco De Nicola, editor, 16th European Symposium on Programming, ESOP'07, volume 4421 of Lecture Notes in Computer Science, pages 157-172. Springer, March 2007.
    • (2007) Lecture Notes in Computer Science , vol.4421 , pp. 157-172
    • Albert, E.1    Arenas, P.2    Genaim, S.3    Puebla, G.4    Zanardini, D.5
  • 3
    • 70350701886 scopus 로고    scopus 로고
    • Live Heap Space Analysis for Languages with Garbage Collection
    • New York, NY, USA, June ACM Press
    • E. Albert, S. Genaim, and M. Gómez-Zamalloa. Live Heap Space Analysis for Languages with Garbage Collection. In 8th international symposium on Memory management, pages 129-138, New York, NY, USA, June 2009. ACM Press.
    • (2009) 8th International Symposium on Memory Management , pp. 129-138
    • Albert, E.1    Genaim, S.2    Gómez-Zamalloa, M.3
  • 4
    • 48949097684 scopus 로고    scopus 로고
    • Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
    • María Alpuente and Germán Vidal, editors, Static Analysis, 15th International Symposium, SAS 2008, Valencia, Spain, July 15-17, 2008, Proceedings, Springer-Verlag, July
    • Elvira Albert, Puri Arenas, Samir Genaim, and German Puebla. Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis. In María Alpuente and Germán Vidal, editors, Static Analysis, 15th International Symposium, SAS 2008, Valencia, Spain, July 15-17, 2008, Proceedings, volume 5079 of Lecture Notes in Computer Science, pages 221-237. Springer-Verlag, July 2008.
    • (2008) Lecture Notes in Computer Science , vol.5079 , pp. 221-237
    • Albert, E.1    Arenas, P.2    Genaim, S.3    Puebla, G.4
  • 7
    • 33746310302 scopus 로고    scopus 로고
    • A static analysis for synthesizing parametric specifications of dynamic memory consumption
    • V. Braberman, D. Garbervetsky, and S. Yovine. A static analysis for synthesizing parametric specifications of dynamic memory consumption. Journal of Object Technology, 5(5):31-58, 2006.
    • (2006) Journal of Object Technology , 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 Java
    • Brendon Cahoon and Kathryn S. McKinley. Data flow analysis for software prefetching linked data structures in Java. In IEEE PACT, pages 280-291, 2001.
    • (2001) IEEE PACT , pp. 280-291
    • Cahoon, B.1    McKinley, K.S.2
  • 9
    • 21644451309 scopus 로고    scopus 로고
    • Region analysis and transformation for java programs
    • ACM Press
    • S. Cherem and R. Rugina. Region analysis and transformation for java programs. In ISMM, pages 85-96. ACM Press, 2004.
    • (2004) ISMM , pp. 85-96
    • Cherem, S.1    Rugina, R.2
  • 10
    • 33646074545 scopus 로고    scopus 로고
    • Memory Usage Verification for OO Programs
    • Proc. of SAS'05
    • W.-N. Chin, H. H. Nguyen, S. Qin, and M. C. Rinard. Memory Usage Verification for OO Programs. In Proc. of SAS'05, volume 3672 of LNCS, pages 70-86, 2005.
    • (2005) LNCS , vol.3672 , pp. 70-86
    • Chin, W.-N.1    Nguyen, H.H.2    Qin, S.3    Rinard, M.C.4
  • 11
    • 57349128886 scopus 로고    scopus 로고
    • Analysing Memory Resource Bounds for Low-Level Programs
    • ACM Press
    • W-N. Chin, H.H. Nguyen, C. Popeea, and S. Qin. Analysing Memory Resource Bounds for Low-Level Programs. In ISMM. ACM Press, 2008.
    • (2008) ISMM
    • Chin, W.-N.1    Nguyen, H.H.2    Popeea, C.3    Qin, S.4
  • 12
    • 85035003357 scopus 로고    scopus 로고
    • Automatic discovery of linear restraints among variables of a program
    • P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In POPL, 1978.
    • POPL, 1978
    • Cousot, P.1    Halbwachs, N.2
  • 13
    • 35248867959 scopus 로고    scopus 로고
    • A compiler generator for constraint logic programs
    • S. Craig and M. Leuschel. A compiler generator for constraint logic programs. In Ershov Memorial Conference, pages 148-161, 2003.
    • (2003) Ershov Memorial Conference , pp. 148-161
    • Craig, S.1    Leuschel, M.2
  • 14
    • 67649876630 scopus 로고    scopus 로고
    • Speed: Precise and efficient static estimation of program computational complexity
    • ACM
    • S. Gulwani, K. K. Mehra, and T. M. Chilimbi. Speed: precise and efficient static estimation of program computational complexity. In POPL, pages 127-139. ACM, 2009.
    • (2009) POPL , pp. 127-139
    • Gulwani, S.1    Mehra, K.K.2    Chilimbi, T.M.3
  • 16
    • 70350376912 scopus 로고    scopus 로고
    • Efficient Type-Checking for Amortised Heap-Space Analysis
    • Proc. of CSL'09, Springer
    • M. Hofmann and D. Rodriguez. Efficient Type-Checking for Amortised Heap-Space Analysis. In Proc. of CSL'09, LNCS. Springer, 2009.
    • (2009) LNCS
    • Hofmann, M.1    Rodriguez, D.2
  • 18
    • 34547143748 scopus 로고    scopus 로고
    • Formal translation of bytecode into BoogiePL
    • ENTCS, Elsevier
    • H. Lehner and P. Müller. Formal translation of bytecode into BoogiePL. In Bytecode'07, ENTCS, pages 35-50. Elsevier, 2007.
    • (2007) Bytecode'07 , pp. 35-50
    • Lehner, H.1    Müller, P.2
  • 19
    • 0347303277 scopus 로고    scopus 로고
    • Logic Program Specialisation through Partial Deduction: Control Issues
    • July & September
    • M. Leuschel and M. Bruynooghe. Logic Program Specialisation through Partial Deduction: Control Issues. Theory and Practice of Logic Programming, 2(4 & 5):461-515, July & September 2002.
    • (2002) Theory and Practice of Logic Programming , vol.2 , Issue.4-5 , pp. 461-515
    • Leuschel, M.1    Bruynooghe, M.2
  • 21
    • 24344484825 scopus 로고    scopus 로고
    • Estimating the impact of heap liveness information on space consumption in java
    • ACM Press
    • R. Shaham, E. K. Kolodner, and S. Sagiv. Estimating the impact of heap liveness information on space consumption in java. In ISMM, pages 171-182. ACM Press, 2002.
    • (2002) ISMM , pp. 171-182
    • Shaham, R.1    Kolodner, E.K.2    Sagiv, S.3
  • 22
    • 70450227622 scopus 로고    scopus 로고
    • Parametric heap usage analysis for functional programs
    • ACM Press
    • L. Unnikrishnan and S. Stoller. Parametric heap usage analysis for functional programs. In Proc. of ISMM'09. ACM Press, 2009.
    • (2009) Proc. of ISMM'09
    • Unnikrishnan, L.1    Stoller, S.2
  • 24
    • 8344251741 scopus 로고    scopus 로고
    • Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
    • ACM
    • John Whaley and Monica S. Lam. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In PLDI, pages 131-144. ACM, 2004.
    • (2004) PLDI , pp. 131-144
    • Whaley, J.1    Lam, M.S.2


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