Resource Usage Analysis and Its Application to Resource Certification

Albert, Elvira; Arenas, Puri; Genaim, Samir; Puebla, Germán; Zanardini, Damiano

doi:10.1007/978-3-642-03829-7_9

Cited by 9 publications

(13 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Resource usage certification [24,14,18,7,8] has been proposed as a way to provide resource guarantees in the context of mobile code. Mobile code includes, for example running applets and/or plug-ins downloaded from the net in a web browser or a mobile phone.…”

Section: Resource Usage Certificationmentioning

confidence: 99%

A practical comparator of cost functions and its applications

Albert

Arenas

Genaim

et al. 2015

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

Automatic cost analysis has significantly advanced in the last few years. Nowadays, a number of cost analyzers exist which automatically produce upperand/or lower-bounds on the amount of resources required to execute a program. Cost analysis has a number of important applications such as resource-usage verification and program synthesis and optimization. For such applications to be successful, it is not sufficient to have automatic cost analysis. It is also required to have automated means for handling the analysis results, which are in the form of Cost Functions (CFs for short) i.e., non-recursive expressions composed of a relatively small number of types of basic expressions. In particular, we need automated means for comparing CFs in order to prove that a CF is smaller than or equal to another one for all input values of interest. General function comparison is a hard mathematical problem. Rather than attacking the general problem, in this work we focus on comparing CFs by exploiting their syntactic properties and we present, to the best of our knowledge, the first practical CF comparator which opens the door to fully automated applications of cost analysis. We have implemented the comparator and made its source code available online, so that any cost analyzer can use it.

show abstract

Section: Resource Usage Certificationmentioning

confidence: 99%

A practical comparator of cost functions and its applications

Albert

Arenas

Genaim

et al. 2015

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…The more recent work [15] can determine upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive functional programs dealing with possibly-aliased data. As a closely related work, [16] demonstrates how to use a static analysis system COSTA to obtain safe symbolic upper bounds on the resource (heap) usage of a large class of general-purpose programs written in mainstream programming languages, such as Java (bytecode). However, it does not study stack bound.…”

Section: Related Workmentioning

confidence: 99%

Stack Bound Inference for Abstract Java Bytecode

Wang

Qiu

Qin

et al. 2010

2010 4th IEEE International Symposium on Theoretical Aspects of Software Engineering

View full text Add to dashboard Cite

Abstract-Ubiquitous embedded systems are often resourceconstrained. Developing software for these systems should take into account resources such as memory space. In this paper, we develop and implement an analysis framework to infer statically stack usage bounds for assembly-level programs in abstract Java Bytecode. Our stack bound inference process, extended from a theoretical framework proposed earlier by some of the authors, is composed of deductive inference rules in multiple passes. Based on these rules, a usable tool has been developed for processing programs to capture the stack memory needs of each procedure in terms of the symbolic values of its parameters. The final result contains path-sensitive information to achieve better precision. The tool invokes a Presburger solver to perform fixed point analysis for loops and recursive procedures. Our initial experiments have confirmed the viability and power of the approach.

show abstract

“…the entry hasNext(l 1 ), it infers that at program point (1, 1) the variable this is constant and always refers to l 1 . Applying it to 4 , it infers that: at program points (4, 1), (4, 3) and (4, 4) the variable this is constant and always refers to l 1 ; at (4, 2) variable obj is constant and always refers to l 1 .state; and at (4, 3), variable s 0 is constant and always refers to l 1 .state.rest.…”

Section: Examplementioning

confidence: 99%

“…The key features of this language which facilitate the formalization of the analysis are: (1) recursion is the only iterative mechanism, (2) guards are the only form of conditional, (3) there is no operand stack, (4) objects can be regarded as records, and the behavior induced by dynamic dispatch in the original bytecode program is compiled into dispatch rules guarded by a type check and (5) rules may have multiple output parameters which is useful for our transformation. The translation from (Java) bytecode to the rule-based form is performed in two steps [4]. First, a control flow graph is built.…”

Section: A Simple Imperative Bytecodementioning

confidence: 99%

See 1 more Smart Citation

From Object Fields to Local Variables: A Practical Approach to Field-Sensitive Analysis

et al. 2010

Self Cite

View full text Add to dashboard Cite

Abstract. Static analysis which takes into account the value of data stored in the heap is typically considered complex and computationally intractable in practice. Thus, most static analyzers do not keep track of object fields (or fields for short), i.e., they are field-insensitive. In this paper, we propose locality conditions for soundly converting fields into local variables. This way, field-insensitive analysis over the transformed program can infer information on the original fields. Our notion of locality is context-sensitive and can be applied both to numeric and reference fields. We propose then a polyvariant transformation which actually converts object fields meeting the locality condition into variables and which is able to generate multiple versions of code when this leads to increasing the amount of fields which satisfy the locality conditions. We have implemented our analysis within a termination analyzer for Java bytecode. Interestingly, we can now prove termination of programs which use iterators without the need of a sophisticated heap analysis.

show abstract

Resource Usage Analysis and Its Application to Resource Certification

Cited by 9 publications

References 46 publications

A practical comparator of cost functions and its applications

A practical comparator of cost functions and its applications

Stack Bound Inference for Abstract Java Bytecode

From Object Fields to Local Variables: A Practical Approach to Field-Sensitive Analysis

Contact Info

Product

Resources

About