Skip to main content
Article thumbnail
Location of Repository

Extending sized type with collection analysis

By Wei-ngan Chin, Siau-cheng Khoo and Dana N. Xu

Abstract

Many program optimizations and analyses, such as arraybounds checking, termination analysis, depend on knowing the size of a function’s input and output. However, size information can be difficult to compute. Firstly, accurate size computation requires detecting a size relation between different inputs of a function. Secondly, size information may also be contained inside a collection (data structure with multiple elements). In this paper, we introduce some techniques to derive universal and existential size properties over collections of elements of recursive data structures. We shall show how a mixed constraint system could support the enhanced size type, and highlight examples where collection analysis are useful

Topics: Languages, Theory, Reliability Keywords Sized Type, Polymorphism, Mixed Constraints, Collection Analysis, Fix-Point
Publisher: ACM Press
Year: 2003
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.9350
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.comp.nus.edu.sg/~ch... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.