Foundational and Practical Aspects of Resource Analysis: Third International Workshop, FOPARA 2013, Bertinoro, Italy, August 29-31, 2013, Revised Selected Papers

Foundational and Practical Aspects of Resource Analysis: Third International Workshop, FOPARA 2013, Bertinoro, Italy, August 29-31, 2013, Revised Selected Papers

Foundational and Practical Aspects of Resource Analysis: Third International Workshop, FOPARA 2013, Bertinoro, Italy, August 29-31, 2013, Revised Selected Papers

Foundational and Practical Aspects of Resource Analysis: Third International Workshop, FOPARA 2013, Bertinoro, Italy, August 29-31, 2013, Revised Selected Papers

eBook2014 (2014)

$33.99  $44.99 Save 24% Current price is $33.99, Original price is $44.99. You Save 24%.

Available on Compatible NOOK devices, the free NOOK App and in My Digital Library.
WANT A NOOK?  Explore Now

Related collections and offers


Overview

This 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.

Product Details

ISBN-13: 9783319124667
Publisher: Springer-Verlag New York, LLC
Publication date: 10/21/2014
Series: Lecture Notes in Computer Science , #8552
Sold by: Barnes & Noble
Format: eBook
File size: 5 MB

Table of Contents

Certified Complexity (CerCo).- On the Modular Integration of Abstract Semantics for WCET Analysis.- Can a Light Typing Discipline Be Compatible with an Efficient Implementation of Finite Fields Inversion?.- Probabilistic Analysis of Programs: A Weak Limit Approach.- Predicative Lexicographic Path Orders: An Application of Term Rewriting to the Region of Primitive Recursive Functions.- A Hoare Logic for Energy Consumption Analysis.- Reasoning About Resources in the Embedded Systems Language Hume.- On Paths-Based Criteria for Polynomial Time Complexity in Proof-Nets.- Collected Size Semantics for Strict Functional Programs over General Polymorphic Lists.
From the B&N Reads Blog

Customer Reviews