Please use this identifier to cite or link to this item:
Title: Extending sized type with collection analysis
Authors: Chin, W.-N. 
Khoo, S.-C. 
Xu, D.N. 
Keywords: Collection analysis
Mixed constraints
Sized type
Issue Date: 2003
Citation: Chin, W.-N.,Khoo, S.-C.,Xu, D.N. (2003). Extending sized type with collection analysis. ACM SIGPLAN Notices 38 (10) : 315-324. ScholarBank@NUS Repository.
Abstract: Many program optimizations and analyses, such as array-bounds 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.
Source Title: ACM SIGPLAN Notices
ISSN: 03621340
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.