6-7 Apr 2019
Prague, Czech Republic
CALL FOR PAPERS
DICE-FOPARA 2019
Joint international workshop on Developments in Implicit Computational
complExity and Foundational and Practical Aspects of Resource Analysis
6-7 April 2019, Prague; Satellite event of ETAPS 2019
https://conf.researchr.org/track/etaps-2019/dice-fopara-2019-papers
** OBJECTIVES **
The joint DICE-FOPARA workshop provides synergies by combining two
complementary communities:
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. Several approaches have been explored for that purpose, such
as restrictions on primitive recursion and ramification, rewriting
systems, linear logic, types and lambda calculus, interpretations of
functional and imperative 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,
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.
The joint DICE-FOPATA workshop at ETAPS 2019 follows the successful
experiences of co-location of DICE-FOPARA at ETAPS 2015 in London and
ETAPS 2017 in Uppsala.
** TOPICS **
The joint 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;
- programming languages for complexity-bounded computation;
- logics closely related to complexity classes;
- theoretical foundations of program complexity analysis;
- static resource analysis and practical applications;
- resource analysis by term and graph rewriting.
- semantics of complexity-bounded computation;
- applications of implicit complexity to security;
- termination and resource analysis for probabilistic programs;
- semantic methods to analyse resources, including quasi-interpretations;
- practical applications of resource analysis;
** SUBMISSIONS **
We ask for submission of regular papers describing original work (up to 15
pages) or extended abstracts (up to 5 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 to
submissions of extended abstracts, the goal is to provide a forum for
discussing work in progress, but presentations of already published
results are also welcome, provided those are within the scope of the
workshop and potentially give rise to lively discussions during the
meeting.
A special issue of an international journal devoted to the joint workshop
may be proposed. In this case, the CFP will be posted after the workshop
and will be open to long versions of papers presented at this venue, as
well as other submissions relevant to the scientific scope.
Papers must be prepared using the LaTeX EPTCS style
(http://style.eptcs.org/). Papers should be submitted electronically via
the easychair submission page:
https://easychair.org/conferences/?conf=dicefopara2019
** IMPORTANT DATES **
Paper Submission -- January 31st, 2019
Author Notification -- February 21st, 2019
Final Version -- February 28th, 2019
Workshop -- April 6th and 7th, 2019
** PROGRAM COMMITTEE **
Chairs:
Steffen Jost, LMU, Munich, DE
Thomas Seiller, CNRS, LIPN, Villetaneuse, FR
Progam Committee:
Robert Atkey, University of Strathclyde, Glasgow, UK
Martin Avanzini, INRIA, Sophia Antipolis, FR
Lennart Beringer, Princeton University, US
Ezgi Cicek, Facebook, London, UK
Lukasz Czajka, TU Dortmund, DE
Ankush Das, Carnegie Mellon University, Pittsburgh, US
Hugo Feree, University of Kent, UK
Samir Genaim, Universidad Complutense de Madrid, ES
Hans-Wolfgang Loidl, Heriot-Watt University, Edinburgh, UK
Joanna Ochremiak, University of Cambridge, UK
Romain Pechoux, Université de Lorraine, FR
Paolo Pistone, Universität Tübingen, DE
Pedro Vasconcelos, University of Porto, PT
Margherita Zorzi, Università degli Studi di Verona, IT
--
[LOGIC] mailing list
http://www.dvmlg.de/mailingliste.html
Archive: http://www.illc.uva.nl/LogicList/
provided by a collaboration of the DVMLG, the Maths Departments in Bonn and Hamburg, and the ILLC at the Universiteit van Amsterdam