The first joint international workshop on Developments in Implicit Computational complExity (DICE) and FOundational and Practical Aspects of Resource Analysis (FOPARA) will be held in Uppsala, Sweden, from April 22-23, 2017 as part of ETAPS.
The DICE workshop explores the area of Implicit Computational Complexity (ICC), which grew out from several proposals to use logic and formal 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 measuring conditions or a particular machine model, but only by considering language restrictions or logical/computational principles entailing complexity properties.
The FOPARA workshop serves as a forum for presenting original research results that are relevant to the analysis of resource (e.g. time, space, energy) consumption by computer programs. The workshop aims to bring together the researchers that work on foundational issues with the researchers that focus more on practical results. Therefore, both theoretical and practical contributions are encouraged. We also encourage papers that combine theory and practice.
Given the complementarity and the synergy between these two communities, and following the successful experience of co-location of DICE-FOPARA 2015 in London at ETAPS 2015, we will hold the 8th Workshop on DICE and the 5th Workshop on FOPARA together at ETAPS 2017.
The workshop serves as a forum for presenting original and established research results that are relevant to the implicit computational complexity theory and to the analysis of resource (e.g. time, space, energy) consumption by computer programs. The workshop aims to bring together the researchers that work on foundational issues with the researchers that focus more on practical results. Therefore, both theoretical and practical contributions are encouraged, as well as papers that combine theory and practice.
Areas of interest to the workshop include, but are not limited to, the following:
- type systems for controlling/inferring/checking complexity
- logical and machine-independent characterisations of complexity classes
- logics closely related to complexity classes
- 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
- application of implicit complexity to security
- resource static analysis for embedded or/and critical systems;
- semantic methods to analyse resources, including quasi-interpretations;
- practical applications of resource analysis;
- resource analysis by term and graph rewriting.
We ask for submission of regular papers describing original work (10-15 pages) or extended abstracts (2-6 pages) presenting already published work or work in progress.
With respect to regular papers, submissions will be in particular verified for originality and novelty and the manuscript must not have been already published, nor is presently submitted, elsewhere. With respect of submissions of extended abstracts already published manuscripts are acceptable, but have to be within the scope of the workshop and potentially give rise to lively discussions during the meeting.
After the workshop we plan to edit a special issue of DICE-FOPARA 2017 in a renown journal in conjunction with the 7th Workshop on Developments in Implicit Computational complExity (DICE 2016).
Regular papers must be prepared using the LaTeX EPTCS class (see http://eptcs.org/). Accepted regular papers will appear in an EPTCS volume (application pending). Papers should be submitted electronically via the easychair submission page.