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
Introduction to Quantifier Elimination for Presburger Arithmetic
Description
This lecture introduces the formal verification methodology for programs, focusing on expressing properties in logic, compiling them into logical formulas, and using automated theorem provers. It delves into Presburger arithmetic, a decidable theory with applications in program verification and automated reasoning.
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.