LEADER 06821nam 22007935 450 001 996465311203316 005 20240619233251.0 010 $a3-642-32495-9 024 7 $a10.1007/978-3-642-32495-6 035 $a(CKB)3400000000085747 035 $a(SSID)ssj0000745962 035 $a(PQKBManifestationID)11462827 035 $a(PQKBTitleCode)TC0000745962 035 $a(PQKBWorkID)10863282 035 $a(PQKB)10538030 035 $a(DE-He213)978-3-642-32495-6 035 $a(MiAaPQ)EBC3070869 035 $a(PPN)16832198X 035 $a(EXLCZ)993400000000085747 100 $a20120714d2012 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFoundational and Practical Aspects of Resource Analysis $eSecond International Workshop, FOPARA 2011, Madrid, Spain, May 19, 2011, Revised Selected Papers /$fedited by Ricardo Peņa, Marko van Eekelen, Olha Shkaravska 205 $a1st ed. 2012. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2012. 215 $a1 online resource (VII, 143 p. 30 illus.) 225 1 $aProgramming and Software Engineering ;$v7177 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-32494-0 320 $aIncludes bibliographical references and author index. 327 $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. 330 $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. 410 0$aProgramming and Software Engineering ;$v7177 606 $aComputer system failures 606 $aAlgorithms 606 $aComputer logic 606 $aSoftware engineering 606 $aProgramming languages (Electronic computers) 606 $aComputers 606 $aSystem Performance and Evaluation$3https://scigraph.springernature.com/ontologies/product-market-codes/I13049 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 608 $aConference papers and proceedings.$2fast 615 0$aComputer system failures. 615 0$aAlgorithms. 615 0$aComputer logic. 615 0$aSoftware engineering. 615 0$aProgramming languages (Electronic computers). 615 0$aComputers. 615 14$aSystem Performance and Evaluation. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aLogics and Meanings of Programs. 615 24$aSoftware Engineering. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aComputation by Abstract Devices. 676 $a004.24 702 $aPeņa$b Ricardo$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aEekelen$b M. C. J. D. van$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aShkaravska$b Olha$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465311203316 996 $aFoundational and Practical Aspects of Resource Analysis$92829753 997 $aUNISA