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.
Lecture
Concurrency Semantics and Verification
Description
This lecture covers the semantics and verification of concurrent programs, focusing on recursive functions in relational semantics, loops as a special case, and the need to model interleaving in concurrency. It also discusses difficulties in semantics, verifying an interpreter for a concurrent program, and running an interpreter on a schedule. The lecture concludes with the concept of running an interpreter on a schedule and the challenges of verifying concurrent programs.
Official source
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.