We propose using mechanistic interpretability--techniques for reverse engineering model
weights into human-interpretable algorithms--to derive and compactly prove formal …

We address the challenges of scaling verification efforts to match the increasing complexity
and size of systems. We propose a research agenda aimed at building a performant proof …

In this paper we describe the design and implementation of feqb, a tool that synthesizes
sound equality tests for inductive data types in the dependent type theory of the Coq system …

We address the challenges of scaling verification efforts to match the increasing complexity
and size of systems. We propose a research agenda aimed at building a performant proof …

Memory models define semantics of concurrent programs operating on shared memory.
Theory of these models is an active research topic. As new models emerge, the problem of …

The tools and techniques of proof engineering have not yet been applied to the
computational sciences. We try to explain why and investigate their potential to advance the …

Предмет исследования. Модели памяти задают семантику многопоточных программ,
работающих с разделяемой памятью. В настоящее время эта область активно …

Foundational Integration Verification of Diverse Software and Hardware Components Page 1
Foundational Integration Verification of Diverse Software and Hardware Components by …

Предмет исследования. Модели памяти задают семантику многопоточных программ,
работающих с разделяемой памятью. В настоящее время эта область активно …

Proof engineering tools and techniques have not yet been applied to computational
sciences. We try to explain why and investigate their potential to advance the field. More …