Lecture

Automatic Verification of Programming Exercises

Description

This lecture introduces a framework for automatically verifying programming exercises, covering topics such as axiomatic processing, model-based representation of programs, implementation issues, and future works. It discusses the use of counterexamples, Hoare triples, and dealing with specific classes of loop-based programs.

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.