Foundational and Practical Aspects of Resource Analysis
Second International Workshop, FOPARA 2011, Madrid, Spain, May 19, 2011, Revised Selected Papers
Published on 13. July 2012
Book
Paperback/Softback
VII, 143 pages
978-3-642-32494-9 (ISBN)
Description
This book constitutes the refereed post-proceedings of the Second International Workshop on Foundational and Practical Aspects of Resource Analysis, FOPARA 2011, held in Madrid, Spain, in May 2011. The 8 revised full papers were carefully reviewed and selected from the papers presented at the workshop and papers submitted following an open call for contributions after the workshop. The papers are organized in the following topical sections: implicit complexity, analysis and verfication of cost expressions, and worst case execution time analysis.
More details
Series
Edition
2012 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
30 s/w Abbildungen
VII, 143 p. 30 illus.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 9 mm
Weight
248 gr
ISBN-13
978-3-642-32494-9 (9783642324949)
DOI
10.1007/978-3-642-32495-6
Schweitzer Classification
Other editions
Additional editions
Ricardo Peña | Marko Van Eekelen | Olha Shkaravska
Foundational and Practical Aspects of Resource Analysis
Second International Workshop, FOPARA 2011, Madrid, Spain, May 19, 2011, Revised Selected Papers
E-Book
07/2012
Springer
€48.14
Available for download
Content
Implicit Complexity.- A Higher-Order Characterization of Probabilistic Polynomial Time.- Typing a Core Binary-Field Arithmetic in a Light Analysis and Verification of Cost Expressions.- Interpolation-Based Height Analysis for Improving a Recurrence Interval-Based Resource Usage Verification: Formalization and Prototype.- Certifying and Reasoning on Cost Annotations of Functional Worst Case Execution Time Analysis.- On Abstractions for Timing Analysis in the K Certifying Execution.- Counter Automata for Parameterised Timing Analysis of Box-Based Systems.Implicit Complexity.- A Higher-Order Characterization of Probabilistic Polynomial Time.- Typing a Core Binary-Field Arithmetic in a Light Analysis and Verification of Cost Expressions.- Interpolation-Based Height Analysis for Improving a Recurrence Interval-Based Resource Usage Verification: Formalization and Prototype.- Certifying and Reasoning on Cost Annotations of Functional Worst Case Execution Time Analysis.- On Abstractions for Timing Analysis in the K Certifying Execution.- Counter Automata for Parameterised Timing Analysis of Box-Based Systems.Implicit Complexity.- A Higher-Order Characterization of Probabilistic Polynomial Time.- Typing a Core Binary-Field Arithmetic in a Light Analysis and Verification of Cost Expressions.- Interpolation-Based Height Analysis for Improving a Recurrence Interval-Based Resource Usage Verification: Formalization and Prototype.- Certifying and Reasoning on Cost Annotations of Functional Worst Case Execution Time Analysis.- On Abstractions for Timing Analysis in the K Certifying Execution.- Counter Automata for Parameterised Timing Analysis of Box-Based Systems.Implicit Complexity.- A Higher-Order Characterization of Probabilistic Polynomial Time.- Typing a Core Binary-Field Arithmetic in a Light Analysis and Verification of Cost Expressions.- Interpolation-Based Height Analysis for Improving a Recurrence Interval-Based Resource Usage Verification: Formalization and Prototype.- Certifying and Reasoning on Cost Annotations of Functional Worst Case Execution Time Analysis.- On Abstractions for Timing Analysis in the K Certifying Execution.- Counter Automata for Parameterised Timing Analysis of Box-Based Systems.Implicit Complexity.- A Higher-Order Characterization of Probabilistic Polynomial Time.- Typing a Core Binary-Field Arithmetic in a Light Analysis and Verification of Cost Expressions.- Interpolation-Based Height Analysis for Improving a Recurrence Interval-Based Resource Usage Verification: Formalization and Prototype.- Certifying and Reasoning on Cost Annotations of Functional Worst Case Execution Time Analysis.- On Abstractions for Timing Analysis in the K Certifying Execution.- Counter Automata for Parameterised Timing Analysis of Box-Based Systems.