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.
Mathematical proofs are a cornerstone of control theory, and it is crucial to get them right. Deduction systems can help with this by mechanically checking the proofs. However, the structure and level of detail of mechanized proofs can differ vastly from manual proofs by mathematicians and engineers, hampering understanding and adoption of these systems.This paper helps bridging the gap between manual and machine-checked proofs by presenting a mechanized stability proof using Lyapunov’s theory in a human-readable way and wrapping it into a workflow. The proof structure is analyzed and potential benefits of mechanization are discussed, such as generalizability, reusability, and increased trust in correctness.
George Candea, Can Cebeci, Clément Pit-Claudel