Foundational and Practical Aspects of Resource Analysis [electronic resource] : Third International Workshop, FOPARA 2013, Bertinoro, Italy, August 29-31, 2013, Revised Selected Papers / edited by Ugo Dal Lago, Ricardo Pe�na.
Contributor(s): Dal Lago, Ugo [editor.] | Pe�na, Ricardo [editor.] | SpringerLink (Online service).
Material type: BookSeries: Lecture Notes in Computer Science: 8552Publisher: Cham : Springer International Publishing : Imprint: Springer, 2014Description: IX, 161 p. 34 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783319124667.Subject(s): Computer science | Computer system failures | Software engineering | Programming languages (Electronic computers) | Computers | Algorithms | Computer logic | Computer Science | System Performance and Evaluation | Algorithm Analysis and Problem Complexity | Logics and Meanings of Programs | Software Engineering | Programming Languages, Compilers, Interpreters | Computation by Abstract DevicesAdditional physical formats: Printed edition:: No titleDDC classification: 004.24 Online resources: Click here to access onlineCertified 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.
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.
There are no comments for this item.