Program DICE-FOPARA 2015

Saturday 11 April 2015 -- [TACLe session 9h30-12h30]

9:30 - 10:30

Structure, Semantics and Speedup: Reasoning about Structured Parallel Programs using Dependent Types
Kevin Hammond - Invited speaker.
10:30 - 11:00
Coffee Break
11:00 - 12:30

May-Happen-in-Parallel Analysis with Condition Synchronization,
Elvira Albert, Antonio E. Flores Montoya and Samir Genaim.
A Dependent Type System for Energy Consumption Analysis,
Bernard van Gastel, Rody Kersten and Marko van Eekelen.
Implicit computational complexity in Object Oriented Programs,
Emmanuel Hainry and Romain Péchoux.
12:30 - 14:30
Lunch Break
14:30 - 16:00

Higher-Order Complexity Analysis: Harnessing First-Order Tools
Martin Avanzini, Ugo Dal Lago and Georg Moser
Higher order interpretations for Basic Feasible Functions,
Emmanuel Hainry and Romain Péchoux.
Complexity bounds from abstract categorical models,
Dominic Orchard.
16:00 - 16:30
Coffee Break
16:30 - 17:30

Cons-free Term Rewriting and Complexity Classes
Jakob Grue Simonsen - Invited speaker.

Sunday 12 April 2015

9:30 - 10:30

Intersection Types and Implicit Computational Complexity
Simona Ronchi Della Rocca - Invited speaker.
10:30 - 11:00
Coffee Break
11:00 - 12:30

Extensional filters reveal algorithms,
Guillaume Bonfante, Jean-Yves Moyen and Pierre Boudes.
An algorithmic complete programming language for a large class of algorithms computable in polynomial time,
Pierre Valarcher and Yoann Marquer.
An in-between “implicit” and “explicit” complexity: Automata,
Clément Aubert.
12:30 - 14:00
Lunch Break
14:00 - 16:00

Towards a Complexity-through-Realizability Theory
Thomas Seiller.
The probabilistic class PP,
Reinhard Kahle and Isabel Oitavem.
Implicit Computational Complexity of Subrecursive Cryptographic Reductions,
Patrick Baillot, Gilles Barthe and Ugo Dal Lago.
On Robinson style simplifications to the traditional bounded recursion on notation scheme,
Jostein Aanderaa.
16:00 - 16:30
Coffee Break
16:30 - 17:30

Type-based analysis of incremental computational complexity
Deepak Garg - Invited speaker.


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

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. Traditionally, 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.

DICE 2015 will be colocated with FOPARA. The colocation will be an occasion for strengthen the interactions between the community working onICC and the one working more broadly on resource analysis.

The workshop will be open to contributions on various aspects of ICC including (but not exclusively):


Authors are invited to submit an extended abstract of up to 5 pages by January 30, 2015 to the DICE 2015 EasyChair page.

Abstracts must be written in English and be submitted as a single PDF file.

Submissions will be judged on originality, relevance, interest and clarity. Accepted abstracts will be presented at the workshop. Abstract can contain material already published elsewhere before the workshop. Preference will be given to abstracts containing novel work (including work in progress).

The workshop will not have formal proceedings and is not intended to preclude later publication at another venue. Nevertheless, we plan to have a joint journal special issue for DICE 2014 and DICE 2015 if the number and quality of submissions will be of an high standard.

Submissions of abstracts by PC members are allowed and encouraged.

Previous Workshops and Special Issues

Information about previous instances of the workshop and special issues of journals can be found at the homepage of the DICE workshop series.

Invited Speakers

Important Dates

Abstract Submission
January 30, 2015
February 12, 2015
April 12, 2015

Program Committee

Steering Committee


Call for Papers: txt