Covers Solver-Aided Programming, integrating SMT solvers for program verification, synthesis, and debugging, along with challenges in building solver-aided tools.
Covers the implementation and verification of encoder and decoder for prefix-free codes, including classes and types, lemmas on trees, and the main theorem.
