Võrrandi lahendamine kombineeritud laiendamise ja kitsendamise abil Coqis
| dc.contributor.advisor | Apinis, Kalmer, juhendaja | |
| dc.contributor.author | Sammul, Kadi | |
| dc.contributor.other | Tartu Ülikool. Loodus- ja täppisteaduste valdkond | et |
| dc.contributor.other | Tartu Ülikool. Arvutiteaduse instituut | et |
| dc.date.accessioned | 2024-09-25T13:46:06Z | |
| dc.date.available | 2024-09-25T13:46:06Z | |
| dc.date.issued | 2024 | |
| dc.description.abstract | In program analysis constraint solving via sets of values is time-consuming and needs a lot of memory. Therefore, it is wiser to use widening. Widening makes analysis inaccurate - to restore accuracy narrowing can be used. Using combined widening and narrowing we create an algorithm in Coq, where in addition to finding a solution we guarantee the termination of the analysis. | |
| dc.identifier.uri | https://hdl.handle.net/10062/104903 | |
| dc.language.iso | et | |
| dc.publisher | Tartu Ülikool | et |
| dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Estonia | en |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/ee/ | |
| dc.subject | Coq | |
| dc.subject | programmianalüüs | |
| dc.subject | kombineeritud laiendamine ja kitsendamine | |
| dc.subject | program analysis | |
| dc.subject | combined widening and narrowing | |
| dc.subject.other | magistritööd | et |
| dc.subject.other | informaatika | et |
| dc.subject.other | infotehnoloogia | et |
| dc.subject.other | informatics | en |
| dc.subject.other | infotechnology | en |
| dc.title | Võrrandi lahendamine kombineeritud laiendamise ja kitsendamise abil Coqis | |
| dc.type | Thesis | en |