Copenhagen Programming Language Seminar

Generating and Solving Recurrence Relations in Cost Analysis

Samir Genaim
Universidad Complutense de Madrid

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

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.

Scientific host: John Gallagher, RUC Administrative host:Jette Møller. All are welcome.
The Copenhagen Programming Language Seminar (COPLAS) is a collaboration between DIKU, DTU, ITU, and RUC.
COPLAS is part of the FIRST Research School.
To receive information about COPLAS talks by email, send a message to prog-lang-request@mail.it-c.dk with the word 'subscribe' as subject or in the body.

For more information about COPLAS, see http://www.coplas.org