Full text
Preview |
PDF
- Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (676kB) | Preview |
Albert Albiol, Elvira and Genaim, Samir and Gomez Zamalloa, Miguel and Arenas Sánchez, Purificación and Puebla Sánchez, Alvaro Germán and Zanardini, Damiano (2009). Upper Bounds on Memory Usage for Garbage-Collected Languages. In: "1st Workshop on Quantitative Analysis of Software, QA'09 (co-located with CAV 2009)", 26/06/2009 - 02/07/2009, Grenoble, France.
Title: | Upper Bounds on Memory Usage for Garbage-Collected Languages |
---|---|
Author/s: |
|
Item Type: | Presentation at Congress or Conference (Article) |
Event Title: | 1st Workshop on Quantitative Analysis of Software, QA'09 (co-located with CAV 2009) |
Event Dates: | 26/06/2009 - 02/07/2009 |
Event Location: | Grenoble, France |
Title of Book: | Proceedings of 1st Workshop on Quantitative Analysis of Software (QA'09) |
Date: | 2009 |
Subjects: | |
Faculty: | Facultad de Informática (UPM) |
Department: | Lenguajes y Sistemas Informáticos e Ingeniería del Software |
Creative Commons Licenses: | Recognition - No derivative works - Non commercial |
Preview |
PDF
- Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (676kB) | Preview |
Cost Analysis is the automatic study of program efficiency (or the resource consumption). ◮ Its aim is to statically estimate the cost of a program execution in terms of the size of its input args. Cost Analysis is the automatic study of program efficiency (or the resource consumption). ◮ Its aim is to statically estimate the cost of a program execution in terms of the size of its input args. The cost can be defined w.r.t. different cost models: ◮ number of instructions executed ◮ memory allocated ◮ number calls to certain methods: billable events on a mobile.
Item ID: | 5695 |
---|---|
DC Identifier: | https://oa.upm.es/5695/ |
OAI Identifier: | oai:oa.upm.es:5695 |
Official URL: | http://www.eecs.berkeley.edu/~sseshia/qa09/ |
Deposited by: | Memoria Investigacion |
Deposited on: | 13 Jan 2011 08:54 |
Last Modified: | 20 Apr 2016 14:26 |