Please use this identifier to cite or link to this item: https://doi.org/10.1145/1328408.1328434
DC FieldValue
dc.titleA practical and precise inference and specializer for array bound checks elimination
dc.contributor.authorPopeea, C.
dc.contributor.authorXu, D.N.
dc.contributor.authorChin, W.-N.
dc.date.accessioned2013-07-04T08:41:51Z
dc.date.available2013-07-04T08:41:51Z
dc.date.issued2008
dc.identifier.citationPopeea, C., Xu, D.N., Chin, W.-N. (2008). A practical and precise inference and specializer for array bound checks elimination. Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation : 177-187. ScholarBank@NUS Repository. https://doi.org/10.1145/1328408.1328434
dc.identifier.isbn9781595939777
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/42038
dc.description.abstractArrays are intensively used in many software programs, including those in the popular graphics and game programming domains. Although the problem of eliminating redundant array bound checks has been studied for a long time, there are few works that attempt to be both aggressively precise and practical. We propose an inference mechanism that achieves both aims by combining a forward relational analysis with a backward precondition derivation. Our inference algorithm works for a core imperative language with assignments, and analyses each method once through a summary-based approach. Our inference is precise as it is both path and context sensitive. Through a novel technique that can strengthen preconditions, we can selectively reduce the sizes of formulae to support a practical inference algorithm. Moreover, we subject each inferred program to a flexivariant specialization that can achieve good tradeoff between elimination of array checks and code explosion concerns. We have proven the soundness of our approach and have also implemented a prototype inference and specialization system. Initial experiments suggest that such a desired system is viable. Copyright © 2008 ACM.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1145/1328408.1328434
dc.sourceScopus
dc.subjectDependent types
dc.subjectSafety verification
dc.subjectSize properties
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1145/1328408.1328434
dc.description.sourcetitleProceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation
dc.description.page177-187
dc.identifier.isiut000267583600019
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

9
checked on Dec 2, 2022

WEB OF SCIENCETM
Citations

6
checked on Dec 2, 2022

Page view(s)

200
checked on Dec 8, 2022

Google ScholarTM

Check

Altmetric


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