(International Workshop on Foundational and Practical Aspects of Resource Analysis)

9:00 - 9:05 Opening
9:05 - 10:00 Sumit Gulwani (Microsoft Research): invited talk (incl. 10 min discussion)

10:00-10:15 Coffee

Session 1: Abstract and Polynomial Interpretations, Data Flow

10:15 - 10:40 A Space Consumption Analysis By Abstract Interpretation (Manuel Montenegro, Ricardo Peña and Clara Segura)
10:40 - 11:05 Polynomials over the reals are safe for interpretation of programs (Guillaume Bonfante, Florian Deloup and Antoine Henrot)
11:05 - 11:30 Static Complexity Analysis of Higher Order Programs (James Avery, Lars Kristiansen and Jean-Yves Moyen)
11:30 - 11:55 Implementing a practical polynomial programming language (Mike Burrell, Robin Cockett and Brian Redmond)

Lunch 12:00 - 13:20

Session 2 Implicit Computational Complexity, PTIME

13:20-13:45 A structural and local criterion for polynomial time computations (Luca Roversi and Luca Vercelli)
13:45-14:10 Polynomial Time Computation in the Context of Recursive Analysis (Walid Gomaa)
14:10-14:35 Non-deterministic Boolean Proof Nets (Virgile Mogbil)
14:35-15:00 Derivational Complexity is an Invariant Cost Model (Ugo Dal Lago and Simone Martini)

15:00 - 15:15 Coffee

Session 3: Resource Analysis for varieties of programming languages

15:15 - 15:40 Comparing Cost Functions in Resource Analysis (Elvira Albert, Puri Arenas, Samir Genaim, Israel Herraiz and German Puebla)
15:40 - 16:05 Characterising Effective Resource Analyses for Parallel and Distributed Coordination (Phil Trinder, Murray Cole, Hans-Wolfgang Loidl and Greg Michaelson)
16:05 - 16:30 Global and local space properties of stream programs (Marco Gaboardi and Romain Pechoux)
** 16:30 - 16:40 Pause **

Session 3.2
16:40 - 17:05 Improvements to a Resource Analysis for Hume (Hans-Wolfgang Loidl and Steffen Jost)
17:05 - 17:30 Compositional Analysis of Hume Box Iterations (Christoph Herrmann and Kevin Hammond)