[Proof Complexity] DICE 2015: call for papers - London, 12/4/2015

Arnold Beckmann a.beckmann at swansea.ac.uk
Mon Jan 12 23:02:27 CET 2015

DICE 2015
Sixth workshop on Developments in Implicit Computational complExity
12 April 2015, London, UK
Affiliated to ETAPS

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.

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.

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


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 

**Important Dates**

-January 30, 2015 - Abstract Submission

-February 12, 2015 - Notification

-April 12, 2015 - Workshop

types for controlling complexity
logical systems for implicit computational complexity
linear logic
semantics of complexity-bounded computation
rewriting and termination orderings
interpretation-based methods for implicit complexity
programming languages for complexity-bounded computation
theoretical foundations of program complexity analysis
theoretical foundations of program complexity analysis
application of implicit complexity to security

**Invited Speakers**

Jakob Grue Simonsen - DIKU

Another invited speaker joint with FOPARA'15 to be confirmed.

**Program Committee**

Clement Aubert - University of Paris 12
Arnold Beckmann - Swansea University
Norman Danner - Wesleyan University
Ugo Dal Lago - University of Bologna
Anupam Das - ENS Lyon
Naohi Eguchi - Chiba University
Hugo Feree - LORIA Nancy
Marco Gaboardi (Chair) - University of Dundee
Jan Hoffmann - Yale University
Georg Moser - University of Innsbruck

More information about the Proof-Complexity mailing list