|
" Foundational and practical aspects of resource analysis : "
Ricardo Peña, Marko Eekelen, Olha Shkaravska (eds.).
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
778168
|
| Doc. No
|
:
|
b598178
|
| Main Entry
|
:
|
Ricardo Peña, Marko Eekelen, Olha Shkaravska (eds.).
|
| Title & Author
|
:
|
Foundational and practical aspects of resource analysis : : second international workshop, FOPARA 2011, Madrid, Spain, May 19, 2011 : revised selected papers\ Ricardo Peña, Marko Eekelen, Olha Shkaravska (eds.).
|
| Publication Statement
|
:
|
Berlin ; New York : Springer, ©2012.
|
| Series Statement
|
:
|
Lecture notes in computer science, 7177.; LNCS sublibrary., SL 2,, Programming and software engineering.
|
| Page. NO
|
:
|
141 pages : illustrations ; 24 cm.
|
| ISBN
|
:
|
3642324940
|
|
|
:
|
: 9783642324949
|
| 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.
|
| Subject
|
:
|
Computer software -- Development -- Congresses.
|
| Subject
|
:
|
Computer software -- Development.
|
| Added Entry
|
:
|
M C J D van Eekelen
|
|
|
:
|
Olha Shkaravska
|
|
|
:
|
Ricardo Peña
|
| Parallel Title
|
:
|
FOPARA 2011
|
| |