Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Watch a 22-minute conference presentation from CPP 2026 that introduces the physical-step modality as a modular building block for step-indexed program logics. Learn how researchers from Radboud University Nijmegen, Aalborg University, and MPI-SWS address the later elimination problem in step-indexed logics, where converting the later modality â–·P into P has traditionally been limited by one-to-one correspondence with program execution steps. Discover how their physical-step modality consolidates existing techniques like flexible step-indexing and later credits, enabling program logic designers to obtain all existing features and proof rules with minimal proof engineering effort. Explore the integration of this modality into various Iris ecosystem projects including Actris, RefinedRust, Perennial, and Trillium, and see how it unlocks new proof rules that these projects previously did not support. Examine the mechanized results implemented in the Rocq prover, providing a comprehensive solution to the challenges of step-indexing in program verification and formal methods.
