Benjamin Goldberg Compiler Verification and Optimization Formally verifying that the compiler generates correct target code Relies on formal methods and theorem-proving techniques developed in the NYU ACSys group (Profs. Pnueli, Barrett,Cousot, etc.) Developing compiler optimizations for advanced computer architectures Embedded Processors: Optimizations for minimizing power and memory consumption in addition to reducing execution time Parallel Architectures: Optimizations exploiting instruction-level parallelism, multicore machines, etc.

Compiler Verification using Translation Validation (TV) Translation Validation is invoked after every compilation to prove that the target code is equivalent to the source code. challenge is to perform the validation in the presence of compiler optimizations that radically change the structure of the program (e.g. loop optimizations) As compiler runs, it generates “verification conditions” (assertions) that are then fed to the theorem prover to prove. If the conditions are proved, the compilation is correct. Front End Code Generation IR Global Optimizations (CSE, Dead Code Elim, Const Folding, Copy Prop) Loop Optimizations (Interchange, Tiling, etc) Machine Dependent Optimizations C, Fortran IA-64 Assembly INTEL Open Research Compiler (ORC) Translation Validation Tools “YES” or “NO”