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.

Official source

https://mediaspace.epfl.ch/media/0_s9co04an

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.

Ontological neighbourhood

Theoretical computer science

Programming language theory: High-level programming languages

Related lectures (29)

Graph Chatbot

Chat with Graph Search

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.