ABSTRACT
Proving the correctness of a program transformation, and specifically, of a compiler optimization, is a long-standing research problem. Trusting the compiler requires to guarantee that the properties verified on the source program hold for the compiled target-code as well. Thus, the primary objective of formal correctness verification is to preserve the semantics of the source code, maintaining untouched its logical behavior. Traditional methods for formal correctness verification are not convenient to validate large and complex programs like compilers [1], and intensive testing, despite its proven efficacy, cannot guarantee the absence of bugs [2]. This thesis is part of a larger on-going research project aimed to demonstrate the feasibility to overcome the difficulties of traditional formal methods. K. Namjoshi and L. Zuck [3] propose a new methodology for creating an automated proof to guarantee the correctness of every execution of an optimization. A witness is a run-time generated relation between the source code and the target code, before and after the transformation. The relation is able to represent all the properties that must be valid throughout the optimization, offering a mathematical formula to prove, through a SMT-Solver (typically Microsoft Z3 ), if the invariants hold and the semantics is preserved. This work is a further step towards the implementation of a witnessing compiler [4]: the SimplifyCFG pass of the LLVM compiler framework is augmented with a witness generator procedure which constructs, run-time, the relations to prove the correctness of every single simplification in the control flow graph, performed by the compiler. We show that it is feasible to augment the SimplifyCFG pass with a witness generation procedure. We describe the structure of the code and the mathematical relations designed to demonstrate the correctness of a transformation on the Control Flow Graph. Benchmarks and tests will prove the correct behavior of our implementation and the effectiveness of the witnessing procedure. We provide details about the witnesses and the results of the benchmarks. First, the problem is described, together with the limitations of the traditional methods; then a solution is designed and explained. Details about the actual implementation for the SimplifyCFG code are provided in further sections
Background of the study
Mobile wallet marketing has become an essential component of fintech...
INTRODUCTION
One element that has undergone tremendous change in the past decade is branding and packaging...
Background of the study:
The shift towards cashless payment systems has revolutionized financial transactions across variou...
Chapter One: Introduction
1.1 Background of the Study
Political activism, particularly among the youth, plays a critical role i...
Background of the study
Burn injuries in pediatric patients represent a significant public health issue, accounting for...
Background of the Study
The removal of fuel subsidies in Nigeria has been a contentious economic reform aimed at address...
Chapter One: Introduction
1.1 Background of the Study
Campus newspapers serve as vital platforms for information dissemination,...
Background of the Study
In Nigerian digital communication, code‑mixing—alternating between languages within a single...
ABSTRACT
Ficus platyphylla (Fp) is a medicinal plant that is widely used in Northern part of Nigeria for the management of skin problems...
Chapter One: Introduction
1.1 Background of the Study
Newspaper distribution is a critical component of the print media industr...