Please use this identifier to cite or link to this item:
|Title:||Deriving pre-conditions for array bound check elimination||Authors:||Chin, W.-N.
|Issue Date:||2001||Citation:||Chin, W.-N.,Khoo, S.-C.,Xu, D.N. (2001). Deriving pre-conditions for array bound check elimination. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2053 LNCS : 2-24. ScholarBank@NUS Repository.||Abstract:||We present a high-level approach to array bound check optimization that is neither hampered by recursive functions, nor disabled by the presence of partially redundant checks. Our approach combines a forward analysis to infer precise contextual constraint at designated program points, and a backward method for deriving a safety pre-condition for each bound check. Both analyses are formulated with the help of a practical constraint solver based on Presburger formulae; resulting in an accurate and fully automatable optimization. The derived pre-conditions are also used to guide bound check specialization, for the purpose of eliminating partially redundant checks. © Springer-Verlag Berlin Heidelberg 2001.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/78089||ISBN:||3540420681||ISSN:||03029743|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 29, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.