Resource usage analysis
- 1 March 2005
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 27 (2) , 264-313
- https://doi.org/10.1145/1057387.1057390
Abstract
It is an important criterion of program correctness that a program accesses resources in a valid manner. For example, a memory region that has been allocated should eventually be deallocated, and after the deallocation, the region should no longer be accessed. A file that has been opened should be eventually closed. So far, most of the methods to analyze this kind of property have been proposed in rather specific contexts (like studies of memory management and verification of usage of lock primitives), and it was not clear what the essence of those methods was or how methods proposed for individual problems are related. To remedy this situation, we formalize a general problem of analyzing resource usage as a resource usage analysis problem , and propose a type-based method as a solution to the problem.Keywords
This publication has 9 references indexed in Scilit:
- A generic type system for the Pi-calculusTheoretical Computer Science, 2004
- Shuffle languages are in PTheoretical Computer Science, 2001
- Type Reconstruction for Linear π-Calculus with I/O SubtypingInformation and Computation, 2000
- Typed memory management via static capabilitiesACM Transactions on Programming Languages and Systems, 2000
- Tractable constraints in finite semilatticesScience of Computer Programming, 1999
- A type system for object initialization in the Java bytecode languageACM Transactions on Programming Languages and Systems, 1999
- Principles of Program AnalysisPublished by Springer Nature ,1999
- Linear logicTheoretical Computer Science, 1987
- Shuffle languages, Petri nets, and context-sensitive grammarsCommunications of the ACM, 1981