Abstract is missing.
- A Higher-Order Characterization of Probabilistic Polynomial TimeUgo Dal Lago, Paolo Parisen Toldin. 1-18 [doi]
- Typing a Core Binary-Field Arithmetic in a Light LogicEmanuele Cesena, Marco Pedicini, Luca Roversi. 19-35 [doi]
- Interpolation-Based Height Analysis for Improving a Recurrence SolverManuel Montenegro, Olha Shkaravska, Marko C. J. D. van Eekelen, Ricardo Peña. 36-53 [doi]
- Interval-Based Resource Usage Verification: Formalization and PrototypePedro López-García, Luthfi Darmawan, Francisco Bueno, Manuel V. Hermenegildo. 54-71 [doi]
- Certifying and Reasoning on Cost Annotations of Functional ProgramsRoberto M. Amadio, Yann Régis-Gianas. 72-89 [doi]
- On Abstractions for Timing Analysis in the $\mathbb{K}$ FrameworkMihail Asavoae, Irina Mariuca Asavoae, Dorel Lucanu. 90-107 [doi]
- Certifying Execution TimeVitor Rodrigues, João Pedro Pedroso, Mário Florido, Simão Melo de Sousa. 108-125 [doi]
- Counter Automata for Parameterised Timing Analysis of Box-Based SystemsChristoph A. Herrmann, Kevin Hammond. 126-141 [doi]