Complexity Theory.

Within theoretical computer science it is traditionally complexity theory which deals with the problem of resource consumption, e.g. how much time and memory is needed in the worst or average case. Our aim is to address similar problems from a semantical point of view, utilising static analysis techniques in order to investigate quantitative and probabilistic properties of programs. In doing this we hope to start bridging the separation between semantics and complexity theory. Not least the splitting of the Handbook of Theoretical Computer Science [67] into two parts on semantics and complexity theory illustrates a big cultural and methodological gap between these two fields.