Lecture

Verifying Programs with Stainless

In course

Minim Lorem sit sint amet dolor. Eu nostrud quis occaecat incididunt nisi fugiat sit non dolor commodo. Esse deserunt ad ullamco nostrud exercitation esse in tempor elit non adipisicing in. Velit mollit exercitation dolor qui duis labore incididunt dolore minim dolore eiusmod qui sint duis. Mollit officia sunt non deserunt laboris tempor aliqua ipsum anim exercitation aliqua pariatur. Esse id in minim et labore anim esse amet deserunt adipisicing esse labore.

Description

This lecture covers the use of Stainless, a tool for verifying programs, with a focus on functional correctness properties, proof assistants like Coq and Isabelle, and dynamic checks. It also discusses the automation of proofs, the verification of systems software, and the verification of various systems such as file systems, distributed systems, blockchain contracts, and data structures. The lecture delves into the use of Scala and Inox SMT solver for verification, the automation of reasoning tasks, and the generation of counterexamples to aid in verification.

Instructor

commodo veniam

Et voluptate nisi sunt veniam commodo consequat ex labore amet pariatur officia. In culpa occaecat enim irure veniam veniam eiusmod adipisicing proident ullamco. Ad in Lorem quis dolore eiusmod laborum irure. Quis in cillum duis et mollit elit laboris sint minim nulla velit. Commodo ut minim mollit voluptate dolore est ad officia. Culpa id aliquip est eiusmod eu do magna cupidatat culpa laboris consequat pariatur commodo commodo.

Official source

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

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

Theoretical computer science

Programming language theory: High-level programming languages

Related lectures (25)

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.