Abstract. We propose a type-based resource usage analysis for the πcalculus extended with resource creation/access primitives. The goal of the resource usage analysis is to statically check that a program accesses resources such as files and memory in a valid manner. Our type system is an extension of previous behavioral type systems for the pi-calculus, and can guarantee the safety property that no invalid access is performed, as well as the property that necessary accesses (such as the close operation for a file) are eventually performed unless the program diverges. A sound type inference algorithm for the type system is also developed to free the programmer from the burden of writing complex type annotations. Based on the algorithm, we h...
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN018530 / BLDSC - British Library D...
Abstract. The prediction of resource consumption in programs has gained interest in the last years. ...
Type-preserving translations are effective rigorous tools in the study of core programming calculi. ...
An extension of the $\lambda$-calculus is proposed, to study resource usage analysis and verificat...
It is an important criterion of program correctness that a program accesses resources in a valid man...
An extension of the λ-calculus is proposed, to study resource usage analysis and verification. It fe...
We define a type and effect system for a λ-calculus extended with side effects, in the form of primi...
Abstract. Proving bounds on the resource consumption of a program by statically analyzing its source...
We propose an extension of the asynchronous π-calculus in which a variety of security properties may...
Type-preserving translations are effective rigorous tools in the study of core programming calculi. ...
Several type systems have been proposed for characterizing resource usage in process calculi, starti...
Abstract—The notion of resource plays a central role in concurrent systems. In its purest form a res...
We present a generic analysis that infers both upper and lower bounds on the usage that a program ma...
Abstract. Resource usage is one of the most important characteristics of programs. Automatically gen...
Bounding resource usage is important for a number of areas, notably real-time embedded systems and s...
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN018530 / BLDSC - British Library D...
Abstract. The prediction of resource consumption in programs has gained interest in the last years. ...
Type-preserving translations are effective rigorous tools in the study of core programming calculi. ...
An extension of the $\lambda$-calculus is proposed, to study resource usage analysis and verificat...
It is an important criterion of program correctness that a program accesses resources in a valid man...
An extension of the λ-calculus is proposed, to study resource usage analysis and verification. It fe...
We define a type and effect system for a λ-calculus extended with side effects, in the form of primi...
Abstract. Proving bounds on the resource consumption of a program by statically analyzing its source...
We propose an extension of the asynchronous π-calculus in which a variety of security properties may...
Type-preserving translations are effective rigorous tools in the study of core programming calculi. ...
Several type systems have been proposed for characterizing resource usage in process calculi, starti...
Abstract—The notion of resource plays a central role in concurrent systems. In its purest form a res...
We present a generic analysis that infers both upper and lower bounds on the usage that a program ma...
Abstract. Resource usage is one of the most important characteristics of programs. Automatically gen...
Bounding resource usage is important for a number of areas, notably real-time embedded systems and s...
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN018530 / BLDSC - British Library D...
Abstract. The prediction of resource consumption in programs has gained interest in the last years. ...
Type-preserving translations are effective rigorous tools in the study of core programming calculi. ...