Using Combined Static Analysis and Profiling for Logic Program Execution Time Estimation
Predicting statically the running time of programs has many applications ranging from task scheduling in parallel execution to proving the ability of a program to meet strict time constraints. A starting point in order to attack this problem is to infer the computational complexity of such programs (or fragments thereof). This is one of the reasons why the development of static analysis techniques for inferring cost-related properties of programs (usually upper and/or lower bounds of actual costs) has received considerable attention.
KeywordsExecution Time Logic Program Cost Model Task Schedule Static Analysis Technique
- 3.Debray, S.K., López-García, P., Hermenegildo, M., Lin, N.-W.: Lower Bound Cost Estimation for Logic Programs. In: 1997 International Logic Programming Symposium, pp. 291–305. MIT Press, Cambridge (1997)Google Scholar
- 4.Hermenegildo, M., Albert, E., López-García, P., Puebla, G.: Abstraction Carrying Code and Resource-Awareness. In: Proc. of PPDP 2005. ACM Press, New York (2005)Google Scholar
- 7.Mera, E., López-García, P., Puebla, G., Carro, M., Hermenegildo, M.: Towards Combining Static Analysis and Profiling for Estimating Execution Times in Logic Programs. Technical Report CLIP5/2006.0, Technical University of Madrid (UPM), School of Computer Science, UPM (April 2006)Google Scholar