Lecture

What is Formal Verification?

Description

This lecture introduces formal verification as a method to rigorously prove that computer systems satisfy a specification by defining mathematically rigorous notions and using automated tools. A comparison to testing is made, highlighting the advantages of formal verification over traditional testing methods. The feasibility of automated theorem proving is discussed, showcasing how modern software verifiers can efficiently handle complex mathematical theorems. The process of compiling program correctness statements into verification conditions is explained, emphasizing the importance of transforming properties into valid formulas.

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.