Matthew Sottile - Physics to Simulation: The Deep Stack of Formalization - IPAM at UCLA

Matthew Sottile - Physics to Simulation: The Deep Stack of Formalization - IPAM at UCLA

Formal & Physical Sciences Physics PHPhysicsPHUMathematical
🎙 Matthew Sottile 👥 43K 📅 September 19, 2026 ⏱ 32 min 👁 145 📄 expert opinion 🧭 2026-09-19
Available in: English (current) Français

Keywords

formalizationverificationPDEsimulationproof assistant

Summary

The talk, presented by Matthew Sottile from Lawrence Livermore National Laboratory, offers a perspective on the challenges and opportunities in formally verifying scientific computing codes. Sottile argues that unlike traditional program verification where specifications are authoritative documents (e.g., AES standard), physical modeling lacks such fixed specs because the specification is part of the modeling choices. He illustrates this with an example of simulating a supersonic jet and shock interaction, where different codes use fundamentally different formulations (Eulerian, Lagrangian, ALE) yet target the same physics. He proposes a layered view of formalization, from continuous PDEs at the top, through discretization, meshes, linear algebra, floating-point, and finally code, each with its own correctness concerns. He emphasizes that constraints flow both ways: physics dictates discretization choices, and implementation details like non-deterministic reductions propagate upward. He also discusses the maturity of existing formalization efforts, noting that while OS-level and cryptographic verification is mature, libraries for meshes and schemes are lacking. He highlights the issue of proof rot due to fast-moving proof assistants and the lack of interoperability between them. Overall, the talk advocates for increased investment in building reusable formalization libraries for numerical methods.

190 words

Critical Evaluation

Value of the Information & Strength of the Argument

He provides valuable insights into the unique challenges of verifying scientific computing software, contrasting it with more traditional verification domains. The argument is well-supported by concrete examples from his own experience, such as the supersonic jet problem and the Marmaid test code. He convincingly demonstrates that the lack of authoritative specifications in physics-based simulation makes formalization fundamentally different. The layered abstraction model is a useful framework for reasoning about correctness at various levels. However, some claims, such as the maturity assessments, are somewhat subjective and could benefit from more explicit citations or quantifiable data. Nonetheless, the argumentation is coherent and thought-provoking.

Scientific Rigor, Source Quality, Title Accuracy

The talk demonstrates a strong command of the subject, referencing established tools like Mathlib, VST, CompCert, and the Archive of Formal Proofs. However, specific papers or external references are not explicitly cited with URLs, relying instead on general knowledge. The only provided source is the IPAM workshop page from the description, which offers context but no direct link to the speaker’s claims. The title is accurate and well-matched to the content, which systematically deconstructs the formalization stack. Overall, the talk is scientifically rigorous in its reasoning, though it would benefit from more explicit references to support specific claims about maturity levels.

217 words

Title / Content Match

The title accurately reflects the talk's focus on the multi-layered formalization stack from physical models to executable simulations.

Quality & Reliability

8/10

The speaker is a researcher at Lawrence Livermore National Laboratory with extensive experience in formal methods and scientific computing. He provides concrete examples from his own work and references established tools like Mathlib and VST. The talk is well-structured, though it presents a personal perspective rather than new research results. Overall, the information is reliable and grounded in practical experience.

Key Moments

Cited Sources

Contribution & Novelties

This talk offers a systematic perspective on the formalization of the entire simulation stack, highlighting the lack of reusable libraries for numerical methods and the challenges of interoperation between proof assistants. It uniquely identifies the bidirectional flow of constraints between physics, discretization, and implementation, and introduces the notion of ‘proof rot’ due to fast-evolving provers.

Pour aller plus loin :

  • Formal verification — Concepts de base de la vérification formelle, pertinents pour comprendre le contexte.
  • Proof assistant — Outils comme Lean, Coq, Isabelle, utilisés pour formaliser les mathématiques et les programmes.
  • CompCert — Compilateur C formellement vérifié, exemple de vérification de logiciel critique.

103 words

Radar Profile

The radar profile is balanced, with high scores in qualitative assessment and moderate scores in quantity and technical depth, reflecting a well-rounded but not exhaustive presentation.

Reliability 8/10