Generating and Solving Recurrence Relations in Cost Analysis – Københavns Universitet

Videresend til en ven Resize Print kalender-ikon Bookmark and Share

Datalogisk Institut, DIKU > Begivenhedsmappen > Begivenheder 2011 > Generating and Solving...

Generating and Solving Recurrence Relations in Cost Analysis

 

COPLAS Talk:

[PLEASE NOTE CHANGE IN TIME AND LOCATION!]

Generating and Solving Recurrence Relations in Cost Analysis

Samir Genaim
Universidad Complutense de Madrid

Friday, November 4th, 2011, 11:00 - 12:00
DIKU, Universitetsparken 1, Room 3-1-25

Abstract:

The classical approach to static cost analysis consists of two phases: In the first one the program is translated into a set of recurrence relations; and in the second phase they are solved into closed-form upper/lower bounds. In this presentation we will discuss several ways for generating cost relations, depending on the nature of cost we are interested in approximating, and several ways for solving them into closed form bounds, depending on the precision/performance we want to achieve.