A Compositional Semantics for Verified Separate Compilation and Linking

Tahina Ramananandro, Zhong Shao, Shu-Chun Weng, Jérémie Koenig (FLINT, Yale University),
Yuchen (Charles) Fu (Massachusetts Institute of Technology)

CPP 2015

• Conference Paper (final version at ACM Digital Library)
• Paper preprint
• Technical report (YALEU/DCS/TR-1494)
• Conference talk
• Coq proofs

Recent ground-breaking efforts such as CompCert have made a convincing case that mechanized verification of the compiler correctness for realistic C programs is both viable and practical. Unfortunately, existing verified compilers can only handle whole programs: this severely limits their applicability and prevents the linking of verified C programs with verified external libraries. In this paper, we present a novel compositional semantics for reasoning about open modules and for supporting verified separate compilation and linking. Our key idea is to replace external function calls with explicit events in the behavioral semantics. We develop a verified linking operator that makes lazy substitution on (potentially reacting) behaviors by replacing each external function call event with a behavior simulating the requested function. Finally, we show how our new semantics can be applied to build a refinement infrastructure that supports both vertical composition and horizontal composition.