Foundational and Practical Aspects of Resource Analysis: First International Workshop, FOPARA 2009, Eindhoven, The Netherlands, November 6, 2009, Revised Selected Papers

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the refereed proceedings of the First International Workshop on Foundational and Practical Aspects of Resource Analysis, FOPARA 2009, held at the 16th International Symposium on Formal Methods, FM 2009, in Eindhoven, The Netherlands, in November 2009. The 10 revised full papers were carefully reviewed and selected from 13 research presentation contributions and one invited lecture.

Author(s): Elvira Albert, Puri Arenas, Samir Genaim, Israel Herraiz, German Puebla (auth.), Marko van Eekelen, Olha Shkaravska (eds.)
Series: Lecture Notes in Computer Science 6324 : Programming and Software Engineering
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2010

Language: English
Pages: 170
Tags: Software Engineering; Logics and Meanings of Programs; Programming Languages, Compilers, Interpreters; Computer Communication Networks; Algorithm Analysis and Problem Complexity; Programming Techniques

Front Matter....Pages -
Comparing Cost Functions in Resource Analysis....Pages 1-17
Improvements to a Resource Analysis for Hume....Pages 18-33
A Space Consumption Analysis by Abstract Interpretation....Pages 34-50
Global and Local Space Properties of Stream Programs....Pages 51-66
Characterising Effective Resource Analyses for Parallel and Distributed Coordination....Pages 67-83
Static Complexity Analysis of Higher Order Programs....Pages 84-99
Derivational Complexity Is an Invariant Cost Model....Pages 100-113
A Local Criterion for Polynomial-Time Stratified Computations....Pages 114-130
Non-deterministic Boolean Proof Nets....Pages 131-145
Polynomial Time Computation in the Context of Recursive Analysis....Pages 146-162
Back Matter....Pages -