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…

This paper proves DP-completeness of Exact-3-DNP and Exact-4-DNP by reducing 3SAT to these problems.

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.

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 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…

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 introduces RePoT, a method that significantly improves Program-of-Thought (PoT) planning by deterministically verifying the initial plan prefix and using a single LLM call to resume planning…

The paper provides a unified algebraic framework to determine the formal language expressivity of recurrent neural language models, resolving conflicts in existing literature by linking expressivity t…

KoAT is a tool that automatically infers complexity bounds and proves termination of integer programs using an alternating modular analysis approach and a portfolio of techniques.

This paper proves that testing the equivalence of finite closure systems specified by implicational and intersection methods is coNP-complete.

This paper proposes a compact semantics for nonterminating computation residuals using tail-clusters in the Stone-Cech compactification, providing a common framework for various types of recurrence an…

This paper introduces an activation hierarchy and proves a Predictor-Impossibility Theorem, showing that no effective predictor family can determine all stage languages. It also establishes a slice th…

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…

This paper analyzes the computational complexity of evaluating recurrent functions, showing that the complexity depends heavily on how the input offsets are encoded and the structure of the recurrence…

This paper studies the structural expressivity and parameterized complexity of counting homomorphisms from small temporal patterns to large temporal graphs, proving a temporal Lovász-style theorem, in…

The paper proposes Completion at the Boundary (CaB), a method that predicts event-local completion objects using Boundary-Phase Tokens to improve the reliability of multi-step, handoff-heavy tasks for…

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

The paper introduces REBench, a comprehensive, standardized benchmark dataset designed to enable fair and rigorous evaluation of Large Language Models (LLMs) on complex binary reverse engineering task…

The paper shows that every problem asking if a given graph has an edge-coloring without an edge-colored clique from a fixed family is poly-time equivalent to a Constraint Satisfaction Problem, resulti…

This paper proposes a method for verifying functional correctness of message-passing concurrent programs using Constrained Horn Clause (CHC) solving.