Cargando…

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

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

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Peña, Ricardo (Editor ), van Eekelen, Marko (Editor ), Shkaravska, Olha (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012.
Edición:1st ed. 2012.
Colección:Programming and Software Engineering, 7177
Temas:
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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.