Abstract
It is very important that the compiler optimization works correctly without changing the semantics of a program. However, because there are a lot of complex optimizations, it is difficult to implement them correctly in general. In this paper, we propose a technique for validating whether the optimization transformation into the program have been done correctly or not by using temporal logic after the execution of the optimizer. We describe the properties that points of optimization transformation have to satisfy by using temporal logic, and we check whether these points satisfy the formulas by model checking of the program. This technique can be applied to complex optimizers that already exist, and it can be executed in the realistic time. We implemented and executed this technique, and we found an unknown bug of an optimizer in the COINS compiler.
