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

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…

KVerus is a retrieval-augmented system that significantly improves the scalability and resilience of formal verification for Rust code by managing complex cross-module dependencies and adapting to cod…

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 proposes a federated formal verification architecture that treats verification as a polyglot proof system, successfully validating it on complex production subsystems like a Raft consensus m…

SEMBridge is a tagless-final framework that allows a single executable object program to generate multiple program semantics, including weakest-precondition and bounded-checking interpretations, ensur…

The paper analyzes a fragment of Higher-Order Datalog, showing that restricting recursion to a linear form shifts its expressive power from time complexity to space complexity, specifically capturing…

The paper proposes a trust-boundary architecture using Lean 4 to verify the deterministic structured computations surrounding LLM pipelines, providing verifiable certificates for high-stakes deploymen…

This paper provides a focused, preparatory introduction to sheaves and topoi, establishing the necessary structural background to understand the advanced sheaf-theoretic framework used in cryptographi…

The paper introduces ProofLoop, a novel ReAct agent that uses a solver-in-the-loop approach to automatically generate and formally verify SystemVerilog Assertions (SVA) from natural language specifica…

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.

The paper evaluates LLM reasoning on Boolean satisfiability (SAT) problems, concluding that conventional metrics are misleading and proposing a paired-formula protocol with Accurate Differentiation Ra…

The paper establishes that for quantifier-free dependence logic formulas, the property of k-coherence is equivalent to first-order rewritability, and analyzes the computational complexity of checking…

KACE introduces a novel knowledge-adaptive context engineering framework that separates knowledge storage from usage, significantly improving mathematical reasoning accuracy on challenging benchmarks…

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.

The paper introduces DPrivBench, a new benchmark to test whether large language models (LLMs) can automate the complex reasoning required to verify differential privacy guarantees for algorithms.

The paper introduces Heimdall, an automated pipeline that uses LLMs and formal verification to safely and automatically migrate legacy, potentially buggy eBPF programs written in C to memory-safe Rust…

The paper proposes a bottom-up, system-oriented approach to formally verify authorization algorithms for large-scale, Byzantine fault-tolerant local-first systems, using Rust and the Verus framework.

The paper introduces a systematic, executable taxonomy of security properties to bridge the gap between theoretical security definitions and their practical implementation in formal verification tools…

The paper identifies and demonstrates that post-conclusion continuation in answer-correct long-CoT traces is harmful during LLM fine-tuning, proposing a method to cut this continuation.