BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:Automatically proving polynomial positivity using numerical solver
 s\, floating-point computations\, and Rocq formal proofs
DTSTART:20261112T150000Z
DTEND:20261112T160000Z
DTSTAMP:20261119T075700Z
UID:indico-event-17678@indico.math.cnrs.fr
DESCRIPTION:Speakers: Erik Martin-Dorel (IRIT)\n\nInteractive theorem prov
 ing (using a theorem prover such as Rocq\, Lean\, or Isabelle) has been su
 ccessfully used in safety-critical systems (including compilers or cryptos
 ystems) and in many mathematical domains\, where asserting the correctness
  of a result is paramount or error-prone. This methodology allows one to e
 ncode mathematical background\, formally reason about algorithms and their
  correctness proof\, and automatically check the formalized proofs.\nIn th
 is talk\, I will give an overview of the domain\, then present a Rocq libr
 ary (ValidSDP)\, co-developed at ONERA and IRIT: this contributed library 
 offers automatic Rocq tactics that make it possible to automatically and f
 ormally prove multivariate polynomial inequalities within Rocq\, using SDP
  solvers\, but going beyond their inherent rounding errors.\nThe talk will
  be given in French\, with slides in English.\n\nhttps://indico.math.cnrs.
 fr/event/17678/
LOCATION:Pellos (1R2 - 207) (IMT)
URL:https://indico.math.cnrs.fr/event/17678/
END:VEVENT
END:VCALENDAR
