Please use this identifier to cite or link to this item:
|Title:||Reasoning about explicit resource management|
Computer software -- Testing
Computer systems -- Evaluation
|Citation:||Devries, E., Francalanza, A., & Hennessy, M. (2011). Reasoning about explicit resource management. Fourth Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software, Saarbrücken. 1-7.|
|Abstract:||We investigate the behaviour and efficiency of concurrent processes with explicit resource management. Our study is based on a π-calculus variant called Rπ  where the only resources available are channels, which must be explicitly allocated before they can be used and can be deallocated when no longer required. A substructural type system guarantees the safe allocation and deallocation of channels, as well as safe channel reuse through strong updates. In this paper we use this type system to give compositional proof techniques for reasoning about the behaviour and efficiency of Rπ processes.|
|Appears in Collections:||Scholarly Works - FacICTCS|
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.