A Functional Scenario for Bytecode Verification of Resource Bounds

Amadio, Roberto M.; Coupet-Grimal, Solange; Zilio, Silvano Dal; Jakubiec, Line

doi:10.1007/978-3-540-30124-0_22

Cited by 16 publications

(33 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the system assumes that source programs come from a first-order functional language with a resource-aware type system [19]. Similarly, Amadio et al [4] defined a simple stack machine for a first-order functional language and showed how to perform type, size and termination verifications at the bytecode level. Their main result is a proof that each program with the quasi-interpretation property 1 that terminates has a polynomial stack bound.…”

Section: Related Workmentioning

confidence: 99%

“…Recent works [19,21] are mostly based on analysing functional programs where the presence of immutable data structures makes such analysis easier to formalise. Even though [5,4] are targeted at Java-based bytecode programs, their frameworks again assume that bytecode programs are compiled from first-order functional programs. Other works, such as [13,28], merely provide a framework for checking that the memory usage of object-oriented programs conform to user-supplied memory specifications either through static analysis or runtime checking.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Analysing memory resource bounds for low-level programs

Chin

Nguyen

Popeea

et al. 2008

Proceedings of the 7th International Symposium on Memory Management

View full text Add to dashboard Cite

Embedded systems are becoming more widely used but these systems are often resource constrained. Programming models for these systems should take into formal consideration resources such as stack and heap. In this paper, we show how memory resource bounds can be inferred for assembly-level programs. Our inference process captures the memory needs of each method in terms of the symbolic values of its parameters. For better precision, we infer path-sensitive information through a novel guarded expression format. Our current proposal relies on a Presburger solver to capture memory requirements symbolically, and to perform fixpoint analysis for loops and recursion. Apart from safety in memory adequacy, our proposal can provide estimate on memory costs for embedded devices and improve performance via fewer runtime checks against memory bound.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Analysing memory resource bounds for low-level programs

Chin

Nguyen

Popeea

et al. 2008

Proceedings of the 7th International Symposium on Memory Management

View full text Add to dashboard Cite

show abstract

“…The scheduler owns three registers: (1) tid that stores the identity of the current thread, (2) time for the current time, and (3) wtime for the last time the store was modified. The notion of time here is of a logical nature: time passes whenever the scheduler transfers control to a new thread.…”

Section: Schedulermentioning

confidence: 99%

“…Property ReadOnce is a transposition of the read once condition (Section 2.1) at the level of the bytecode. In [1], we have presented a method to perform resource control verifications at bytecode level. This work is just concerned with the functional fragment of our model.…”

Section: Control Flow Analysis Revisitedmentioning

confidence: 99%

Resource Control for Synchronous Cooperative Threads

Amadio¹,

Zilio²

2004

CONCUR 2004 - Concurrency Theory

Self Cite

View full text Add to dashboard Cite

We develop new methods to statically bound the resources needed for the execution of systems of concurrent, interactive threads. Our study is concerned with a synchronous model of interaction based on cooperative threads whose execution proceeds in synchronous rounds called instants. Our contribution is a system of compositional static analyses to guarantee that each instant terminates and to bound the size of the values computed by the system as a function of the size of its parameters at the beginning of the instant. Our method generalises an approach designed for first-order functional languages that relies on a combination of standard termination techniques for term rewriting systems and an analysis of the size of the computed values based on the notion of quasi-interpretation. We show that these two methods can be combined to obtain an explicit polynomial bound on the resources needed for the execution of the system during an instant. As a second contribution, we introduce a virtual machine and a related bytecode thus producing a precise description of the resources needed for the execution of a system. In this context, we present a suitable control flow analysis that allows to formulate the static analyses for resource control at byte code level.

show abstract

“…Works [1], [2] are mostly aiming to analyze functional programs where the immutable data structures make such analysis easier to formalize. The works [3], [4] target at Java-based Bytecode programs, but their frameworks again assume that Bytecode programs are compiled from functional programs without mutability and assignments. Other works, e.g.…”

Section: Introductionmentioning

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

A Functional Scenario for Bytecode Verification of Resource Bounds

Cited by 16 publications

References 12 publications

Analysing memory resource bounds for low-level programs

Analysing memory resource bounds for low-level programs

Resource Control for Synchronous Cooperative Threads

Stack Bound Inference for Abstract Java Bytecode

Contact Info

Product

Resources

About