Resource usage analysis

ACM Transactions on Programming Languages and Systems

Volumn 27, Issue 2, 2005, Pages 264-313

  Igarashi, Atsushi ^a   Kobayashi, Naoki ^b  

^a KYOTO UNIVERSITY   (Japan)

^b TOHOKU UNIVERSITY   (Japan)

Author keywords

Resource usage; Type inference

Indexed keywords

MEMORY REGION; RESOURCE USAGE ANALYSIS; TYPE INFERENCE;

PROBLEM SOLVING; RESOURCE ALLOCATION;

COMPUTER PROGRAMMING LANGUAGES;

EID: 27844447213     PISSN: 01640925     EISSN: 01640925     Source Type: Journal    
DOI: 10.1145/1057387.1057390     Document Type: Article

References (43)

1. AIKEN, A., FÄHNDRICH, M., AND LEVIEN, R. 1995. Improving region-based analysis of higher-order languages. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York, 174-185.
2. BALL, T. AND RAJAMANI, S. K. 2002. The SLAM project: Debugging system software via static analysis. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages. ACM, New York, 1-3.
3. BIGLIARDI, G. AND LANEVE, C. 2000. A type system for JVM threads. In Proceedings of 3rd ACM SIGPLAN Workshop on Types in Compilation (TIC2000) (Montreal, Que., Canada). ACM, New York.
4. BIRKEDAL, L., TOFTE, M., AND VEJLSTRUP, M. 1996. From region inference to von Neumann machines via region representation inference. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages. ACM, New York, 171-183.
5. BLANCHET, B. 1998. Escape analysis: Correctness, proof, implementation and experimental results. In Proceedings of ACM SIGPLAN/ SIGACT Symposium on Principles of Programming Languages. ACM, New York, 25-37.
6. DAS, M., LERNER, S., AND SEIGLE, M. 2002. Path-sensitive program verification in polynomial time. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York.
7. DELINE, R. AND FÄHNDRICH, M. 2001. Enforcing high-level protocols in low-level software. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York, 59-69.
8. DELINE, R. AND FÄHNDRICH, M. 2002. Adoption and focus: Practical linear types for imperative programming. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York.
9. EMERSON, E. A. 1990. Temporal and modal logic. In Handbook of Theoretical Computer Science Volume B, J. V. Leeuwen, Ed. The MIT press/Elsevier, Chapter 16, 995-1072.
10. FLANAGAN, C. AND ABADI, M. 1999a. Object types against races. In CONCUR'99. Lecture Notes in Computer Science, vol. 1664. Springer-Verlag, New York, 288-303.
11. FLANAGAN, C. AND ABADI, M. 1999b. Types for safe locking. In Proceedings of ESOP 1999. Lecture Notes in Computer Science, vol. 1576. Springer-Verlag, New York, 91-108.
12. FLANAGAN, C., LEINO, K. R. M., LILLIBRIDGE, M., NELSON, G., SAXE, J. B., AND STATA, R. 2002. Extended static checking for Java. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York, 234-245.
13. FOSTER, J. S., TERAUCHI, T., AND AIKEN, A. 2002. Flow-sensitive type qualifiers. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York.
14. FREUND, S. N. AND MITCHELL, J. C. 1999. The type system for object initialization in the Java bytecode language. ACM Trans. Prog. Lang. Syst. 21, 6, 1196-1250.
15. GIRARD, J.-Y. 1987. Linear logic. Theoret. Comput. Sci. 50, 1-102.
16. GISCHER, J. 1981. Shuffle languages, Petri nets, and context-sensitive grammars. Commun. ACM 24, 9, 597-605.
17. GROSSMAN, D., MORRISETT, G., JIM, T., HICKS, M., WANG, Y., AND CHENEY, J. 2002. Region-based memory management in cyclone. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York, 282-293.
18. GUSTAVSSON, J. AND SVENNINGSSON, J. 2000. A usage analysis with bounded usage polymorphism and subtyping. In Proceedings of IFL'00, Implementation of Functional Languages. Lecture Notes in Computer Science, vol. 2011. Springer-Verlag, New York, 140-157.
19. HANNAN, J. 1995. A type-based analysis for stack allocation in functional languages. In Proceedings of SAS'95. Lecture Notes in Computer Science, vol. 983. Springer-Verlag, New York, 172-188.
20. HENZINGER, T. A., JHALA, R., MAJUMDAR, R., AND SUTRE, G. 2002. Lazy abstraction. In Proceedings of ACM SIGPLAN / SIGACT Symposium on Principles of Programming Languages. ACM, New York, 58-70.
21. IGARASHI, A. AND KOBAYASHI, N. 2000a. Garbage collection based on a linear type system. In Proceedings of 3rd ACM SIGPLAN Workshop on Types in Compilation (TIC2000) (Montreal, Que., Canada) ACM, New York. (Published as Technical Report CMU-CS-00-161, Carnegie Mellon University, Pittsburgh, PA.)
22. IGARASHI, A. AND KOBAYASHI, N. 2000b. Type reconstruction for linear pi-calculus with I/O subtyping. Inf. Comput. 161, 1-44.
23. IGARASHI, A. AND KOBAYASHI, N. 2003. A generic type system for the pi-calculus. Theoret. Comput. Sci. 311, 1-3 (Jan.), 121-163.
24. IWAMA, F. AND KOBAYASHI, N. 2002. A new type system for JVM lock primitives. In Proceedings of ASIA-PEPM'02. ACM Press. Available at http://www.kb.cs.titech.ac.jp/~kobayasi/publications.html.
25. JȨDRZEJOWICZ, J. AND SZEPIETOWSKI, A. 2001. Shuffle languages are in P. Theoret. Comput. Sci. 250, 1-2, 31-53.
26. KANELLAKIS, P. C., MAIRSON, H. G., AND MITCHELL, J. C. 1991. Unification and ML type reconstruction. In Computational Logic: Essays in Honor of Alan Robinson, J.-L. Lassez and G. D. Plotkin, Eds. The MIT Press, Cambridge, Mass., 444-478.
27. KOBAYASHI, N. 1999. Quasi-linear types. In Proceedings of ACM SIGPLAN / SIGACT Symposium on Principles of Programming Languages. ACM, New York, 29-42.
28. KOBAYASHI, N. 2000a. Type-based useless variable elimination. In Proceedings of ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation. ACM, New York, 84-93.
29. KOBAYASHI, N. 2000b. Type systems for concurrent processes: From deadlock-freedom to livelock-freedom, time-boundedness. In Proceedings of IFIP International Conference on Theoretical Computer Science (TCS2000). Lecture Notes in Computer Science, vol. 1872. Springer-Verlag, New York, 365-389. (Invited Talk.)
30. KOBAYASHI, N. 2003. Time regions and effects for resource usage analysis. In Proceedings of ACM SIGPLAN International Workshop on Types in Languages Design and Implementation (TLDI'03). ACM, New York, 50-61.
31. KOBAYASHI, N., SAITO, S., AND SUMII, E. 2000. An implicitly-typed deadlock-free process calculus. In Proceedings of CONCUR2000. Lecture Notes in Computer Science, vol. 1877. Springer-Verlag, New York, 489-503.
32. MILNER, R. 1989. Communication and Concurrency. Prentice-Hall, Englewood Cliffs, N.J.
33. MORRISETT, G., FELLEISEN, M., AND HARPER, R. 1995. Abstract models of memory management. In Proceedings of Functional Programming Languages and Computer Architecture. 66-76.
34. NIELSON, F., NIELSON, H. R., AND HANKIN, C. 1999. Principles of Program Analysis. Springer-Verlag, New York
35. REHOF, J. AND MOGENSEN, T. 1999. Tractable constraints in finite semilattices. Sci. Comput. Prog. 35, 2, 191-221.
36. SANGIORGI, D. AND WALKER, D. 2001. The Pi-Calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge, Mass.
37. SUMII, E. AND KOBAYASHI, N. 1998. A generalized deadlock-free process calculus. In Proc. of Workshop on High-Level Concurrent Language (HLCL'98). ENTCS, vol. 16(3). 55-77.
38. TOFTE, M. AND TALPIN, J.-P. 1994. Implementation of the call-by-value lambda-calculus using a stack of regions. In Proceedings of ACM SIGPLAN / SIGACT Symposium on Principles of Programming Languages. ACM, New York, 188-201.
39. TURNER, D. N., WADLER, P., AND MOSSIN, C. 1995. Once upon a type. In Proceedings of Functional Programming Languages and Computer Architecture (San Diego, Califf.), 1-11.
40. WADLER, P. 1990. Linear types can change the world! In Programming Concepts and Methods. North Holland, Amsterdam, The Netherland.
41. WALKER, D., CRARY, K., AND MORRISETT, J. G. 2000. Typed memory management via static capabilities. ACM Trans. Prog. Lang. Syst. 22, 4, 701-771.
42. WALKER, D. AND WATKINS, K. 2001. On linear types and regions. In Proceedings of ACM SIGPLAN International Conference on Functional Programming. ACM, New York.
43. WANSBROUGH, K. AND PEYTON JONES, S. L. 1999. Once upon a polymorphic type. In Proceedings of ACM SIGPLAN / SIGACT Symposium on Principles of Programming Languages. ACM, New York, 15-28.