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.
This lecture by the instructor from Max Planck Institute for Software Systems focuses on the challenges of designing systems with untrustworthy components, emphasizing the importance of algorithmic design and analysis for systems certification. The lecture covers topics such as verification, control, and interaction in systems with unreliable components, including multithreaded shared-memory programs and k-context bounded analysis. It also delves into the decidable nature of context-bounded reachability problems and the use of Binary Decision Diagrams for efficient verification. The presentation explores the theoretical foundations and practical applications of certification engineering, emphasizing the need for trust in system design and the role of algorithmic insights in ensuring system reliability.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on Mediaspace