posted by user: aubert || 923 views || tracked by 3 users: [display]

DICE 2015 : Developments in Implicit Computational Complexity


When Apr 12, 2015 - Apr 12, 2015
Where London, UK
Submission Deadline Jan 30, 2015
Notification Due Feb 12, 2015

Call For Papers

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 analysis.


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

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

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**


**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

Related Resources

Big Data 2016   International Conference on Big Data
COMPLEXIS 2017   2nd International Conference on Complexity, Future Information Systems and Risk
ACL 2017   The 55th annual meeting of the Association for Computational Linguistics
ESANN 2017   25th European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning
IJCSITCE 2016   International Journal of Computational Science, Information Technology and Control Engineering
IWCLUL 2017   International Workshop for Computational Linguistics of Uralic Languages
STOC 2017   Symposium on the Theory of Computing
JGRJ 20th annual symposium 2017   The Journal of Gender, Race & Justice 20th annual symposium:Structurally (Un)sound: Implicit Unfairness in Legal Procedure and Protocol, and Disproportionate Impacts on Marginalize
FOCS 2016   57th Annual IEEE Symposium on Foundations of Computer Science
CVIU 2016   Special Issue on Vision and Computational Photography and Graphics