Correctness Attraction Analysis in C

Detta är en Kandidat-uppsats från KTH/Skolan för teknikvetenskap (SCI)

Författare: Alexander Hesseborn; Mårten Vuorinen; [2018]

Nyckelord: ;

Sammanfattning: Is the execution of computer programs really deterministic? Will a perturbation cause the program to break or give an incorrect output?In this project, the goal is to add perturbations to programs in C, and see if we can get the same result as the program executed without said perturbations.The algorithm takes source code and transforms it into XML. The code is transformed in order to identify nodes to perturb. When the nodes are identified we add a perturbation to some node and transform the XML code back to source code. When we have the perturbed code we execute the code and compare it to the code executed without any perturbations.We have, using cPerturb, tested several nodes in five differ- ent programs and identified a subset of these which yields the same result as the unperturbed programs.

  HÄR KAN DU HÄMTA UPPSATSEN I FULLTEXT. (följ länken till nästa sida)