Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/21132
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Carette, Jacques | - |
dc.contributor.advisor | Janicki, Ryszard | - |
dc.contributor.author | Zhai, Yun | - |
dc.date.accessioned | 2017-02-17T13:14:37Z | - |
dc.date.available | 2017-02-17T13:14:37Z | - |
dc.date.issued | 2006-05 | - |
dc.identifier.uri | http://hdl.handle.net/11375/21132 | - |
dc.description.abstract | <p> We present a symbolic analysis of a class of while loop programs which can automatically derive a closed-form symbolic expression for the input-output relation embodied in that program.</p> <p> We show that this is especially well-suited to analyzing programs from scientific computation, in particular programs which compute special functions (like Bessel functions) from its Taylor series expansion. Other than making heavy use of algebraic manipulations, as available in any computer algebra system, we also require the use of recurrence relations. It is from these recurrence relations that we derive most of our information.</p> <p> It is important to note that we can often get interesting information about a program (like termination) without requiring closed-form solutions to the recurrences.</p> | en_US |
dc.language.iso | en_US | en_US |
dc.subject | symbolic computation, analysis, while loop, algebraic manipulations | en_US |
dc.title | An Analysis of Program by Symbolic Computation | en_US |
dc.type | Thesis | en_US |
dc.contributor.department | Computing and Software | en_US |
dc.description.degreetype | Thesis | en_US |
dc.description.degree | Master of Science (MSc) | en_US |
Appears in Collections: | Digitized Open Access Dissertations and Theses |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Zhai_Yun_2006May_Masters..pdf | 1.86 MB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.