Show simple item record  

dc.contributor.authorWeng, Min-Hsienen_NZ
dc.contributor.authorUtting, Marken_NZ
dc.contributor.authorPfahringer, Bernharden_NZ
dc.contributor.editorGaston, Cen_NZ
dc.contributor.editorLe Gall, Pen_NZ
dc.contributor.editorPetrenko, Aen_NZ
dc.coverage.spatialOslo, Norwayen_NZ
dc.date.accessioned2017-05-11T03:55:53Z
dc.date.available2015en_NZ
dc.date.available2017-05-11T03:55:53Z
dc.date.issued2015en_NZ
dc.identifier.citationWeng, M.-H., Utting, M., & Pfahringer, B. (2015). Bound analysis for Whiley programs. Electronic Notes in Theoretical Computer Science, 320, 53–67. https://doi.org/10.1016/j.entcs.2016.01.005en
dc.identifier.urihttps://hdl.handle.net/10289/11038
dc.description.abstractThe Whiley compiler can generate naive C code, but the code is inefficient because it uses infinite integers and dynamic array sizes. Our project goal is to build up a compiler that can translate Whiley programs into efficient OpenCL code with fixed-size integer types and fixed-size arrays, for parallel execution on GPUs. This paper presents an abstract interpretation-based bound inference approach along with symbolic analysis for Whiley programs. The source Whiley program is first analyzed by using our symbolic analyzer to find the matching pattern and make any necessary program transformation. Then the bound analyzer is used to analyze the transformed program to make use of primitive integer types rather than third-party infinite integer type (e.g. using GMP arbitrary precision library). The bound analysis results provide conservative estimates of the ranges of integer variables and array sizes so that efficient code can be generated and integer overflows avoided. The bound analyzer combines the bound consistency technique along with a widening operator to give fast time of solving program constraints and of converging to the fixed point. Several example programs are used to illustrate the bound analyzer algorithm and the program transformation.
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherElsevieren_NZ
dc.rights© 2016 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license.
dc.sourceUSE '15en_NZ
dc.subjectStatic Analysis
dc.subjectRange Analysis
dc.subjectAbstract Interpretation
dc.subjectBound Consistency
dc.subjectWidening Operator
dc.subjectSymbolic Analysis
dc.subjectPattern matching
dc.subjectProgram Transformation
dc.subjectcomputer science
dc.subjectMachine learning
dc.titleBound analysis for Whiley programsen_NZ
dc.typeConference Contribution
dc.identifier.doi10.1016/j.entcs.2016.01.005en_NZ
dc.relation.isPartOfElectronic Notes in Theoretical Computer Scienceen_NZ
pubs.begin-page53
pubs.elements-id134037
pubs.end-page67
pubs.finish-date2015-06-23en_NZ
pubs.start-date2015-06-23en_NZ
pubs.volumeENTCS 320en_NZ
pubs.volume320


Files in this item

This item appears in the following Collection(s)

Show simple item record