article

Resource usage analysis

Authors:

Atsushi Igarashi,

Naoki KobayashiAuthors Info & Claims

ACM SIGPLAN Notices, Volume 37, Issue 1

Pages 331 - 342

https://doi.org/10.1145/565816.503303

Published: 01 January 2002 Publication History

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 be eventually 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 so clear what is the essence of those methods 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.

References

[1]

A.Aiken,M.Fahndrich,and R.Levien.Improving region-based analysis of higher-order languages.In Proc.of PLDI,pages 174 -185,1995.]]

Digital Library

[2]

G.Bigliardi and C.Laneve.A type system for JVM threads.In Proc.of 3rd ACM SIGPLAN Workshop on Types in Compilation (TIC2000),2000.]]

[3]

L.Birkedal,M.Tofte,and M.Vejlstrup.From region inference to von neumann machines via region representation inference.In Proc.of POPL,pages 171 -183,1996.]]

Digital Library

[4]

B.Blanchet.Escape analysis:Correctness,proof, implementation and experimental results.In Proc.of POPL,pages 25 -37,1998.]]

Digital Library

[5]

R.DeLine and M.Fahndrich.Enforcing high-level protocols in low-level software.In Proc.of PLDI, pages 59 -69,2001.]]

Digital Library

[6]

E.A.Emerson.Temporal and modal logic.In J.V. Leeuwen,editor,Handbook of Theoretical Computer Science Volume B,chapter 16,pages 995 -1072.The MIT press/Elsevier,1990.]]

Digital Library

[7]

C.Flanagan and M.Abadi.Object types against races.In CONCUR '99,LNCS 1664,pages 288 -303. Springer-Verlag,1999.]]

Digital Library

[8]

C.Flanagan and M.Abadi.Types for safe locking.In Proc.of ESOP 1999,LNCS 1576,pages 91 -108,1999.]]

Digital Library

[9]

S.N.Freund and J.C.Mitchell.The type system for object initialization in the Java bytecode language. ACM Trans.Prog.Lang.Syst.,21(6):1196 -1250,1999.]]

Digital Library

[10]

J.Gischer.Shu .e languages,Petri nets,and context-sensitive grammars.Comm.ACM, 24(9):597 -605,1981.]]

Digital Library

[11]

J.Gustavsson and J.Svenningsson.A usage analysis with bounded usage polymorphism and subtyping.In Proceedings of IFL '00,Implementation of Functional Languages,LNCS 2011,pages 140 -157,2000.]]

Digital Library

[12]

J.Hannan.A type-based analysis for stack allocation in functional languages.In Proceedings of SAS '95, LNCS 983,pages 172 -188,1995.]]

Digital Library

[13]

A.Igarashi and N.Kobayashi.Garbage collection based on a linear type system.In Proc.of 3rd ACM SIGPLAN Workshop on Types in Compilation (TIC2000),2000.]]

[14]

A.Igarashi and N.Kobayashi.Type reconstruction for linear pi-calculus with I/O subtyping.Info.Comput., 161:1 -44,2000.]]

Digital Library

[15]

A.Igarashi and N.Kobayashi.A generic type system for the pi-calculus.In Proc.of POPL, pages 128 -141, 2001.]]

Digital Library

[16]

J.Jedrzejowicz and A.Szepietowski.Shuffle languages are in P.Theor.Comput.Sci.,250(1-2):31 -53,2001.]]

Digital Library

[17]

P.C.Kanellakis,H.G.Mairson,and J.C.Mitchell. Uni .cation and ML Type Reconstruction.In J.-L. Lassez and G.D.Plotkin,editors,Computational Logic:Essays in Honor of Alan Robinson, pages 444 -478.The MIT Press,1991.]]

[18]

N.Kobayashi.Quasi-linear types.In Proc.of POPL, pages 29 -42,1999.]]

Digital Library

[19]

N.Kobayashi.Type-based useless variable elimination.In Proc.of PEPM, pages 84 -93,2000.]]

Digital Library

[20]

N.Kobayashi.Type systems for concurrent processes: From deadlock-freedom to livelock-freedom, time-boundedness.In Proc.of IFIP International Conference on Theoretical Computer Science (TCS2000),LNCS 1872,pages 365 -389,2000.]]

Digital Library

[21]

N.Kobayashi,E.Sumii,and S.Saito.An implicitly-typed deadlock-free process calculus.In Proc.of CONCUR2000,LNCS 1877,pages 489 -503. Springer-Verlag,2000.]]

Digital Library

[22]

G.Morrisett,M.Felleisen,and R.Harper.Abstract models of memory management.In Proc.of Functional Programming Languages and Computer Architecture, pages 66 -76,1995.]]

Digital Library

[23]

F.Nielson,H.R.Nielson,and C.Hankin.Principles of Program Analysis .Springer-Verlag,1999.]]

Digital Library

[24]

E.Sumii and N.Kobayashi.A generalized deadlock-free process calculus.In Proc.of Workshop on High-Level Concurrent Language (HLCL '98), ENTCS 16(3),pages 55 -77,1998.]]

[25]

M.Tofte and J.-P.Talpin.Implementation of the call-by-value lambda-calculus using a stack of regions. In Proc.of POPL, pages 188 -201,1994.]]

Digital Library

[26]

D.N.Turner,P.Wadler,and C.Mossin.Once upon a type.In Proceedings of Functional Programming Languages and Computer Architecture, pages 1 -11, 1995.]]

