Article

Proof-Carrying Evolution: Language Models Design Formally Verifiable Controllers

The study proposes Proof-Carrying Evolution (PCE), in which a language model provides both a controller and its certificate during search; only candidates that pass certificate verification can be returned, and the deployed artifact is the control law together with its certificate. The authors compare four language models with classical search and synthesis methods on speed-limited docking, maneuvering-target pursuit, and SO(3) attitude control. Certificates for linear problems are verified using exact rational arithmetic; on SO(3), floating-point verification is followed by exact re-verification of each reported champion. The best run of each method also receives a Lean 4 proof.

Part of the event: Language Model Search for Verifiable Controllers: The PCE Method

This page provides a summary and source link only.