000 05488nam a22005655i 4500
001 978-3-642-32495-6
003 DE-He213
005 20140220083324.0
007 cr nn 008mamaa
008 120714s2012 gw | s |||| 0|eng d
020 _a9783642324956
_9978-3-642-32495-6
024 7 _a10.1007/978-3-642-32495-6
_2doi
050 4 _aQA76.9.E94
072 7 _aUYD
_2bicssc
072 7 _aCOM074000
_2bisacsh
082 0 4 _a004.24
_223
100 1 _aPeña, Ricardo.
_eeditor.
245 1 0 _aFoundational and Practical Aspects of Resource Analysis
_h[electronic resource] :
_bSecond International Workshop, FOPARA 2011, Madrid, Spain, May 19, 2011, Revised Selected Papers /
_cedited by Ricardo Peña, Marko Eekelen, Olha Shkaravska.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2012.
300 _aVII, 143 p. 30 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v7177
505 0 _aImplicit 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 _aThis 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 _aComputer science.
650 0 _aComputer system performance.
650 0 _aSoftware engineering.
650 0 _aComputer software.
650 0 _aLogic design.
650 1 4 _aComputer Science.
650 2 4 _aSystem Performance and Evaluation.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aSoftware Engineering.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
650 2 4 _aComputation by Abstract Devices.
700 1 _aEekelen, Marko.
_eeditor.
700 1 _aShkaravska, Olha.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642324949
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v7177
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-32495-6
912 _aZDB-2-SCS
912 _aZDB-2-LNC
999 _c103497
_d103497