Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Watch a 22-minute conference talk from CoqPL 2025 that explores the development of a framework for verifying numerical algorithm variants. Presented by researchers from Harvey Mudd College and Lawrence Livermore National Laboratory, this talk addresses the challenge of ensuring correctness in reimplemented classical numerical algorithms amid the evolving landscape of scientific computing. Learn about their preliminary work using the Gram-Schmidt orthogonalization process as a case study, demonstrating how to verify a numerically stable variant (Modified Gram-Schmidt) through exact Real equivalence with its classical counterpart. The presentation was delivered at the ACM SIGPLAN-sponsored CoqPL 2025 workshop on January 25, 2025.
