no code implementations • 23 Jan 2024 • Dylan Zhang, Curt Tigges, Zory Zhang, Stella Biderman, Maxim Raginsky, Talia Ringer
The framework includes a representation that captures the general \textit{syntax} of structural recursion, coupled with two different frameworks for understanding their \textit{semantics} -- one that is more natural from a programming languages perspective and one that helps bridge that perspective with a mechanistic understanding of the underlying transformer architecture.
no code implementations • 24 May 2023 • Shizhuo Dylan Zhang, Curt Tigges, Stella Biderman, Maxim Raginsky, Talia Ringer
Neural networks have in recent years shown promise for helping software engineers write programs and even formally verify them.
no code implementations • 8 Mar 2023 • Emily First, Markus N. Rabe, Talia Ringer, Yuriy Brun
Recent work has developed methods to automate formal verification using proof assistants, such as Coq and Isabelle/HOL, e. g., by training a model to predict one proof step at a time, and using that model to search through the space of possible proofs.
2 code implementations • 2 Oct 2020 • Talia Ringer, RanDair Porter, Nathaniel Yazdani, John Leo, Dan Grossman
We describe a new approach to automatically repairing broken proofs in the Coq proof assistant in response to changes in types.
Programming Languages
