2008 32nd Annual IEEE International Computer Software and Applications Conference 2008
DOI: 10.1109/compsac.2008.157
|View full text |Cite
|
Sign up to set email alerts
|

A Resource-Oriented Static Analysis Approach to Adaptable Java Applications

Abstract: In this paper we present a static analysis approach for inspecting Java programs and characterizing them with respect to their resource consumption in a given execution environment. We target, in particular, resource constrained devices that are characterized by resource scarcity and limited computational power. The focus of this paper is on a parametrical Abstract Resource Analyzer that performs the actual analysis and is supported by a Resource Model that allows us to abstract application behavior in terms o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2008
2008
2013
2013

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(7 citation statements)
references
References 4 publications
0
7
0
Order By: Relevance
“…Then, the resulting set is given to the user, who selects the pairs of label dependencies he/she wants to preserve, and chooses the exe-cution order for each pair. Let us suppose the user only selects the pair (l ac 4 , l mc 4 ) to control the concurrent execution of the operation checkAccount in both AC and MC, by executing l ac 4 before l mc 4 : LD = {(l ac 4 > l mc 4 )}. Last, Algorithm 2 takes LD as input and extends it with new dependencies needed to execute the semantic rules PLD1, PLD2 and PLD3.…”
Section: Algorithm 2 Extended Label Dependenciesmentioning
confidence: 99%
“…Then, the resulting set is given to the user, who selects the pairs of label dependencies he/she wants to preserve, and chooses the exe-cution order for each pair. Let us suppose the user only selects the pair (l ac 4 , l mc 4 ) to control the concurrent execution of the operation checkAccount in both AC and MC, by executing l ac 4 before l mc 4 : LD = {(l ac 4 > l mc 4 )}. Last, Algorithm 2 takes LD as input and extends it with new dependencies needed to execute the semantic rules PLD1, PLD2 and PLD3.…”
Section: Algorithm 2 Extended Label Dependenciesmentioning
confidence: 99%
“…The latter is a model that permits developers to attach non-functional information at generic code level, and users to specify the required Service Level Specification (SLS), i.e., Qualities of Service (QoS). For a detailed description of the resource and SLS models please refer to [3,4,17] Chameleon Server-side. Still referring to Figure 1, the Abstract Resource Analyzer (ARA -see [4,17] for details) is an interpreter that, abstracting a standard JVM, is able to analyse the application alternatives (3), and derive their Offered SLSs (5.a) and Resource Demands (5.b).…”
Section: Setting the Contextmentioning
confidence: 99%
“…For a detailed description of the resource and SLS models please refer to [3,4,17] Chameleon Server-side. Still referring to Figure 1, the Abstract Resource Analyzer (ARA -see [4,17] for details) is an interpreter that, abstracting a standard JVM, is able to analyse the application alternatives (3), and derive their Offered SLSs (5.a) and Resource Demands (5.b). ARA is parametric with respect to the characteristics of the execution environment as described through the Resource Consumption Profile sent by the device (4.a).…”
Section: Setting the Contextmentioning
confidence: 99%
See 2 more Smart Citations