Programme of DICE at ETAPS 2010

(Developments in Implicit Computational Complexity)

Saturday, March 27

09:30 - 10:30 SESSION 1: Invited Talk

A.Ben-Amram. On decidable growth-rate properties of imperative programs.

10:30 - 11:00 Coffee Break

11:00 - 12:30 SESSION 2

General Ramied Recurrence is Sound for Polynomial Time

U. Dal Lago, S. Martini and M. Zorzi

Non confluence in implicit complexity characterizations

G. Bonfante

12:30 - 14:00 Lunch

14:00 - 16:00 SESSION 3

Controlling program extraction in Elementary Linear Logic

M. Lasson

A Categorical Construction for Linear Logic by Levels

P. Boudes, D. Mazza, L. Tortora de Falco

TBA

S. Ronchi Della Rocca

Can Resource Calculus Be Resource Conscious?

M. Gaboardi, M. Pagani

16:00 - 16:30 Coffee Break

16:30 - 17:30 SESSION 4

PTIME + a distributive law = PSPACE

B. Redmond

Experiments on logspace-programming with IntML

U. Dal Lago, U. Schopp