Digital Library

[27]

P.Wadler.Linear types can change the world. In Programming Concepts and Methods. North Holland, 1990.]]

[28]

D.Walker,K.Crary,and J.G.Morrisett.Typed memory management via static capabilities.ACM Trans.Prog.Lang.Syst.,22(4):701 -771,2000.]]

Digital Library

[29]

D.Walker and K.Watkins.On linear types and regions.In Proc.of ICFP, 2001.]]

Digital Library

[30]

K.Wansbrough and S.L.P.Jones.Once upon a polymorphic type.In Proc.of POPL, pages 15 -28, 1999.]]

Digital Library

Cited By

Haemmerlé RLópez-García PLiqat UKlemen MGallagher JHermenegildo M(2016)A Transformational Approach to Parametric Accumulated-Cost Static ProfilingFunctional and Logic Programming10.1007/978-3-319-29604-3_11(163-180)Online publication date: 21-Feb-2016
https://doi.org/10.1007/978-3-319-29604-3_11
Bartenstein TLiu Y(2014)Rate types for stream programsACM SIGPLAN Notices10.1145/2714064.266022549:10(213-232)Online publication date: 15-Oct-2014
https://dl.acm.org/doi/10.1145/2714064.2660225
Caires LSeco J(2013)The type discipline of behavioral separationACM SIGPLAN Notices10.1145/2480359.242910348:1(275-286)Online publication date: 23-Jan-2013
https://dl.acm.org/doi/10.1145/2480359.2429103
Show More Cited By

Resource usage analysis
1. Theory of computation
  1. Semantics and reasoning

Recommendations

Resource usage analysis
POPL '02: Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

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 be eventually deallocated, and after the deallocation, the region should no longer be ...
Resource usage analysis

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 ...
Time regions and effects for resource usage analysis

Various resources such as files and memory are associated with certain protocols about how they should be accessed. For example, a memory cell that has been allocated should be eventually deallocated, and after the deallocation, the cell should no longer ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices

ACM SIGPLAN Notices Volume 37, Issue 1

Jan. 2002

342 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/565816

Issue’s Table of Contents

POPL '02: Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
January 2002
351 pages
ISBN:1581134509
DOI:10.1145/503272
Conference Chair:
John Launchbury
OGI and Galois Connections
,
Program Chair:
John C. Mitchell
Stanford University

Copyright © 2002 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 2002

Published in SIGPLAN Volume 37, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

101
Total Citations
View Citations
621
Total Downloads

Downloads (Last 12 months)31
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Haemmerlé RLópez-García PLiqat UKlemen MGallagher JHermenegildo M(2016)A Transformational Approach to Parametric Accumulated-Cost Static ProfilingFunctional and Logic Programming10.1007/978-3-319-29604-3_11(163-180)Online publication date: 21-Feb-2016
https://doi.org/10.1007/978-3-319-29604-3_11
Bartenstein TLiu Y(2014)Rate types for stream programsACM SIGPLAN Notices10.1145/2714064.266022549:10(213-232)Online publication date: 15-Oct-2014
https://dl.acm.org/doi/10.1145/2714064.2660225
Caires LSeco J(2013)The type discipline of behavioral separationACM SIGPLAN Notices10.1145/2480359.242910348:1(275-286)Online publication date: 23-Jan-2013
https://dl.acm.org/doi/10.1145/2480359.2429103
Degano PFerrari GGalletta LMezzetti G(2012)Types for coordinating secure behavioural variationsProceedings of the 14th international conference on Coordination Models and Languages10.1007/978-3-642-30829-1_18(261-276)Online publication date: 14-Jun-2012
https://dl.acm.org/doi/10.1007/978-3-642-30829-1_18
Aspinall DBeringer LMomigliano A(2007)Optimisation ValidationElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2006.06.017176:3(37-59)Online publication date: 1-Jul-2007
https://dl.acm.org/doi/10.1016/j.entcs.2006.06.017
Besson FDufay GJensen T(2006)A formal model of access control for mobile interactive devicesProceedings of the 11th European conference on Research in Computer Security10.1007/11863908_8(110-126)Online publication date: 18-Sep-2006
https://dl.acm.org/doi/10.1007/11863908_8
Hennessy MRathke JYoshida N(2004)safeDpi: A Language for Controlling Mobile CodeFoundations of Software Science and Computation Structures10.1007/978-3-540-24727-2_18(241-256)Online publication date: 2004
https://doi.org/10.1007/978-3-540-24727-2_18
Shibayama EYonezawa A(2003)Secure software infrastructure in the internet ageNew Generation Computing10.1007/BF0303762721:2(87-106)Online publication date: 1-Mar-2003
https://dl.acm.org/doi/10.1007/BF03037627
Shibayama EHagihara SKobayashi NNishizaki STaura KWatanabe T(2003)AnZenMail: A Secure and Certified E-mail SystemSoftware Security — Theories and Systems10.1007/3-540-36532-X_13(201-216)Online publication date: 25-Jun-2003
https://doi.org/10.1007/3-540-36532-X_13
Sekiyama TUnno H(2025)Algebraic Temporal Effects: Temporal Verification of Recursively Typed Higher-Order ProgramsProceedings of the ACM on Programming Languages10.1145/37049149:POPL(2306-2336)Online publication date: 9-Jan-2025
https://dl.acm.org/doi/10.1145/3704914
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents