06821nam 22007935 450 99646531120331620240619233251.03-642-32495-910.1007/978-3-642-32495-6(CKB)3400000000085747(SSID)ssj0000745962(PQKBManifestationID)11462827(PQKBTitleCode)TC0000745962(PQKBWorkID)10863282(PQKB)10538030(DE-He213)978-3-642-32495-6(MiAaPQ)EBC3070869(PPN)16832198X(EXLCZ)99340000000008574720120714d2012 u| 0engurnn#008mamaatxtccrFoundational 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 van Eekelen, Olha Shkaravska1st ed. 2012.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2012.1 online resource (VII, 143 p. 30 illus.)Programming and Software Engineering ;7177Bibliographic Level Mode of Issuance: Monograph3-642-32494-0 Includes bibliographical references and author index.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.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.Programming and Software Engineering ;7177Computer system failuresAlgorithmsComputer logicSoftware engineeringProgramming languages (Electronic computers)ComputersSystem Performance and Evaluationhttps://scigraph.springernature.com/ontologies/product-market-codes/I13049Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Logics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XSoftware Engineeringhttps://scigraph.springernature.com/ontologies/product-market-codes/I14029Programming Languages, Compilers, Interpretershttps://scigraph.springernature.com/ontologies/product-market-codes/I14037Computation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Conference papers and proceedings.fastComputer system failures.Algorithms.Computer logic.Software engineering.Programming languages (Electronic computers).Computers.System Performance and Evaluation.Algorithm Analysis and Problem Complexity.Logics and Meanings of Programs.Software Engineering.Programming Languages, Compilers, Interpreters.Computation by Abstract Devices.004.24Peña Ricardoedthttp://id.loc.gov/vocabulary/relators/edtEekelen M. C. J. D. vanedthttp://id.loc.gov/vocabulary/relators/edtShkaravska Olhaedthttp://id.loc.gov/vocabulary/relators/edtBOOK996465311203316Foundational and Practical Aspects of Resource Analysis2829753UNISA