Publication: Non-Cumulative Resource Analysis (Author’s version)
Loading...
Full text at PDC
Publication Date
2015
Advisors (or tutors)
Editors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Citations
Exportar
Abstract
Existing cost analysis frameworks have been defined for cumulative resources which keep on increasing along the computation. Traditional cumulative resources are execution time, number of executed steps, amount of memory allocated, and energy consumption. Noncumulative resources are acquired and (possibly) released along the execution. Examples of non-cumulative cost are memory usage in the presence of garbage collection, number of connections established that are later closed, or resources requested to a virtual host which are released after using them. We present, to the best of our knowledge, the first generic static analysis framework to infer an upper bound on the peak cost for non-cumulative types of resources. Our analysis comprises several components: (1) a pre-analysis to infer when resources are being used simultaneously, (2) a program-point resource analysis which infers an upper bound on the cost at the points of interest (namely the points where resources are acquired) and (3) the elimination from the upper bounds obtained in (2) of those resources accumulated that are not used simultaneously. We report on a prototype implementation of our analysis that can be used on a simple imperative language.
Description
Publicado en Lecture Notes in Computer Science, vol. 9035
UCM subjects
Unesco subjects
Keywords
Citation
1. E. Albert, P. Arenas, A. Flores-Montoya, S. Genaim, M. Gómez-Zamalloa, E. Martin-Martin, G. Puebla, and G. Román-Díez. SACO: Static Analyzer for Concurrent Objects. In TACAS'14, vol. 8413 of LNCS, pp 562-567. 2014.
2. E. Albert, P. Arenas, S. Genaim, G. Puebla, and D. Zanardini. Cost Analysis of Java Bytecode. In SOP'07, vol. 4421 of LNCS, pp 157-172. Springer, 2007.
3. E. Albert, J. Correas, and G. Rom_an-Díez. Peak Cost Analysis of Distributed Systems. In SAS'14, vol. 8723 of LNCS, pp 18-33. Springer, 2014. 15
4. E. Albert, A. Flores-Montoya, and S. Genaim. Analysis of May-Happen-in-Parallel in Concurrent bjects. In FORTE'12, vol. 7273 of LNCS, pp 35-51. Springer, 2012.
5. E. Albert, S. Genaim, and M. G_omez-Zamalloa. Parametric Inference of Memory Requirements for Garbage Collected Languages. In ISMM'10, pp 121-130. 2010.
6. D. E. Alonso-Blas and S. Genaim. On the Limits of the Classical Approach to Cost Analysis. In SAS 2012, vol. 7460 of LNCS, pp 405-421. Springer, 2012.
7. V. Braberman, F. Fern_andez, D. Garbervetsky, and S. Yovine. Parametric Prediction of Heap Memory Requirements. In ISMM'08, pp 141-150. ACM, 2008.
8. V. A. Braberman, D. Garbervetsky, S. Hym, and S. Yovine. Summary-based inference of quantitative bounds of live heap objects. SCP, 92:56-84, 2014.
9. A. Flores-Montoya and R. Hähnle. Resource analysis of complex programs with cost equations. In APLAS'14, vol. 8858 of LNCS, pp 275-295. Springer, 2014.
10. S. Gulwani, K. K. Mehra, and T. M. Chilimbi. Speed: Precise and Eficient Static Estimation of Program Computational Complexity. In POPL'09, pp 127-139. ACM, 2009.
11. M. Hofmann and S. Jost. Static prediction of heap space usage for first-order functional programs. In POPL'13, pp 185-197. ACM, 2003.
12. E. B. Johnsen, R. Hähnle, J. Schäfer, R. Schlatte, and M. Ste_en. ABS: A Core Language for Abstract Behavioral Specification. In FMCO'10 (Revised Papers), vol. 6957 of LNCS, pp 142-164. Springer, 2012.
13. Moritz Sinn, Florian Zuleger, and Helmut Veith. A simple and scalable static analysis for bound analysis and amortized complexity analysis. In Proc. of CAV'14, volume 8559, pages 745-761. Springer, 2014.
14. P. W. Trinder, M. I. Cole, K. Hammond, H.W. Loidl, and G. Michaelson. Resource analyses for parallel and distributed coordination. CCPE, 25(3):309-348, 2013.
15. John Whaley and Monica S. Lam. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In PLDI, pages 131{144. ACM, 2004.