Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Symbolic string execution
Thesis (MSc)--Stellenbosch University, 2012.
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | en_ZA |
| Published: |
Stellenbosch : Stellenbosch University
2012
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
| _version_ | 1867614126457487360 |
|---|---|
| access_status_str | Open Access |
| author | Redelinghuys, Gideon |
| author2 | Visser, Willem |
| author_browse | Redelinghuys, Gideon Visser, Willem |
| author_facet | Visser, Willem Redelinghuys, Gideon |
| author_sort | Redelinghuys, Gideon |
| collection | Thesis |
| dc_rights_str_mv | Stellenbosch University |
| description | Thesis (MSc)--Stellenbosch University, 2012. |
| format | Thesis |
| id | oai:scholar.sun.ac.za:10019.1/20335 |
| institution | Stellenbosch University (South Africa) |
| language | en_ZA |
| last_indexed | 2026-06-10T12:47:05.324Z |
| license_str | Other — see source repository |
| provenance_str_mv | Harvested via OAI-PMH from SUNScholar — Stellenbosch University Repository |
| publishDate | 2012 |
| publishDateRange | 2012 |
| publishDateSort | 2012 |
| publisher | Stellenbosch : Stellenbosch University |
| publisherStr | Stellenbosch : Stellenbosch University |
| record_format | dspace |
| source_str | SUNScholar — Stellenbosch University Repository |
| spelling | oai:scholar.sun.ac.za:10019.1/20335 Symbolic string execution Redelinghuys, Gideon Visser, Willem Geldenhuys, J. Stellenbosch University. Faculty of Science. Dept. of Mathematical Sciences. Dept. of Computer Science. Automated test generation Symbolic string execution Dissertations -- Computer science Theses -- Computer science Dissertations -- Mathematical sciences Theses -- Mathematical sciences Mathematical Sciences Thesis (MSc)--Stellenbosch University, 2012. ENGLISH ABSTRACT: Symbolic execution is a well-established technique for automated test generation and for nding errors in complex code. Most of the focus has however been on programs that manipulate integers, booleans, and even, references in object-oriented programs. Recently researchers have started looking at programs that do lots of string processing, motivated, in part, by the popularity of the web and the risk that errors in web servers may lead to security violations. Attempts to extend symbolic execution to the domain of strings are mainly divided into one of two camps: automata-based approaches and approaches based on bitvector analysis. Here we investigate these two approaches in a uni ed setting, namely the symbolic execution framework of Java PathFinder. We describe the implementations of both approaches and then do an evaluation to show under what circumstances each approach performs well (or not so well). We also illustrate the usefulness of the symbolic execution of strings by nding errors in real-world examples. AFRIKAANSE OPSOMMING: Simboliese uitvoering is 'n bekende tegniek vir automatiese genereering van toetse en om foute te vind in ingewikkelde bronkode. Die fokus sover was grotendeels op programme wat gebruik maak van heelgetalle, boolse waardes en selfs verwysings in objek geörienteerde programme. Navorsers het onlangs begin kyk na programme wat baie gebruik maak van string prosessering, deelteliks gemotiveerd deur die populariteit van die web en die gepaardgaande risiko's daarvan. Vorige implementasies van simboliese string uitvoering word binne twee kampe verdeel: die automata gebaseerde benadering en bitvektoor gebaseerde benadering. Binne hierdie tesis word die twee benaderings onder een dak gebring, naamliks Java PathFinder. Die implentasie van beide benaderings word bespreek en ge-evalueer om die omstandighede uit te wys waarbinne elk beter sou vaar. Die nut van simboliese string uitvoering word geïllustreer deur dit toe te pas in foutiewe regte wêreld voorbeelde. 2012-02-20T19:35:40Z 2012-03-30T11:04:56Z 2012-02-20T19:35:40Z 2012-03-30T11:04:56Z 2012-03 Thesis http://hdl.handle.net/10019.1/20335 en_ZA Stellenbosch University 87 p. application/pdf Stellenbosch : Stellenbosch University |
| spellingShingle | Automated test generation Symbolic string execution Dissertations -- Computer science Theses -- Computer science Dissertations -- Mathematical sciences Theses -- Mathematical sciences Mathematical Sciences Redelinghuys, Gideon Symbolic string execution |
| title | Symbolic string execution |
| title_full | Symbolic string execution |
| title_fullStr | Symbolic string execution |
| title_full_unstemmed | Symbolic string execution |
| title_short | Symbolic string execution |
| title_sort | symbolic string execution |
| topic | Automated test generation Symbolic string execution Dissertations -- Computer science Theses -- Computer science Dissertations -- Mathematical sciences Theses -- Mathematical sciences Mathematical Sciences |
| url | http://hdl.handle.net/10019.1/20335 |
| work_keys_str_mv | AT redelinghuysgideon symbolicstringexecution |