Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Verifying Programs with Stainless: How Stainless Works
Description
This lecture delves into the inner workings of the Stainless framework, focusing on verification-aware transformations, dependent type checking, and the Inox counterexample-finder. It explains the principles behind Stainless transformations, termination checking, and SMT embedding, emphasizing the importance of call unfolding for soundness and completeness. The lecture also covers inductive reasoning and the limitations of Stainless, along with its theoretical foundations formalized in Coq.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.