Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Watch this 23-minute conference presentation from CPP 2026 that introduces logical pinning, a lightweight borrowing model for sequential programs that enables precise reasoning about container-internal pointers in separation logic. Learn how this approach addresses the modularity challenges in separation logics that typically hide container-internal pointers, making it difficult to specify and verify container APIs that temporarily expose these pointers. Discover how logical pinning generalizes the magic-wand operator for representing partial data structures, allowing developers to selectively track container-internal pointers at the logical level while maintaining compatibility with most separation logic variants. Explore the practical applications through demonstrations of verified pointer-manipulating programs and more precise container specifications, including pointer-stability properties. Understand how this method subsumes well-known proof patterns, simplifies complex proofs, and enables reasoning about program patterns not supported by traditional specifications. The presentation covers mechanized results implemented in the Rocq proof assistant using the CFML library, with all artifacts and supplementary materials available for further exploration.
