Developments in Implicit Computational Complexity : DICE

Series of workshops

DICE is a thematic workshop in the field of Implicit Computational Complexity and related topics, where researchers can meet and discuss their most recent results. It takes place annually as part of ETAPS.

Upcoming event

DICE & FOPARA 2017 @ Uppsala, Sweden.

Scope and Topic

The area of Implicit Computational Complexity (ICC) has grown from several proposals for using logic and formal methods to provide languages for complexity-bounded computation (e.g. PTIME, LOGSPACE computation). Its aim is to study computational complexity without reference to external measuring conditions or particular machine models, but only in terms of language restrictions or logical/computational principles implying complexity properties.

This workshop focuses on ICC methods related to programs (rather than descriptive methods). In this approach one relates complexity classes to restrictions on programming paradigms (functional programs, lambda calculi, rewriting systems), such as ramified recurrence, weak polymorphic types, linear logic and linear types, and interpretative measures. The two main objectives of this area are:

Therefore ICC is related on one hand to the study of complexity classes, and on the other hand to static program analysis.

Steering Committee

Past events

Special issues of journals

Starting from the 2014 edition, journal special issues are biannual, collecting every odd year some extended versions of contributions of the previous two years.