This paper introduces Proof-or-Stop Lifecycle Control, a method that allows lifecycle transitions only when mechanically verifiable evidence is provided, and evaluates its implementation.

The paper investigates the relationship between optimal proof systems and recursive jump operators, showing that while the existence of a jump operator rules out optimality, the converse is provably h…

The paper provides a constructive, intuitionistically valid proof of Rice's Theorem and the Halting Problem undecidability by reducing the problem to the undecidability of Hilbert's Tenth Problem (MRD…

The paper presents a novel technology that uses zero-knowledge proofs to formally verify a software system's correctness against a public specification without revealing the system's internal details.

This paper introduces the because-calculus, a calculus that structurally separates registration and attestation using dual effect rows and level-indexed typing, and proves the Conflation Theorem.

This paper proves several properties about Extended Frege proof systems and circuit equivalence.

This paper formally verifies that the algebraic intermediate representation (AIR) used by the S-two prover correctly captures the computational semantics of the Cairo virtual machine language, ensurin…

This paper describes the use of Codex to complete and stabilize a proof development for a mutable garbage collector in the CertiGraph project, reorganizing the proof around a recorded-backward-edge in…

The paper develops a novel, sound, and complete deductive proof system for proving contract satisfaction, which is crucial for verifying CPU security against side-channel attacks.

This paper introduces reflective grounded arithmetic (RGA), a paracomplete arithmetic system that permits unconstrained recursive definitions, proves the totality of addition and multiplication, repre…

The first formal verification of an out-of-order multiprocessor against an in-order, weak-memory ISA using a core specification and mechanized proofs in Rocq.

The paper studies the resources required to batch verify Boolean functions and provides lower bounds on the witness-query tradeoff based on approximate degree.

This paper introduces ShannonProver, an agentic framework that automates cryptographic proofs in EasyCrypt, allowing for scalable proof verification.

This paper develops distributive laws for parallel composition in a rely/guarantee style theory for reasoning about concurrent programs.

This paper introduces InvWeaver, a neuro-symbolic framework for synthesizing loop invariants in programs with multiple interacting loops.