A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Enhancing dynamic symbolic execution via loop summarisation, segmented memory and pending constraints
2021
Software has become ubiquitous and its impact is still increasing. The more software is created, the more bugs get introduced into it. With software's increasing omnipresence, these bugs have a high probability of negative impact on everyday life. There are many efforts aimed at improving software correctness, among which symbolic execution, a program analysis technique that aims to systematically explore all program paths. In this thesis we present three techniques for enhancing symbolic
doi:10.25560/91147
fatcat:ec7bjxtiqbe3bgx77cmj6lgfvm