Post

Automatic Checking of Compiler Correctness with E-Graphs

Adam Chlipala describes a Rocq-verified e-graph engine for automatically proving correctness obligations in modular compiler definitions. The research targets typed functional-language compiler transformations, not general verification of GCC or Clang.

The reported case studies discharged most obligations automatically, with about five of roughly 200 requiring manual proofs. Search can still run out of time or memory; failure to prove is not proof of a bug.