Exploring Well-Quasi-Orderings in Program Analysis & Complexity 🚀
Join Philippe Schnoebelen and Sylvain Schmitz as they delve into how well-quasi-orderings are applied to program analysis and computational complexity. Discover key insights from their December 2015 talk!
pronkedelic
57 views • Feb 26, 2023
About this video
Wednesday 16th December 2015 - 10:00 to 11:00
Abstract: Co-author: Sylvain Schmitz (ENS Cachan)
The talk will survey some of the applications of well-quasi-orderings in computer science. Well-quasi-orderings are an important tool in some areas like program verification, or computer-aided deduction and theorem-proving. Most importantly, they provide easy proofs for the decidability of logical or combinatorial problems. Recent work by the authors aim at extracting computational complexity bounds from decidability proofs that rely on well-quasi-orderings.
Abstract: Co-author: Sylvain Schmitz (ENS Cachan)
The talk will survey some of the applications of well-quasi-orderings in computer science. Well-quasi-orderings are an important tool in some areas like program verification, or computer-aided deduction and theorem-proving. Most importantly, they provide easy proofs for the decidability of logical or combinatorial problems. Recent work by the authors aim at extracting computational complexity bounds from decidability proofs that rely on well-quasi-orderings.
Video Information
Views
57
Likes
2
Duration
01:00:12
Published
Feb 26, 2023
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.