Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore a 16-minute conference presentation from OOPSLA 2025 that introduces a formal foundation for memory-model-parametric compositional symbolic execution platforms. Learn how researchers from Imperial College London advance the state of the art by providing the first mechanized foundation for CSE platforms that can be instantiated to different memory models, enabling more flexible analysis of diverse programming languages. Discover how this work extends beyond previous separation logic-only approaches to cover both separation logic and incorrectness separation logic analyses, while maintaining compatibility with standard definitions to ensure sound interoperation with existing tools. Examine the validation of this foundation through instantiation to various memory models including those for C and CHERI programming languages, and understand how the mechanization in the Rocq interactive theorem prover provides formal guarantees. Gain insights into how memory-model-parametric approaches enable custom automation, improved performance, and broader language support in compositional verification and bug-finding tools like VeriFast, Viper, Gillian, CN, and Infer-Pulse.
