Proceedings Third Joint Workshop on Developments in Implicit Computational complExity and Foundational & Practical Aspects of Resource Analysis
Thomas Seiller (CNRS, France), Steffen Jost (LMU Munich, Germany)

TL;DR
This workshop proceedings combine research on implicit computational complexity and resource analysis, highlighting theoretical foundations and practical applications in understanding and bounding computational resources.
Contribution
It presents a collection of papers that bridge foundational theories of complexity with practical resource analysis methods, fostering interdisciplinary insights.
Findings
Advances in logical and formal methods for complexity analysis
Integration of theoretical and practical resource bounds
New approaches to resource-aware programming
Abstract
These proceedings present the accepted regular papers and some selected extended abstracts from the 3rd joint DICE-FOPARA workshop, which was held in Prague, Czech Republic on April 6-7, 2019, as a part of ETAPS. The joint workshop provides synergies by combining two complementary communities: The 10th 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
