## Foundational and Practical Aspects of Resource Analysis: Third International Workshop, FOPARA 2013, Bertinoro, Italy, August 29-31, 2013, Revised Selected PapersThis book constitutes the proceedings of the Third International Workshop on Foundational and Practical Aspects of Resource Analysis, FOPARA 2013, held in Bertinoro, Italy, in August 2013. The 9 papers presented in this volume were carefully reviewed and selected from 12 submissions. They deal with traditional approaches to complexity analysis, differential privacy, and probabilistic analysis of programs. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

1 | |

On the Modular Integration of Abstract Semantics for WCET Analysis | 19 |

Can a Light Typing Discipline Be Compatible with an Efficient Implementation of Finite Fields Inversion? | 38 |

A Weak Limit Approach | 58 |

Predicative Lexicographic Path Orders | 77 |

A Hoare Logic for Energy Consumption Analysis
| 93 |

Reasoning About Resources in the Embedded Systems Language Hume | 110 |

On PathsBased Criteria for Polynomial Time Complexity in ProofNets | 127 |

Collected Size Semantics for Strict Functional Programs over General Polymorphic Lists | 143 |

160 | |

### Other editions - View all

Foundational and Practical Aspects of Resource Analysis: Third International ... Ugo Dal Lago,Ricardo Peņa No preview available - 2014 |

### Common terms and phrases

abstract interpretation algorithm annotations applied arguments binary cache cell CerCo compiler Church words Cimp complexity component computation configuration control flow corresponding cost model cut-elimination DCEA defined definition denote depends Eekelen elements embedded encode energy consumption energy-aware semantics example execution finite FOPARA formal function calls functional programs hardware heap Heidelberg higher-order Hilbert spaces Hoare logic holds Hume implementation induction input integration Isabelle/HOL iteration language Lemma length lexicographic path order linear logic LNCS loop meta-algorithm modular modules multiplicative inverse object code OpenSSL operational semantics optimisations plpo plugin polynomial predicate primitive recursive functions probabilistic proof proof-net properties prove QuickSort Radboud University Nijmegen resource consumption result rewrite system rewriting rules sequence Shkaravska source code specification Springer structure T(to theorem timestamp tion uint 64_t update upper bound variables WCET WCET analysis wInv