DICE 2015: Call for papers

--e89a8ff254502f722e05085c69de
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: quoted-printable

[Apologies for cross-postings]


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=3Ddice2015

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 b=
e
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=C3=A9ment 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=C3=A9r=C3=A9e - LORIA Nancy
Marco Gaboardi (Chair) - University of Dundee
Jan Hoffmann - Yale University
Georg Moser - University of Innsbruck

--e89a8ff254502f722e05085c69de
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr">[Apologies for cross-postings]<br><br><br>CALL FOR PAPERS<=
br>
DICE 2015<br>
Sixth workshop on Developments in Implicit Computational Complexity<br>
<span tabindex=3D"0" class=3D""><span class=3D"">12 April 2015</span></span=
>, London, UK<br>
Affiliated to ETAPS<br>
<a href=3D"http://dice15.computing.dundee.ac.uk" target=3D"_blank">http://d=
ice15.computing.dundee.ac.uk</a><br>
<br>
DICE is a thematic workshop in the field of Implicit Computational Complexi=
ty,<br>
where researchers in the area can meet and discuss their most recent result=
s.<br>
It takes place annually as part of ETAPS.<br>
<br>
The area of Implicit Computational Complexity (ICC) has grown from several<=
br>
proposals for using logic and formal methods to provide languages for<br>
complexity-bounded computation (e.g. PTIME, LOGSPACE computation).<br>
Its aim is to study computational complexity without reference to external<=
br>
measuring conditions or particular machine models, but only in terms of lan=
guage<br>
restrictions or logical/computational principles implying complexity proper=
ties.<br>
<br>
DICE 2015 will be colocated with FOPARA. The colocation will be an<br>
occasion for strengthen the interactions between the community working<br>
on ICC and the one working more broadly on resource analysis.<br>
<br>
**Submissions**<br>
<br>
Authors are invited to submit an extended abstract of up to 5 pages by<br>
<span tabindex=3D"0" class=3D""><span class=3D"">January 30, 2015</span></s=
pan> to the DICE 2014 EasyChair page<br>
<a href=3D"https://easychair.org/conferences/?conf=3Ddice2015" target=3D"_b=
lank">https://easychair.org/conferences/?conf=3Ddice2015</a><br>
<br>
Accepted abstracts will be presented at the workshop.<br>
<br>
Abstracts must be written in English and be submitted as a single PDF file.=
<br>
<br>
Submissions will be judged on originality, relevance, interest and clarity.=
<br>
Accepted abstracts will be presented at the workshop. Abstract can contain<=
br>
material already published elsewhere before the workshop. Preference will b=
e<br>
given to abstracts containing novel work (including work in progress).<br>
<br>
The workshop will not have formal proceedings and is not intended to<br>
preclude later publication at another venue.<br>
<br>
**Important Dates**<br>
<br>
- <span tabindex=3D"0" class=3D""><span class=3D"">January 30, 2015</span><=
/span> - Abstract Submission<br>
<br>
- <span tabindex=3D"0" class=3D""><span class=3D"">February 12, 2015</span>=
</span> - Notification<br>
<br>
- <span tabindex=3D"0" class=3D""><span class=3D"">April 12, 2015</span></s=
pan> - Workshop<br>
<br>
<br>
**Topics**<br>
types for controlling complexity<br>
logical systems for implicit computational complexity<br>
linear logic<br>
semantics of complexity-bounded computation<br>
rewriting and termination orderings<br>
interpretation-based methods for implicit complexity<br>
programming languages for complexity-bounded computation<br>
theoretical foundations of program complexity analysis<br>
theoretical foundations of program complexity analysis<br>
application of implicit complexity to security<br>
<br>
**Invited Speakers**<br>
<br>
TBC<br>
<br>
**Program Committee**<br>
<br>
Cl=C3=A9ment Aubert - University of Paris 12<br>
Arnold Beckmann - Swansea University<br>
Norman Danner - Wesleyan University<br>
Ugo Dal Lago - University of Bologna<br>
Anupam Das - ENS Lyon<br>
Naohi Eguchi - Chiba University<br>
Hugo F=C3=A9r=C3=A9e - LORIA Nancy<br>
Marco Gaboardi (Chair) - University of Dundee<br>
Jan Hoffmann - Yale University<br>
Georg Moser - University of Innsbruck<br></div>

--e89a8ff254502f722e05085c69de--