Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the automatic synthesis of correct and efficient synchronization in programs, focusing on the goal of generating synchronized programs from an intuitive starting point. The process involves removing redundant atomicity, reordering statements, and adding synchronization metadata. The lecture also explores the challenges of atomicity reduction, the application of transformations, and the generation-check process. Additionally, it delves into concurrent sets, the steps involved in generating and checking synchronization, and the concept of abstraction-guided synthesis for automatic verification. The lecture concludes with a discussion on the IBM Project Paraglide and the implications of abstraction-guided synthesis in program verification.