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

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.

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.


Accepted papers are preliminarily made available at www.tcs.ifi.lmu.de/research/dice-fopara2019

Accepted Papers

Title
Applications of Linear Defeasible Logic: combining resource consumption and exceptions to energy management and business processes
DICE-FOPARA
Finite semantics of polymorphism, complexity and the power of type fixpoints
DICE-FOPARA
From normal functors to logarithmic space queries
DICE-FOPARA
Hierarchical Digging is EXPTIME
DICE-FOPARA
Modular Runtime Complexity Analysis of Probabilistic While Programs
DICE-FOPARA
PRAMs over integers do not compute maxflow efficiently
DICE-FOPARA
Pointers in Recursion: Exploring the Tropics
DICE-FOPARA
Tiered complexity at higher order
DICE-FOPARA
Towards a Sheaf-Theoretic Definition of Decision Problems
DICE-FOPARA
Type-Based Resource Analysis on Haskell
DICE-FOPARA
Type-two Iteration with Bounded Query Revision
DICE-FOPARA

Call for 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 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;
  • semantics of complexity-bounded computation;
  • applications of implicit complexity to security;
  • termination and resource analysis for probabilistic programs;
  • semantic methods to analyse resources;
  • 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.

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

Dates
You're viewing the program in a time zone which is different from your device's time zone - change time zone

Conference Day
Sat 6 Apr

Displayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

09:00 - 10:30
IDICE-FOPARA at S11
Chair(s): Steffen JostLMU, Munich, Germany
09:45
45m
Talk
PRAMs over integers do not compute maxflow efficiently
DICE-FOPARA
11:00 - 12:00
IIDICE-FOPARA at S11
Chair(s): Steffen JostLMU, Munich, Germany
11:00
45m
Talk
Towards a Sheaf-Theoretic Definition of Decision Problems
DICE-FOPARA
13:30 - 15:30
IIIDICE-FOPARA at S11
Chair(s): Patrick BaillotCNRS & ENS Lyon
14:00
45m
Talk
Type-two Iteration with Bounded Query Revision
DICE-FOPARA
Bruce KapronUniversity of Victoria, Florian SteinbergINRIA Saclay
14:45
45m
Talk
Tiered complexity at higher order
DICE-FOPARA
Emmanuel Hainry, Bruce KapronUniversity of Victoria, Jean-Yves Marion LORIA, Romain PéchouxINRIA / LORIA

Conference Day
Sun 7 Apr

Displayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

11:00 - 12:00
11:00
60m
Talk
(Invited Talk) Cons-free Rewriting
DICE-FOPARA
Cynthia KopRadboud University Nijmegen
13:30 - 15:30
VIIDICE-FOPARA at S11
Chair(s): Marko van EekelenOpen University of the Netherlands
14:00
45m
Talk
Modular Runtime Complexity Analysis of Probabilistic While Programs
DICE-FOPARA
Martin AvanziniINRIA Sophia Antipolis, France, Michael SchaperUniversity of Innsbruck, Georg MoserUniversity of Innsbruck
14:45
45m
Talk
Type-Based Resource Analysis on Haskell
DICE-FOPARA