About

compiler.ai demo is a research effort at re-imagining the compilation infrastructure. We employ AI algorithms to automatically optimize programs. We employ formal verification techniques to generate confidence in the correctness of the optimizations. As our research matures, we intend to provide links to working demos and downloadable packages on this page.

Quick links

Counter algorithm for blackbox equivalence checking

Are you an assembly language developer? Or do you want to validate the code generated by a compiler? Our equivalence checker can compute equivalence between a C program and its optimized, usually aggressively vectorized assembly code implementation. The assembly code implementation may be generated by a compiler or hand-written. The algorithm that automatically constructs an equivalence proof is called Counter, and to the best of our knowledge, it is the most robust equivalence checking algorithm till date. You can try it yourself at the following online demo links.

Counter Demo

You can run the Counter equivalence checking algorithm for yourself here.
Or, check out the following preloaded examples:

Demo for equivalence across C source and x86-32 assembly programs: s000, sum1d, kernel_mvt
Demo for equivalence across unoptimized and optimized C source programs: bitflip, strlen, nestedLoop
Demo for inequivalence across C programs: mul, inequiv_1, inequiv_2
Bugs found by our verification tools

Counter Download

Counter source code is available at github.com/compilerai/counter.

OOElala optimizing compiler

Programming languages like C and C++ leave the Order of Evaluation of operands in an expression unspecified. This provides optimization leverage, with resulting speedups as high as 2.6x on real-world code. This optimization opportunity was hitherto not exploited by modern compilers. Our optimizing compiler, OOElala, which is based on Clang/LLVM, includes an algorithm to realize this latent performance opportunity. Please see the PLDI 2020 paper on OOElala for more details.

OOElala Demo and Examples

You can try OOElala for yourself here. Here are some pre-configured examples that demonstrate OOElala in action.

MinMax (Figure 1 in paper). Speedup: 1.5x.
Assign and Accumulate (An isomorphic pattern was discovered by OOElala in SPEC CPU2017's code imagick application). Speedup: 1.66x
Assign and Increment Index. Speedup: ~15x.
Read Array of Characters in a Struct (from SPEC CPU2017's x264)
Parsing a string (from SPEC CPU2017's perlbench). Speedup: 5.33%

OOElala Download

OOElala source code is available at github.com/compilerai/ooelala-project.

Relevant Publications

Brief descriptions of these papers are available at this Github page.

Collaborate with us

We are looking for both young and accomplished researchers and engineers to work and/or collaborate with us. If you are interested in sharing the excitement and joy of participating in our efforts towards the creation of a new type of compilation infrastructure, here are some potential ways we can collaborate.

Collaborate with us remotely in our development efforts. If you are interested in such a collaboration, please send us a note. We would love to have a meaningful collaboration that may help all of us achieve our research goals faster. That said, we cannot accept all collaboration requests, as we need to carefully balance the synchronization and starting overheads with the benefits of collaborating. Such a collaboration would perhaps work best if you are already an expert working in this domain and you feel interested in knowing more about our efforts.
Join us at IIT Delhi either as visiting faculty, Postdoc, or PhD candidate.
Join us at IIT Delhi as a Research Associate for a minimum duration of eighteen months.

Please reach out to Sorav Bansal to take this conversation forward.

Acknowledgements: The online demo links are based on Compiler Explorer.