We introduce LocUsT, a tool to statically check whether a given resource usage complies with a local policy. LocUsT takes as input an abstraction of the behaviour of a program, called a usage. Usages are expressed in a simple process calculus, and over-approximate all the resource accesses of the program itself. As additional input, LocUsT takes a policy that defines the allowed resource access patterns, represented through a finite state automaton parametrized over resources. Finally, LocUsT decides whether some trace of the given usage violates some instantiation of the policy
We present a framework for (static) verification of general resource usage program properties. The f...
Static analysis tools cannot detect violations of application-specific rules. They can be extended w...
We present a generic analysis that infers both upper and lower bounds on the usage that a program ma...
We propose a model for specifying, analysing and enforcing safe usage of resources.Our usage policie...
An extension of the λ-calculus is proposed, to study resource usage analysis and verification. It fe...
An extension of the $\lambda$-calculus is proposed, to study resource usage analysis and verificat...
We present a methodology to reason about resource usage (acquisition, release, revision, and so on) ...
The effective usages of computational resources are a primary concern of up-to-date distributed appl...
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. Resource usage is one of the most important characteristics of programs. Automatically gen...
Usage control is a generalization of access control that also addresses how data is handled after it...
Abstract. Usage automata are an extension of finite stata automata, with some additional features (e...
Abstract. We present a type and effect system for statically determin-ing whether concurrent program...
Abstract—Usage control is a generalization of access control that also addresses how data is handled...
We present a framework for (static) verification of general resource usage program properties. The f...
Static analysis tools cannot detect violations of application-specific rules. They can be extended w...
We present a generic analysis that infers both upper and lower bounds on the usage that a program ma...
We propose a model for specifying, analysing and enforcing safe usage of resources.Our usage policie...
An extension of the λ-calculus is proposed, to study resource usage analysis and verification. It fe...
An extension of the $\lambda$-calculus is proposed, to study resource usage analysis and verificat...
We present a methodology to reason about resource usage (acquisition, release, revision, and so on) ...
The effective usages of computational resources are a primary concern of up-to-date distributed appl...
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. Resource usage is one of the most important characteristics of programs. Automatically gen...
Usage control is a generalization of access control that also addresses how data is handled after it...
Abstract. Usage automata are an extension of finite stata automata, with some additional features (e...
Abstract. We present a type and effect system for statically determin-ing whether concurrent program...
Abstract—Usage control is a generalization of access control that also addresses how data is handled...
We present a framework for (static) verification of general resource usage program properties. The f...
Static analysis tools cannot detect violations of application-specific rules. They can be extended w...
We present a generic analysis that infers both upper and lower bounds on the usage that a program ma...