Links und Funktionen

You are here: Home / Research / DICE-FOPARA2019


Papers of DICE-FOPARA2019

Papers of DICE-FOPARA2019

DICE-FOPARA 2019 Workshop on Developments in Implicit Computational complExity & Foundational & Practical Aspects of Resource Analysis

We provide the papers submitted to DICE-FOPARA2019 here, since the official conference webpage will only publish papers after the conference is already over. 

DICE-FOPARA2019 is a workshop associated with the ETAPS2019 conference. Please refer to the respective webpage for all further information.

Title Description Modification Date
Applications of Linear Defeasible Logic: combining resource consumption and exceptions to energy management and business processes by Matteo Cristani, Guido Governatori, Francesco Olivieri and Claudio Tomazzoli 2019-04-06 18:24
Finite semantics of polymorphism, complexity and the power of type fixpoints by Lê Thành Dũng Nguyễn, Thomas Seiller, Paolo Pistone and Lorenzo Tortora de Falco 2019-04-06 18:09
From normal functors to logarithmic space queries by Lê Thành Dũng Nguyễn and Pierre Pradic 2019-04-06 18:06
Hierarchical Digging is EXPTIME by Brian Redmond 2019-04-06 18:07
Modular Runtime Complexity Analysis of Probabilistic While Programs by Martin Avanzini, Michael Schaper and Georg Moser 2019-04-06 18:08
Pointers in Recursion: Exploring the Tropics by Paulin Jacobé De Naurois 2019-04-06 18:08
PRAMs over integers do not compute maxflow efficiently by Luc Pellissier and Thomas Seiller 2019-04-06 18:09
Tiered complexity at higher order by Emmanuel Hainry, Bruce Kapron, Jean-Yves Marion and Romain Péchoux 2019-04-06 18:10
Towards a Sheaf-Theoretic Definition of Decision Problems by Damiano Mazza 2019-04-06 18:10
Type-Based Resource Analysis on Haskell by Franz Siglmüller 2019-04-06 18:06
Type-two Iteration with Bounded Query Revision by Bruce Kapron and Florian Steinberg 2019-04-06 18:09

Document Actions