An extension of the lambda-calculus is proposed, to study resource usage analysis and verification. It features usage policies with a possibly nested, local scope, and dynamic creation of resources. We define a type and effect system that, given a program, extracts a history expression, i.e. a sound over-approximation to the set of histories obtainable at run-time. After a suitable transformation, history expressions are model-checked for validity. A program is resource-safe if its history expression is verified valid: if such, no run-time monitor is needed to safely drive its executions
Abstract. We investigate how to automatically verify that resources such as files are not used impro...
Two classes of nominal automata, namely Usage Automata (UAs) and Variable Finite Automata (VFAs) are...
Abstract—The notion of resource plays a central role in concurrent systems. In its purest form a res...
An extension of the lambda-calculus is proposed, to study resource usage analysis and verification...
An extension of the $\lambda$-calculus is proposed, to study resource usage analysis and verificat...
An extension of the $\lambda$-calculus is proposed, to study history-based access control. It all...
We propose a model for specifying, analysing and enforcing safe usage of resources.Our usage policie...
We present a methodology to reason about resource usage (acquisition, release, revision, and so on) ...
We introduce LocUsT, a tool to statically check whether a given resource usage complies with a local...
The effective usages of computational resources are a primary concern of up-to-date distributed appl...
Abstract. We propose a type-based resource usage analysis for the πcalculus extended with resource c...
Many program verifiers allow specifications to be written in terms of program states. The specificat...
We present a generic analysis that infers both upper and lower bounds on the usage that a program ma...
In many applications it is important to ensure conformance with respect to specifications that cons...
The resource calculus is an extension of the lambda-calculus allowing to model resource consumption....
Abstract. We investigate how to automatically verify that resources such as files are not used impro...
Two classes of nominal automata, namely Usage Automata (UAs) and Variable Finite Automata (VFAs) are...
Abstract—The notion of resource plays a central role in concurrent systems. In its purest form a res...
An extension of the lambda-calculus is proposed, to study resource usage analysis and verification...
An extension of the $\lambda$-calculus is proposed, to study resource usage analysis and verificat...
An extension of the $\lambda$-calculus is proposed, to study history-based access control. It all...
We propose a model for specifying, analysing and enforcing safe usage of resources.Our usage policie...
We present a methodology to reason about resource usage (acquisition, release, revision, and so on) ...
We introduce LocUsT, a tool to statically check whether a given resource usage complies with a local...
The effective usages of computational resources are a primary concern of up-to-date distributed appl...
Abstract. We propose a type-based resource usage analysis for the πcalculus extended with resource c...
Many program verifiers allow specifications to be written in terms of program states. The specificat...
We present a generic analysis that infers both upper and lower bounds on the usage that a program ma...
In many applications it is important to ensure conformance with respect to specifications that cons...
The resource calculus is an extension of the lambda-calculus allowing to model resource consumption....
Abstract. We investigate how to automatically verify that resources such as files are not used impro...
Two classes of nominal automata, namely Usage Automata (UAs) and Variable Finite Automata (VFAs) are...
Abstract—The notion of resource plays a central role in concurrent systems. In its purest form a res...