Making Objects Count: A Shape Analysis Framework for Proving Polynomial Time Termination
About this video
Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidenceDemonstrates shape analysis for proving algorithm termination. Technical lecture on static analysis methods for verifying program complexity bounds.
A 68-minute video from Microsoft Research: “Making Objects Count: A Shape Analysis Framework for Proving Polynomial Time Termination”.
Video by Microsoft Research, played through YouTube's embedded player.