Proceedings International Workshop on Developments in Implicit Computational complExity

TL;DR

This paper compiles proceedings from DICE 2010, a workshop focused on implicit computational complexity, exploring logical, semantic, and static analysis approaches to understanding computational complexity without external measures.

Contribution

It provides an overview of current research trends in implicit computational complexity, fostering collaboration among researchers in logic, semantics, and static analysis.

Findings

Advances in logical characterizations of complexity classes

Development of semantic frameworks for implicit complexity

New techniques for static analysis of programs' complexity

Abstract

This volume contains the proceedings of the International Workshop on Developments in Implicit Computational complExity (DICE 2010), which took place on March 27-28 2010 in Paphos, Cyprus, as a satellite event of the Joint European Conference on Theory and Practice of Software, ETAPS 2010. Implicit Computational Complexity aims at studying computational complexity without referring to external measuring conditions or particular machine models, but instead by considering restrictions on programming languages or logical principles implying complexity properties. The aim of this workshop was to bring together researchers working on implicit computational complexity, from its logical and semantical aspects to those related to the static analysis of programs, so as to foster their interaction and to give newcomers an overview of the current trends in this area.