Lecture

Disasters, Successes, and Inductive Invariants

In course
DEMO: id reprehenderit id
Excepteur amet veniam proident occaecat quis voluptate irure. Ut proident voluptate Lorem duis velit eiusmod deserunt nisi non nostrud sit. Laborum commodo fugiat nostrud proident mollit consequat quis. Et tempor ea do nostrud veniam. Duis pariatur aliqua adipisicing esse sit amet duis nulla nulla irure esse.
Login to see this section
Description

This lecture covers the impact of verification through examples of software disasters like the Ariane 5 rocket explosion and successful cases such as Airbus control software verification. It introduces transition systems, explicit-state reachability checking algorithms, and invariants in systems.

Instructor
incididunt aliquip voluptate
Duis tempor sunt consequat aute fugiat qui dolore sint esse ipsum adipisicing officia veniam. Id nulla laboris Lorem occaecat magna sint. Proident quis dolore tempor dolore mollit. Tempor dolor eu do elit nisi enim. Nisi exercitation ad reprehenderit ut aute sint eiusmod exercitation eu proident.
Login to see this section
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.
Related lectures (34)
Software Disasters and Successes: Verification Impact and Transition Systems
Explores software verification impact, disasters, successes, and transition systems.
Compiler verification: Challenges and Benefits
Explores the challenges and benefits of compiler verification, emphasizing the importance of verifying compilers for critical software.
Software Correctness: Testing and Verification
Explores software correctness through testing, verification, property-based fuzzing, and dynamic information flow control.
Stainless Tutorial: Verification of Scala Code
Covers the use of Stainless, a verification tool for Scala, to ensure the correctness of Scala code.
Stochastic Hybrid Systems
Explores time-determinator model checking, U-Pool scheduling, worst-case execution time analysis, and statistical model checking for cyber-physical systems.
Show more

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.