Comparing cost functions in resource analysis

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

Volumn 6324 LNCS, Issue , 2010, Pages 1-17

  Albert, Elvira ^a   Arenas, Puri ^a   Genaim, Samir ^a   Herraiz, Israel ^b   Puebla, German ^b  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

^b UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATICALLY GENERATED; AVERAGE-CASE; NON-LINEAR; PROGRAM SYNTHESIS; SUB-EXPRESSIONS; SUFFICIENT CONDITIONS; AVERAGE CASE; LOWER BOUNDS; REALISTIC PROJECTS; RESOURCE ANALYSIS; RESOURCE USAGE;

COST FUNCTIONS; COSTS; EXPONENTIAL FUNCTIONS; APPLICATION PROGRAMS;

COST BENEFIT ANALYSIS;

EID: 78149381640     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15331-0_1     Document Type: Conference Paper

References (12)

1. Albert, E., Arenas, P., Genaim, S., Puebla, G.: Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis. In: Alpuente, M., Vidal, G. (eds.) SAS 2008. LNCS, vol. 5079, pp. 221-237. Springer, Heidelberg (2008)
2. Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: Cost Analysis of Java Bytecode. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 157-172. Springer, Heidelberg (2007)
3. Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2007. LNCS, vol. 5382, pp. 113-133. Springer, Heidelberg (2008)
4. Braberman, V., Fernández, F., Garbervetsky, D., Yovine, S.: Parametric Prediction of Heap Memory Requirements. In: ISMM. ACM Press, New York (2008)
5. Chin, W.-N., Nguyen, H.H., Popeea, C., Qin, S.: Analysing Memory Resource Bounds for Low-Level Programs. In: ISMM. ACM Press, New York (2008)
6. Cousot, P., Cousot, R.: Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In: POPL'77, pp. 238-252. ACM, New York (1977)
7. Gulavani, B.S., Gulwani, S.: A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 370-384. Springer, Heidelberg (2008)
8. Gulwani, S., Mehra, K.K., Chilimbi, T.M.: Speed: precise and efficient static estimation of program computational complexity. In: POPL, pp. 127-139. ACM, New York (2009)
9. Kirkpatrick Jr., S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671-680 (1983)
10. Navas, J., Méndez-Lojo, M., Hermenegildo, M.: User-Definable Resource Usage Bounds Analysis for Java Bytecode. In: BYTECODE, Elsevier, Amsterdam (2009)
11. Jolden Suite, http://www-ali.cs.umass.edu/DaCapo/benchmarks.html
12. Wegbreit, B.: Mechanical Program Analysis. Communications of the ACM 18(9) (1975)