Analysing Pareci
| dc.rights.license | CC-BY-NC-ND | |
| dc.contributor.advisor | Hage, Jurriaan | |
| dc.contributor.advisor | Prasetya, Wishnu | |
| dc.contributor.advisor | Schrijvers, Eljakim | |
| dc.contributor.advisor | Forster, Richard | |
| dc.contributor.author | Soethout, T.M. | |
| dc.date.accessioned | 2013-09-19T17:02:11Z | |
| dc.date.available | 2013-09-19 | |
| dc.date.available | 2013-09-19T17:02:11Z | |
| dc.date.issued | 2013 | |
| dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/14914 | |
| dc.description.abstract | Bugs in Pareci programs are often only found when the application is run. Another issue is that it is also easy to have many database queries, without the developer being fully aware of them. Using static data flow analysis we can find out many of these issues before we run the program and thereby reducing runtime errors and superfluous database queries. This thesis describes what Pareci is, what its computational power is and how to parse it into a form to do program flow analysis on. We define how to create a Monotone Framework instance for Pareci, which is used to run analyses using a maximal fixed point worklist algorithm. We define three analyses that help respectively identify unresolvable bindings, superfluous database queries and incoherent variable type usage. | |
| dc.description.sponsorship | Utrecht University | |
| dc.format.extent | 631261 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en | |
| dc.title | Analysing Pareci | |
| dc.type.content | Master Thesis | |
| dc.rights.accessrights | Open Access | |
| dc.subject.keywords | Program Analysis | |
| dc.subject.keywords | data flow analysis | |
| dc.subject.keywords | monotone framework | |
| dc.subject.keywords | Pareci | |
| dc.subject.keywords | Haskell | |
| dc.subject.keywords | worklist algorithm | |
| dc.subject.keywords | picklers | |
| dc.subject.courseuu | Computing Science |