We propose a model for specifying, ana\-lysing and enforcing safe usage of resources. Our usage policies allow for parametricity over resources, and they can be enforced through finite state automata. The patterns of resource access and creation are described through a basic calculus of usages. In spite of the augmented flexibility given by resource creation and by policy parametrization, we devise an efficient (polynomial-time) model-checking technique for deciding when a usage is resource-safe, i.e.\ when it complies with all the relevant usage policies
The effective usages of computational resources are a primary concern of up-to-date distributed appl...
In existing usage control policy frameworks, policies consisting of authorizations and obligations a...
Several logics for expressing coalitional ability under resource bounds have been proposed and studi...
We propose a model for specifying, analysing and enforcing safe usage of resources.Our usage policie...
Two classes of nominal automata, namely Usage Automata (UAs) and Variable Finite Automata (VFAs) are...
An extension of the λ-calculus is proposed, to study resource usage analysis and verification. It fe...
Abstract. We investigate how to automatically verify that resources such as files are not used impro...
Model-checking resource logics with production and consumption of resources is a computationally har...
We introduce LocUsT, a tool to statically check whether a given resource usage complies with a local...
Abstract. Usage automata are an extension of finite stata automata, with some additional features (e...
Usage control is a generalization of access control that also addresses how data is handled after it...
An extension of the $\lambda$-calculus is proposed, to study resource usage analysis and verificat...
Abstract—Usage control is a generalization of access control that also addresses how data is handled...
We present a methodology to reason about resource usage (acquisition, release, revision, and so on) ...
We explain how a parameterized model checking technique can be exploited to mechanize the analysis o...
The effective usages of computational resources are a primary concern of up-to-date distributed appl...
In existing usage control policy frameworks, policies consisting of authorizations and obligations a...
Several logics for expressing coalitional ability under resource bounds have been proposed and studi...
We propose a model for specifying, analysing and enforcing safe usage of resources.Our usage policie...
Two classes of nominal automata, namely Usage Automata (UAs) and Variable Finite Automata (VFAs) are...
An extension of the λ-calculus is proposed, to study resource usage analysis and verification. It fe...
Abstract. We investigate how to automatically verify that resources such as files are not used impro...
Model-checking resource logics with production and consumption of resources is a computationally har...
We introduce LocUsT, a tool to statically check whether a given resource usage complies with a local...
Abstract. Usage automata are an extension of finite stata automata, with some additional features (e...
Usage control is a generalization of access control that also addresses how data is handled after it...
An extension of the $\lambda$-calculus is proposed, to study resource usage analysis and verificat...
Abstract—Usage control is a generalization of access control that also addresses how data is handled...
We present a methodology to reason about resource usage (acquisition, release, revision, and so on) ...
We explain how a parameterized model checking technique can be exploited to mechanize the analysis o...
The effective usages of computational resources are a primary concern of up-to-date distributed appl...
In existing usage control policy frameworks, policies consisting of authorizations and obligations a...
Several logics for expressing coalitional ability under resource bounds have been proposed and studi...