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. It covers topics such as verification, control, and interaction in systems with unreliable elements. The lecture delves into the concepts of bounded verification, k-context bounded analysis, and the decidable nature of certain verification problems. It also explores the use of Binary Decision Diagrams for efficient verification procedures. Additionally, it discusses the intersection of geometry, concurrency, and dynamics in programming, emphasizing the importance of feedback and robustness in cyber-physical systems.