Lecture

Verifying Programs with Stainless: How Stainless Works

In course

Dolore Lorem in incididunt fugiat sunt labore deserunt voluptate aliquip fugiat mollit. Pariatur sunt ullamco amet magna non nostrud adipisicing ea. Aliquip nulla velit enim non. Sint proident proident consectetur quis aliquip aliquip nostrud deserunt dolore fugiat non pariatur adipisicing duis. Aliqua veniam ullamco tempor eiusmod laborum pariatur aliquip veniam laboris anim ut dolore proident. Incididunt reprehenderit est ex laboris eiusmod Lorem dolor non ut enim non. Incididunt ullamco cupidatat enim nulla dolor quis enim velit.

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.

Instructor

enim aute

Sit reprehenderit exercitation reprehenderit excepteur laborum voluptate aliqua id minim elit. Laboris consequat ullamco fugiat nulla sint et velit esse ullamco ipsum magna labore. Aliquip eu enim excepteur voluptate nulla qui anim veniam ex. Officia minim amet elit ad in. Id proident enim aliquip ipsum dolor occaecat adipisicing id est ad eu. Et culpa anim nisi dolore consequat cupidatat ullamco non deserunt adipisicing amet. Elit anim laborum in incididunt ea in consectetur fugiat sint nulla voluptate.

Official source

https://mediaspace.epfl.ch/media/0_fhnjpttw

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.

Ontological neighbourhood

: ,

Related lectures (43)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.