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.
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.
Die Herstellerinformationen sind derzeit nicht verfügbar.
Inhaltsangabe
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.
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.
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
Impressum
www.buecher.de ist ein Internetauftritt der buecher.de internetstores GmbH
Geschäftsführung: Monica Sawhney | Roland Kölbl | Günter Hilger
Sitz der Gesellschaft: Batheyer Straße 115 - 117, 58099 Hagen
Postanschrift: Bürgermeister-Wegele-Str. 12, 86167 Augsburg
Amtsgericht Hagen HRB 13257
Steuernummer: 321/5800/1497
USt-IdNr: DE450055826