Lecture

Verifying Programs with Stainless: Part 2

Description

This lecture covers the usage of Stainless for program verification, focusing on verifying programs and ensuring correctness. The instructor demonstrates the process of using Stainless to verify programs, including defining specifications, ensuring postconditions, and checking termination. The lecture also includes examples of verifying functions, such as nonEmptyListSize and zip, using Stainless and SMT solvers. The importance of defining postconditions and measures for recursive functions is highlighted, along with the significance of ensuring the correctness of the verification conditions. The lecture concludes with a discussion on the power of Stainless in accurately verifying programs and the contributions of various researchers and collaborators to the project.

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.

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.