Nantilus
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...
Enregistré dans:
| Auteurs principaux : | , , |
|---|---|
| Format : | Livre |
| Langue : | anglais |
| Titre complet : | Foundational and Practical Aspects of Resource Analysis : Second International Workshop, FOPARA 2011, Madrid, Spain, May 19, 2011, Revised Selected Papers / edited by Ricardo Peña, Marko Eekelen, Olha Shkaravska. |
| Édition : | 1st ed. 2012. |
| Publié : |
Berlin, Heidelberg :
Springer Berlin Heidelberg
, 2012 |
| Collection : | Programming and Software Engineering ; 7177 |
| Accès en ligne : |
Accès Nantes Université
Accès direct soit depuis les campus via le réseau ou le wifi eduroam soit à distance avec un compte @etu.univ-nantes.fr ou @univ-nantes.fr |
| Contenu : | 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 |
| Sujets : | |
| Documents associés : | Autre format:
Foundational and Practical Aspects of Resource Analysis Autre format: Foundational and Practical Aspects of Resource Analysis |
| LEADER | 06227clm a2200733 4500 | ||
|---|---|---|---|
| 001 | PPN16832198X | ||
| 003 | http://www.sudoc.fr/16832198X | ||
| 005 | 20241001155100.0 | ||
| 010 | |a 978-3-642-32495-6 | ||
| 017 | 7 | 0 | |a 10.1007/978-3-642-32495-6 |2 DOI |
| 035 | |a (OCoLC)818323541 | ||
| 035 | |a Springer978-3-642-32495-6 | ||
| 035 | |a Springer-11645-978-3-642-32495-6 | ||
| 100 | |a 20130325d2012 k |0frey0103 ba | ||
| 101 | 0 | |a eng |2 639-2 | |
| 102 | |a DE | ||
| 105 | |a y z 100yy | ||
| 106 | |a s | ||
| 135 | |a dr||||||||||| | ||
| 181 | |6 z01 |c txt |2 rdacontent | ||
| 181 | 1 | |6 z01 |a i# |b xxxe## | |
| 182 | |6 z01 |c c |2 rdamedia | ||
| 182 | 1 | |6 z01 |a b | |
| 183 | |6 z01 |a ceb |2 RDAfrCarrier | ||
| 200 | 1 | |a Foundational and Practical Aspects of Resource Analysis |e Second International Workshop, FOPARA 2011, Madrid, Spain, May 19, 2011, Revised Selected Papers |f edited by Ricardo Peña, Marko Eekelen, Olha Shkaravska. | |
| 205 | |a 1st ed. 2012. | ||
| 214 | 0 | |a Berlin, Heidelberg |c Springer Berlin Heidelberg |d 2012 | |
| 225 | 0 | |a Programming and Software Engineering |x 2945-9168 |v 7177 | |
| 230 | |a Données textuelles | ||
| 327 | 1 | |a Implicit Complexity |a A Higher-Order Characterization of Probabilistic Polynomial Time |a Typing a Core Binary-Field Arithmetic in a Light Analysis and Verification of Cost Expressions |a Interpolation-Based Height Analysis for Improving a Recurrence Interval-Based Resource Usage Verification: Formalization and Prototype |a Certifying and Reasoning on Cost Annotations of Functional Worst Case Execution Time Analysis |a On Abstractions for Timing Analysis in the K Certifying Execution |a Counter Automata for Parameterised Timing Analysis of Box-Based Systems.Implicit Complexity |a A Higher-Order Characterization of Probabilistic Polynomial Time |a Typing a Core Binary-Field Arithmetic in a Light Analysis and Verification of Cost Expressions |a Interpolation-Based Height Analysis for Improving a Recurrence Interval-Based Resource Usage Verification: Formalization and Prototype |a Certifying and Reasoning on Cost Annotations of Functional Worst Case Execution Time Analysis |a On Abstractions for Timing Analysis in the K Certifying Execution |a Counter Automata for Parameterised Timing Analysis of Box-Based Systems.Implicit Complexity |a A Higher-Order Characterization of Probabilistic Polynomial Time |a Typing a Core Binary-Field Arithmetic in a Light Analysis and Verification of Cost Expressions |a Interpolation-Based Height Analysis for Improving a Recurrence Interval-Based Resource Usage Verification: Formalization and Prototype |a Certifying and Reasoning on Cost Annotations of Functional Worst Case Execution Time Analysis |a On Abstractions for Timing Analysis in the K Certifying Execution |a Counter Automata for Parameterised Timing Analysis of Box-Based Systems.Implicit Complexity |a A Higher-Order Characterization of Probabilistic Polynomial Time |a Typing a Core Binary-Field Arithmetic in a Light Analysis and Verification of Cost Expressions |a Interpolation-Based Height Analysis for Improving a Recurrence Interval-Based Resource Usage Verification: Formalization and Prototype |a Certifying and Reasoning on Cost Annotations of Functional Worst Case Execution Time Analysis |a On Abstractions for Timing Analysis in the K Certifying Execution |a Counter Automata for Parameterised Timing Analysis of Box-Based Systems.Implicit Complexity |a A Higher-Order Characterization of Probabilistic Polynomial Time |a Typing a Core Binary-Field Arithmetic in a Light Analysis and Verification of Cost Expressions |a Interpolation-Based Height Analysis for Improving a Recurrence Interval-Based Resource Usage Verification: Formalization and Prototype |a Certifying and Reasoning on Cost Annotations of Functional Worst Case Execution Time Analysis |a On Abstractions for Timing Analysis in the K Certifying Execution |a Counter Automata for Parameterised Timing Analysis of Box-Based Systems | |
| 330 | |a 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 | ||
| 337 | |a Nécessite un lecteur de fichier PDF | ||
| 371 | 0 | |a L'accès complet à la ressource est réservé aux usagers des établissements qui en ont fait l'acquisition | |
| 410 | | | |t Programming and Software Engineering |x 2945-9168 |v 7177 | |
| 452 | | | |t Foundational and Practical Aspects of Resource Analysis |y 9783642324949 | |
| 452 | | | |t Foundational and Practical Aspects of Resource Analysis |y 9783642324963 | |
| 608 | |3 PPN02886431X |a Actes de congrès |2 rameau | ||
| 610 | 1 | |a Computer Science | |
| 610 | 2 | |a Algorithm Analysis and Problem Complexity | |
| 610 | 2 | |a Logics and Meanings of Programs | |
| 610 | 2 | |a Programming Languages, Compilers, Interpreters | |
| 610 | 2 | |a Computation by Abstract Devices | |
| 610 | 2 | |a System Performance and Evaluation | |
| 610 | 2 | |a Software Engineering | |
| 610 | 2 | |a Computer Science Logic and Foundations of Programming | |
| 610 | 2 | |a Algorithms | |
| 610 | 2 | |a Compilers and Interpreters | |
| 610 | 2 | |a Theory of Computation | |
| 615 | |a @Computer Science |n 11645 |2 Springer | ||
| 615 | |a Computer Science |n 11645 |2 Springer | ||
| 676 | |a 004.24 |v 23 | ||
| 680 | |a QA76.9.E94 | ||
| 701 | 1 | |a Peña |b Ricardo |4 651 | |
| 701 | 1 | |a Peña |b Ricardo |4 651 | |
| 701 | 1 | |a van Eekelen |b Marko |4 651 | |
| 701 | 1 | |a Shkaravska |b Olha |4 651 | |
| 801 | 3 | |a FR |b Abes |c 20231126 |g AFNOR | |
| 801 | 1 | |a DE |b Springer |c 20220401 |g AACR2 | |
| 856 | 4 | |5 441099901:830853634 |u https://budistant.univ-nantes.fr/login?url=https://doi.org/10.1007/978-3-642-32495-6 | |
| 915 | |5 441099901:830853634 |b SPRING13-00429 | ||
| 930 | |5 441099901:830853634 |b 441099901 |j g | ||
| 991 | |5 441099901:830853634 |a Exemplaire créé en masse par ITEM le 30-09-2024 16:11 | ||
| 997 | |a NUM |b SPRING13-00429 |d NUMpivo |e EM |s d | ||
| 998 | |a 978261 | ||