Abstract—The notion of resource plays a central role in concurrent systems. In its purest form a resource is simply a unique identity one can create, use and ultimately destruct. In this paper we propose a simple yet effective characterization of resource usages and develop for it a complete analysis frame-work. We address qualitative issues such as the classification of resources and whether two systems exhibit similar patterns of resource usages – namely equivalent resource profiles. From the quantitative point of view, we develop the omniscient garbage collector (OGC), which decides precisely when a resource can be reclaimed or reused. This allows to bound precisely the number of resources consumed by a given system. To illustrate the ap...
We present a generic analysis that infers both upper and lower bounds on the usage that a program ma...
We define a π-calculus variant with a costed semantics where channels are treated as re- sources th...
A. We define a pi-calculus variant with a costed semantics where channels are treated as re-sources ...
The effective usages of computational resources are a primary concern of up-to-date distributed appl...
Durant leur exécution, les systèmes concurrents manipulent diverses ressources dynamiques en nombre ...
We present a methodology to reason about resource usage (acquisition, release, revision, and so on) ...
Concurrent activities involve undoubtedly many dynamic resources manupulations: files, communication...
Predicting the resources that are consumed by a program component is crucial for many parallel or di...
<p>Predicting the resources that are consumed by a program component is crucial for many paral...
We present a resource-management model for ML-style programming languages, designed to be compatible...
Resource analysis aims at automatically inferring upper/lower bounds on the worst/best-case cost of ...
Abstract. We propose a type-based resource usage analysis for the πcalculus extended with resource c...
It is an important criterion of program correctness that a program accesses resources in a valid man...
An extension of the $\lambda$-calculus is proposed, to study resource usage analysis and verificat...
In this report, we introduce a model of concurrency based on event structures which we call resource...
We present a generic analysis that infers both upper and lower bounds on the usage that a program ma...
We define a π-calculus variant with a costed semantics where channels are treated as re- sources th...
A. We define a pi-calculus variant with a costed semantics where channels are treated as re-sources ...
The effective usages of computational resources are a primary concern of up-to-date distributed appl...
Durant leur exécution, les systèmes concurrents manipulent diverses ressources dynamiques en nombre ...
We present a methodology to reason about resource usage (acquisition, release, revision, and so on) ...
Concurrent activities involve undoubtedly many dynamic resources manupulations: files, communication...
Predicting the resources that are consumed by a program component is crucial for many parallel or di...
<p>Predicting the resources that are consumed by a program component is crucial for many paral...
We present a resource-management model for ML-style programming languages, designed to be compatible...
Resource analysis aims at automatically inferring upper/lower bounds on the worst/best-case cost of ...
Abstract. We propose a type-based resource usage analysis for the πcalculus extended with resource c...
It is an important criterion of program correctness that a program accesses resources in a valid man...
An extension of the $\lambda$-calculus is proposed, to study resource usage analysis and verificat...
In this report, we introduce a model of concurrency based on event structures which we call resource...
We present a generic analysis that infers both upper and lower bounds on the usage that a program ma...
We define a π-calculus variant with a costed semantics where channels are treated as re- sources th...
A. We define a pi-calculus variant with a costed semantics where channels are treated as re-sources ...