Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Covers Solver-Aided Programming, integrating SMT solvers for program verification, synthesis, and debugging, along with challenges in building solver-aided tools.
Introduces formal verification and its advantages over traditional testing methods, discussing automated theorem proving and compiling correctness statements into verification conditions.
Explores time-determinator model checking, U-Pool scheduling, worst-case execution time analysis, and statistical model checking for cyber-physical systems.
