Abstract is missing.
- Certified Complexity (CerCo)Roberto M. Amadio, Nicolas Ayache, François Bobot, Jaap Boender, Brian Campbell, Ilias Garnier, Antoine Madet, James McKinna, Dominic P. Mulligan, Mauro Piccolo, Randy Pollack, Yann Régis-Gianas, Claudio Sacerdoti Coen, Ian Stark, Paolo Tranquilli. 1-18 [doi]
- On the Modular Integration of Abstract Semantics for WCET AnalysisMihail Asavoae, Irina Mariuca Asavoae. 19-37 [doi]
- Can a Light Typing Discipline Be Compatible with an Efficient Implementation of Finite Fields Inversion?Daniele Canavese, Emanuele Cesena, Rachid Ouchary, Marco Pedicini, Luca Roversi. 38-57 [doi]
- Probabilistic Analysis of Programs: A Weak Limit ApproachAlessandra Di Pierro, Herbert Wiklicky. 58-76 [doi]
- Predicative Lexicographic Path Orders - An Application of Term Rewriting to the Region of Primitive Recursive FunctionsNaohi Eguchi. 77-92 [doi]
- A Hoare Logic for Energy Consumption AnalysisRody Kersten, Paolo Parisen Toldin, Bernard van Gastel, Marko C. J. D. van Eekelen. 93-109 [doi]
- Reasoning About Resources in the Embedded Systems Language HumeHans-Wolfgang Loidl, Gudmund Grov. 110-126 [doi]
- On Paths-Based Criteria for Polynomial Time Complexity in Proof-NetsMatthieu Perrinel. 127-142 [doi]
- Collected Size Semantics for Strict Functional Programs over General Polymorphic ListsOlha Shkaravska, Marko C. J. D. van Eekelen, Alejandro Tamalet. 143-159 [doi]