Foundational and Practical Aspects of Resource Analysis Second International Workshop, FOPARA 2011, Madrid, Spain, May 19, 2011, Revised Selected Papers /

• Corporate Author: SpringerLink (Online service)
• Other Authors: Peña, Ricardo (Editor), Eekelen, Marko van (Editor), Shkaravska, Olha (Editor)
• Format: Electronic eBook
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012.
• Series: Lecture Notes in Computer Science, 7177
• Subjects: 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 Devices.

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

Table of Contents:

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