Non-cumulative Resource Analysis

Albert, Elvira; Fernández, Justino; Román-Díez, Guillermo

doi:10.1007/978-3-662-46681-0_6

Cited by 26 publications

(24 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We observe that the release operation studied in [5] is used in a very restrictive way: only locally created resources can be released. This constraint guarantees that costs of functions are always not negative, thus permitting the (re)use of non-negative cost models of cumulative analysis.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Static analysis of cloud elasticity

Garcia¹,

Laneve²,

Lienhardt³

2017

Science of Computer Programming

View full text Add to dashboard Cite

Please cite this article in press as: A. Garcia et al., Static analysis of cloud elasticity, Sci. Comput. Program. (2017), http://dx. Highlights• A technique for the static analysis of resource utilization is proposed.• The analysis relies on a static type system that records program's resources behavior.• The proposed approach supports concurrency and explicit release operations.• A proof of soundness of the proposed type system and of the analysis is provided. AbstractWe propose a static analysis technique that computes upper bounds of virtual machine usages in a concurrent language with explicit acquire and release operations of virtual machines. In our language it is possible to delegate other (ad-hoc or third party) concurrent code to release virtual machines (by passing them as arguments of invocations). Our technique is modular and consists of (i) a type system associating programs with behavioural types that record relevant information for resource usage (creations, releases, and concurrent operations), (ii) a translation function that takes behavioural types and returns cost equations, and (iii) an automatic off-the-shelf solver for the cost equations.A soundness proof of the type system establishes the correctness of our technique with respect to the cost equations. We have experimentally evaluated our technique using a cost analysis solver and we report some results.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Recently [5] has analysed the cost of a language with explicit releases. We observe that the release operation studied in [5] is used in a very restrictive way: only locally created resources can be released.…”

Section: Related Workmentioning

confidence: 99%

Static analysis of cloud elasticity

Garcia¹,

Laneve²,

Lienhardt³

2017

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

“…Recently [6] has analysed the cost of a language with explicit releases. We observe that the release operation studied in [6] is used in a very restrictive way: only locally created resources can be released.…”

Section: Related Workmentioning

confidence: 99%

“…When removal of resources is considered, it is used in a very constrained way [6]. On the other hand, cloud computing elasticity requests powerful acquire operations as well as release ones.…”

Section: Introductionmentioning

confidence: 99%

Static analysis of cloud elasticity

Garcia

Laneve

Lienhardt

2015

Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming

View full text Add to dashboard Cite

We propose a static analysis technique that computes upper bounds of virtual machine usages in a concurrent language with explicit acquire and release operations of virtual machines. In our language it is possible to delegate other (ad-hoc or third party) concurrent code to release virtual machines (by passing them as arguments of invocations). Our technique is modular and consists of (i) a type system associating programs with behavioural types that records relevant information for resource usage (creations, releases, and concurrent operations), (ii) a translation function that takes behavioural types and return cost equations, and (iii) an automatic off-the-shelf solver for the cost equations. A soundness proof of the type system establishes the correctness of our technique with respect to the cost equations. We have experimentally evaluated our technique using a cost analysis solver and we report some results. The experiments show that our analysis allows us to derive bounds for programs that are better than other techniques, such as those based on amortized analysis.

show abstract

“…Another extension to sequential resource analysis is the inference of noncumulative resources [9]. Existing cost analysis frameworks have been defined for cumulative resources which keep on increasing along the computation.…”

Section: Extensions Of Sequential Resource Analysismentioning

confidence: 99%

Resource Analysis: From Sequential to Concurrent and Distributed Programs

Albert

Arenas

Fernández

et al. 2015

FM 2015: Formal Methods

Self Cite

View full text Add to dashboard Cite

Abstract. Resource analysis aims at automatically inferring upper/lower bounds on the worst/best-case cost of executing programs. Ideally, a resource analyzer should be parametric on the cost model, i.e., the type of cost that the user wants infer (e.g., number of steps, amount of memory allocated, amount of data transmitted, etc.). The inferred upper bounds have important applications in the fields of program optimization, verification and certification. In this talk, we will review the basic techniques used in resource analysis of sequential programs and the new extensions needed to handle concurrent and distributed systems.

show abstract

Non-cumulative Resource Analysis

Cited by 26 publications

References 14 publications

Static analysis of cloud elasticity

Static analysis of cloud elasticity

Static analysis of cloud elasticity

Resource Analysis: From Sequential to Concurrent and Distributed Programs

Contact Info

Product

Resources

About