More precise yet widely applicable cost analysis

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

Volumn 6538 LNCS, Issue , 2011, Pages 38-53

  Albert, Elvira ^a   Genaim, Samir ^a   Masud, Abu Naser ^b  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

^b UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CASE COST; COMPUTER ALGEBRA SYSTEMS; COST ANALYSIS; EXISTING METHOD; INPUT DATAS; LOWER BOUNDS; RECURRENCE EQUATION; UPPER AND LOWER BOUNDS;

ABSTRACTING; COST ACCOUNTING; COSTS; MODEL CHECKING; STRUCTURED PROGRAMMING;

COST BENEFIT ANALYSIS;

EID: 79251554363     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-18275-4_5     Document Type: Conference Paper

References (13)

1. Albert, E., Arenas, P., Genaim, S., Herraiz, I., Puebla, G.: Comparing cost functions in resource analysis. In: van Eekelen, M., Shkaravska, O. (eds.) FOPARA 2009. LNCS, vol. 6324, pp. 1-17. Springer, Heidelberg (2010)
2. Albert, E., Arenas, P., Genaim, S., Puebla, G.: Closed-Form Upper Bounds in Static Cost Analysis. Journal of Automated Reasoning (to appear, 2010)
3. 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)
4. Bagnara, R., Pescetti, A., Zaccagnini, A., Zaffanella, E.: PURRS: Towards Computer Algebra Support for Fully AutomaticWorst-Case Complexity Analysis. Technical report (2005), arXiv:cs/0512056, http://arxiv.org/
5. Ben-Amram, A.M.: Size-change termination, monotonicity constraints and ranking functions. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 109-123. Springer, Heidelberg (2009)
6. Feautrier, P., Alias, C., Darte, A., Gonnord, L.: Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs. In: Cousot, R., Martel, M. (eds.) SAS 2010. LNCS, vol. 6337, pp. 117-133. Springer, Heidelberg (2010)
7. Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Proc. POPL. ACM, New York (1978)
8. Crary, K., Weirich, S.: Resource bound certification. In: POPL 2000. ACM Press, New York (2000)
9. 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)
10. Hoffmann, J., Hofmann, M.: Amortized resource analysis with polynomial potential. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol. 6012, pp. 287-306. Springer, Heidelberg (2010)
11. Marriot, K., Stuckey, P.: Programming with Constraints: An Introduction. The MIT Press, Cambridge (1998)
12. Maxima.sourceforge.net. Maxima, a Computer Algebra System. Version 5.21.1 (2009), http://maxima.sourceforge.net/
13. Wegbreit, B.: Mechanical Program Analysis. Communications of the ACM 18(9) (1975)