Algorithmic Foundations for Systems Certification

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.