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.
