Resource Analysis of Complex Programs with Cost Equations

Flores-Montoya, Antonio; Hähnle, Reiner

doi:10.1007/978-3-319-12736-1_15

Cited by 64 publications

(50 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, the cost of betterThanAmortised(2 * n,n,x) is 3 * n and this is the result of SRA. However, the other techniques do not recognize that the most costly branch is executed only half of the times and return 2 * (2 * n) = 4 * n. Such precision is achieved in SRA by means of the treatment given to numerical expressions, and by the use of a solver (as [13]) capable to deal with conditional branches accurately. This precision is lost in techniques based on type systems because of the unifications that are necessary to enforce on the branches of conditionals, in order to type the continuations.…”

Section: Assessments -A Comparison With C4b and Sacomentioning

confidence: 98%

“…In this section we discuss a number of technical details about the type system and about the translation of the cost equations in Section 5 into an input that is adequate to an off-the-shelf solver -the CoFloCo solver [13]. We also deliver a preliminary assessment of our prototype by discussing a number of examples.…”

Section: The Sra Toolmentioning

confidence: 98%

“…where m is a (cost) function symbol, exp is an expression that may contain (cost) function symbols applications, and se is a size expression whose variables are contained in x (the syntax of exp and se is given in full detail in [13]). …”

Section: The Analysis Of Behavioural Typesmentioning

confidence: 99%

“…These descriptions are called behavioural types and are formally connected to the programs by means of a type system. The analysis of behavioural types is defined in Section 5 by translating them in a code that is adequate for an off-the-shelf solver -the CoFloCo solver [13]. As discussed in [7], in order to compute tight upper bounds, we have two functions per method: a function computing the peak cost -i.e.…”

mentioning

confidence: 99%

See 3 more Smart Citations

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: Assessments -A Comparison With C4b and Sacomentioning

confidence: 98%

Section: The Sra Toolmentioning

confidence: 98%

Section: The Analysis Of Behavioural Typesmentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

Static analysis of cloud elasticity

Garcia¹,

Laneve²,

Lienhardt³

2017

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

“…Going beyond type/logic-based systems, there is a significant amount of work on resource bound analysis for imperative programs. The focus is on fully automated techniques and a variety of different approaches to resource bound analysis have been developed, e.g., based on recurrence equations [Albert et al 2012;Debray et al 1990;Flores-Montoya and Hähnle 2014], template constraints [Carbonneaux et al 2015], term-rewriting systems [Avanzini et al 2015;Brockschmidt et al 2016], ranking functions [Alias et al 2010], abstract-interpretation [Gulwani et al 2009;Gulwani and Zuleger 2010;Hermenegildo et al 2005], abstract program models [Sinn et al 2014[Sinn et al , 2017Zuleger et al 2011] and interactive verification [Madhavan et al 2017]. These approaches can compute some resource bounds that are value-dependent; however, complicated value-dependenceÐ such as in the examples of this paperÐis out of reach for these automated techniques.…”

Section: Related Workmentioning

confidence: 99%

Monadic refinements for relational cost analysis

Radiček

Barthe

Gaboardi

et al. 2017

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Formal frameworks for cost analysis of programs have been widely studied in the unary setting and, to a limited extent, in the relational setting. However, many of these frameworks focus only on the cost aspect, largely side-lining functional properties that are often a prerequisite for cost analysis, thus leaving many interesting programs out of their purview. In this paper, we show that elegant, simple, expressive proof systems combining cost analysis and functional properties can be built by combining already known ingredients: higher-order refinements and cost monads. Specifically, we derive two syntax-directed proof systems, U C and R C , for unary and relational cost analysis, by adding a cost monad to a (syntax-directed) logic of higher-order programs. We study the metatheory of the systems, show that several nontrivial examples can be verified in them, and prove that existing frameworks for cost analysis (RelCost and RAML) can be embedded in them.

show abstract

Type-Directed Bounding of Collections in Reactive Programs

Černý

Chang

et al. 2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Our aim is to statically verify that in a given reactive program, the length of collection variables does not grow beyond a given bound. We propose a scalable type-based technique that checks that each collection variable has a given refinement type that specifies constraints about its length. A novel feature of our refinement types is that the refinements can refer to AST counters that track how many times an AST node has been executed. This feature enables type refinements to track limited flow-sensitive information. We generate verification conditions that ensure that the AST counters are used consistently, and that the types imply the given bound. The verification conditions are discharged by an off-the-shelf SMT solver. Experimental results demonstrate that our technique is scalable, and effective at verifying reactive programs with respect to requirements on length of collections.

show abstract

Resource Analysis of Complex Programs with Cost Equations

Cited by 64 publications

References 17 publications

Static analysis of cloud elasticity

Static analysis of cloud elasticity

Monadic refinements for relational cost analysis

Type-Directed Bounding of Collections in Reactive Programs

Contact Info

Product

Resources

About