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

MARC

LEADER 00000nam a22000005i 4500
001 978-3-642-32495-6
003 DE-He213
005 20220311215326.0
007 cr nn 008mamaa
008 120714s2012 gw | s |||| 0|eng d
020 |a 9783642324956  |9 978-3-642-32495-6 
024 7 |a 10.1007/978-3-642-32495-6  |2 doi 
050 4 |a QA76.9.E94 
072 7 |a UYD  |2 bicssc 
072 7 |a COM074000  |2 bisacsh 
072 7 |a UYD  |2 thema 
082 0 4 |a 004.24  |2 23 
245 1 0 |a Foundational and Practical Aspects of Resource Analysis  |h [electronic resource] :  |b Second International Workshop, FOPARA 2011, Madrid, Spain, May 19, 2011, Revised Selected Papers /  |c edited by Ricardo Peña, Marko van Eekelen, Olha Shkaravska. 
250 |a 1st ed. 2012. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2012. 
300 |a VII, 143 p. 30 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Programming and Software Engineering,  |x 2945-9168 ;  |v 7177 
505 0 |a 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. 
520 |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. 
650 0 |a Electronic digital computers-Evaluation. 
650 0 |a Algorithms. 
650 0 |a Computer science. 
650 0 |a Software engineering. 
650 0 |a Compilers (Computer programs). 
650 1 4 |a System Performance and Evaluation. 
650 2 4 |a Algorithms. 
650 2 4 |a Computer Science Logic and Foundations of Programming. 
650 2 4 |a Software Engineering. 
650 2 4 |a Compilers and Interpreters. 
650 2 4 |a Theory of Computation. 
700 1 |a Peña, Ricardo.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a van Eekelen, Marko.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Shkaravska, Olha.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783642324963 
776 0 8 |i Printed edition:  |z 9783642324949 
830 0 |a Programming and Software Engineering,  |x 2945-9168 ;  |v 7177 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-642-32495-6  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)