|
Descripción
|
|
|---|---|
| For some applications, standard resource analyses do not provide the information required. Such analyses estimate the total resource usage of a program (without executing it) as functions on input data sizes. However, some applications require knowing how such total resource usage is distributed over selected parts of a program. We propose a novel, general, and flexible framework for setting up cost equations/relations which can be instantiated for performing a wide range of resource usage analyses, including both static profiling and the inference of the standard notion of cost. We extend and generalize standard resource analysis techniques, so that the relations generated include additional Boolean control variables for switching on or off different terms in the relations, as required by the desired resource usage profile. We also instantiate our framework to perform static profiling of accumulated cost (also parameterized by input data sizes). Such information is much more useful to the software developer than the standard notion of cost: it identifies the parts of the program that have the greatest impact on the total program cost, and which therefore should be optimized first. We also report on an implementation of our framework within the CiaoPP system, and its instantiation for accumulated cost, and provide some experimental results. In addition to generality, our new method brings important advantages over our previous approach based on a program transformation, including support for non-deterministic programs, better and easier integration in the compiler, and higher efficiency. | |
|
Internacional
|
Si |
|
Nombre congreso
|
19th International Workshop on Logic and Computational Complexity (LCC 2018) |
|
Tipo de participación
|
960 |
|
Lugar del congreso
|
Oxford, England |
|
Revisores
|
Si |
|
ISBN o ISSN
|
|
|
DOI
|
10.1017/S1471068416000442 |
|
Fecha inicio congreso
|
13/07/2018 |
|
Fecha fin congreso
|
13/07/2018 |
|
Desde la página
|
849 |
|
Hasta la página
|
865 |
|
Título de las actas
|
Proceedings of the 19th International Workshop on Logic and Computational Complexity (LCC 2018) |