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
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 by the instructor delves into the concept of invariants in a bounded counter system, exploring properties satisfied by reachable states and the notion of inductive invariants. Through examples and exercises, the lecture demonstrates how inductive invariants strengthen the understanding of system behavior and help prove the correctness of properties. The lecture also covers the practical application of invariants in verifying system behaviors and the importance of algorithms like bounded model checking and model checking using binary decision diagrams.