12 Apr 2015
London, England
CALL FOR PAPERS DICE 2015 Sixth workshop on Developments in Implicit Computational Complexity 12 April 2015, London, UK Affiliated to ETAPS http://dice15.computing.dundee.ac.uk 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 analysis. **Submissions** Authors are invited to submit an extended abstract of up to 5 pages by January 30, 2015 to the DICE 2014 EasyChair page https://easychair.org/conferences/?conf=dice2015 Accepted abstracts will be presented at the workshop. 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. **Important Dates** - January 30, 2015 - Abstract Submission - February 12, 2015 - Notification - April 12, 2015 - Workshop **Topics** 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** TBC **Program Committee** Clément 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 Férée - LORIA Nancy Marco Gaboardi (Chair) - University of Dundee Jan Hoffmann - Yale University Georg Moser - University of Innsbruck Clément Aubert / Nouvelles adresses : | Université Paris-Est, LACL (EA 4219), UPEC | clement.aubert@lacl.fr <mailto:clement.aubert@lacl.fr> \ http://lacl.fr/~caubert/ <http://lacl.fr/~caubert/>