ETAPS 2019
Sat 6 - Thu 11 April 2019 Prague, Czech Republic

The DICE workshop explores the area of Implicit Computational Com-plexity (ICC), which grew out from several proposals to use logic and for-mal methods to provide languages for complexity-bounded computation(e.g. Ptime, Logspace computation). It aims at studying the computational complexity of programs without referring to external measuringconditions or a particular machine model, but only by considering language restrictions or logical/computational principles entailing complexityproperties. Several approaches have been explored for that purpose, suchas restrictions on primitive recursion and ramification, rewriting systems,linear logic, types and lambda calculus, interpretations of functional andimperative programs.

The FOPARA workshop serves as a forum for presenting original research results that are relevant to the analysis of resource (e.g. time, space, en-ergy) consumption by computer programs. The workshop aims to bring together the researchers that work on foundational issues with the re-searchers that focus more on practical results. Therefore, both theoreticaland practical contributions are encouraged. We also encourage papersthat combine theory and practice.

Given the complementarity and the synergy between these two communities, and following the successful experiences of co-location of DICE-FOPARA at ETAPS 2015 in London and ETAPS 2017 in Uppsala, we will again hold these two workshops together at ETAPS 2019.

Call for Papers

This is a placeholder text.

You can expect more information about the call for papers soon.

This page will have information about the submission and selection process and list the important dates.