|
Descripción
|
|
|---|---|
| Cost analysis aims at determining the amount of resources required to run a program in terms of its input data sizes. Automatically inferring precise bounds, while at the same time being able to handle a wide class of programs, is a main challenge in cost analysis. (1) Existing methods which rely on computer algebra systems (CAS) to solve the obtained cost recurrence equations (CR) are very precise when applicable, but handle a very restricted class of CR. (2) Specific solvers developed for CR tend to sacrifice accuracy for wider applicability. In this paper, we present a novel approach to inferring precise upper and lower bounds on CR which, when compared to (1), is strictly more widely applicable while precision is kept and when compared to (2), is in practice more precise (obtaining even tighter complexity orders), keeps wide applicability and, besides, can be applied to obtain useful lower bounds as well. The main novelty is that we are able to accurately bound the worst-case/best-case cost of each iteration of the program loops and, then, by summing the resulting sequences, we achieve very precise upper/lower bounds. | |
|
Internacional
|
Si |
|
Nombre congreso
|
12th Verification, Model Checking, and Abstract Interpretation (VMCAI'11) |
|
Tipo de participación
|
960 |
|
Lugar del congreso
|
Austin, Texas, USA |
|
Revisores
|
Si |
|
ISBN o ISSN
|
978-3-642-18274-7 |
|
DOI
|
|
|
Fecha inicio congreso
|
23/01/2011 |
|
Fecha fin congreso
|
25/01/2011 |
|
Desde la página
|
38 |
|
Hasta la página
|
53 |
|
Título de las actas
|
Verification, Model Checking, and Abstract Interpretation |