Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Watch this 12-minute conference presentation from OOPSLA 2025 that introduces a novel approach to program verification for heap logics through FO-completeness. Learn about the theoretical foundations of FO-complete verification, which guarantees that all theorems valid under fixpoint interpretations of recursive definitions will eventually be proven by the system. Explore the design principles for creating expressive heap logics that achieve this completeness property, including the development of two new logics: Frame Logic (FL) and a separation logic variant (SL-FL) with frame logic-inspired semantics. Discover how these logics incorporate implicit heaplets and support verification condition generation techniques compatible with quantifier instantiation and SMT solvers. Examine the practical implementation of these theoretical concepts through tools that demonstrate the expressiveness of the logics and their effectiveness on benchmarks involving data structure manipulation. Gain insights into how this work addresses the inherent incompleteness of traditional program verification techniques for expressive heap logics by establishing a robust theoretical standard for completeness in algorithmic reasoning systems.
