An extension of the $\lambda$-calculus is proposed, to study resource usage analysis and verification. Resources can be dynamically created, and passed / returned by functions; their usages have side effects, represented by events. Usage policies are properties over histories of events, and have a possibly nested, local scope. A type and effect system over-approximates the set of histories a program can generate at run-time. A crucial point solved here concerns correctly associating fresh resources with their usages within approximations. A second issue is that these approximations may contain an unbounded number of fresh resources. Despite of that, we have devised a technique to model-check validity of approximations. A pr...
The resource calculus is an extension of the lambda-calculus allowing to model resource consumption....
. We introduce an untyped -calculus with input-output, based on Gordon's continuation-passing m...
We study the semantics of a resource sensitive extension of the lambda-calculus in a canonical refle...
An extension of the lambda-calculus is proposed, to study resource usage analysis and verification...
Abstract. We propose a type-based resource usage analysis for the πcalculus extended with resource c...
We define a type and effect system for a λ-calculus extended with side effects, in the form of primi...
We propose a model for specifying, ana\-lysing and enforcing safe usage of resources. Our usage po...
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN018530 / BLDSC - British Library D...
We present a generic analysis that infers both upper and lower bounds on the usage that a program ma...
The effective usages of computational resources are a primary concern of up-to-date distributed appl...
It is an important criterion of program correctness that a program accesses resources in a valid man...
We present a methodology to reason about resource usage (acquisition, release, revision, and so on) ...
Abstract—The notion of resource plays a central role in concurrent systems. In its purest form a res...
Many program verifiers allow specifications to be written in terms of program states. The specificat...
We introduce LocUsT, a tool to statically check whether a given resource usage complies with a local...
The resource calculus is an extension of the lambda-calculus allowing to model resource consumption....
. We introduce an untyped -calculus with input-output, based on Gordon's continuation-passing m...
We study the semantics of a resource sensitive extension of the lambda-calculus in a canonical refle...
An extension of the lambda-calculus is proposed, to study resource usage analysis and verification...
Abstract. We propose a type-based resource usage analysis for the πcalculus extended with resource c...
We define a type and effect system for a λ-calculus extended with side effects, in the form of primi...
We propose a model for specifying, ana\-lysing and enforcing safe usage of resources. Our usage po...
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN018530 / BLDSC - British Library D...
We present a generic analysis that infers both upper and lower bounds on the usage that a program ma...
The effective usages of computational resources are a primary concern of up-to-date distributed appl...
It is an important criterion of program correctness that a program accesses resources in a valid man...
We present a methodology to reason about resource usage (acquisition, release, revision, and so on) ...
Abstract—The notion of resource plays a central role in concurrent systems. In its purest form a res...
Many program verifiers allow specifications to be written in terms of program states. The specificat...
We introduce LocUsT, a tool to statically check whether a given resource usage complies with a local...
The resource calculus is an extension of the lambda-calculus allowing to model resource consumption....
. We introduce an untyped -calculus with input-output, based on Gordon's continuation-passing m...
We study the semantics of a resource sensitive extension of the lambda-calculus in a canonical refle...