[ The Types Forum (announcements only),
http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]
======================================================================
Call for Papers
THEORETICAL COMPUTER SCIENCE
Special Issue on Implicit Computational Complexity
(open post-conference publication of the workshops DICE 2016, 2017
and 2018)
Deadline: October 12th 2018
Guest Editors:
Martin Avanzini <martin.avanz...@inria.fr>
Romain Péchoux <romain.pech...@loria.fr>
======================================================================
The area of Implicit Computational Complexity has grown from several proposals
for using logic and formal methods to provide languages for complexity-bounded
computation (such as polynomial time, polynomial space or logarithmic space
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.
We welcome contributions on various aspects of Implicit Computational
Complexity,
including (but not exclusively) the following topics:
- types for controlling / inferring / checking complexity
- logical systems for implicit computational complexity
- programming languages for complexity bounded computation
- logics closely related to complexity classes
- static resource analysis and practical applications
- semantics of complexity-bounded computation
- application of implicit complexity to security
- rewriting and termination orderings
- termination and resource analysis for probabilistic programs
- semantic methods to analyse resources
This special issue of Theoretical Computer Science follows the informal
workshops on Developments in Implicit Computational Complexity (DICE), DICE 2016
in Eindhoven (http://lipn.univ-paris13.fr/DICE2016/), DICE 2017 in Uppsala
(http://cbr.uibk.ac.at/events/dice-fopara/) and DICE 2018 in Thessaloniki
(http://cl-informatik.uibk.ac.at/users/zini/events/dice18).
Submission to this special issue is open to everyone, including those who did
not participate in the above editions of DICE.
DICE workshops have been held annually as satellite events of ETAPS: DICE 2010
in Paphos, DICE 2011 in Saarbrücken, DICE 2012 in Tallinn, DICE 2013 in Rome,
DICE 2014 in Grenoble, DICE 2015 in London, DICE 2016 in Eindhoven, DICE 2017 in
Uppsala and DICE 2018 in Thessaloniki. Previous post-conference publications
have appeared in
- Information & Computation for DICE 2011,
- Theoretical Computer Science for DICE 2012,
- Information & Computation for DICE 2013,
- Information & Computation for DICE 2014 & 2015.
More information on the DICE workshop series is available at:
http://perso.ens-lyon.fr/patrick.baillot/DICE
Theoretical Computer Science solicits high quality papers reporting research
results related to the topics mentioned above. All papers must be original,
unpublished, and not submitted for publication elsewhere. All manuscripts and
any supplementary material should be submitted through Elsevier Editorial System
(EES). The authors must select as “SI:DICE” when they reach the “Article Type”
step in the submission process. The EES submission website is located at:
http://ees.elsevier.com/tcs/default.asp
All papers will be peer-reviewed by three independent reviewers. Requests for
additional information should be addressed to the guest editors. A detailed
submission guideline is available as “Guide to Authors” at:
http://www.journals.elsevier.com/theoretical-computer-science
Submissions must be submitted no later than October 12th 2018. We are aiming
for a turnaround of no more than eight months.
