Verifying Programs with Stainless: How Stainless Works
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.
Explores the languages of Isabelle, focusing on Isar, ML, and Scala, covering proof schemes, Natural Deduction rules, inductive definitions, and the LCF approach.
Explores bug-finding, verification, and the use of learning-aided approaches in program reasoning, showcasing examples like the Heartbleed bug and differential Bayesian reasoning.
Explores fracture mechanics, crack growth, and the weakest link theory, emphasizing the statistical distribution of crack sizes and the significance of the largest crack in material failure.
