Skip to content

FormalTCS: Benchmarking End-to-End Frontier Formal Theoretical Computer Science Research of Large Language Models

Aug 2026 · 0 citations · 25 references
Computer Science

TL;DR

An automated TCS research framework that generates, formalizes, filters, and proves new claims, and further develops an automated TCS research framework that generates, formalizes, filters, and proves new claims.

Abstract

Large language models (LLMs) have shown growing potential for automated theoretical computer science (TCS) research, yet existing benchmarks remain far from realistic research settings. We introduce \ourbenchmark, an expert-validated benchmark for evaluating LLMs on frontier, end-to-end TCS research. \ourbenchmark contains $143$ instances drawn from papers accepted to STOC, FOCS, SODA, and COLT in 2025-2026, preserving paper-specific definitions, assumptions, and proof dependencies, with expert-verified Lean formalizations and proofs. Evaluations of leading LLMs reveal that current models remain far from reliably completing the full research pipeline. In particular, autoformalization is the sharpest bottleneck: the best model achieves only $11.5$ on translating natural-language claims into formal theorem statements, compared with $28.6$ Pass@8 when proving human-provided formal statements. Building on \ourbenchmark, we further develop an automated TCS research framework that generates, formalizes, filters, and proves new claims. Of $64$ generated claims, only $6$ ultimately pass expert evaluation and proof verification, indicating that beyond formalization, limited research taste remains another major barrier to autonomous TCS research.

View source

Similar papers

#natural language process... Preprint Aug 2026

TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability

We introduce TCS-Bench, a benchmark for evaluating Large Language Models (LLMs) on research-level Theoretical Computer Science (TCS) proof generation. TCS-Bench consists of theorem-proving tasks from papers published at top theoretical computer science venues (STOC, FOCS, and SODA). Each task provides the necessary context to derive a self-contained proof for a target result. We evaluate state-of-the-art models on this benchmark. We verify the correctness of generated proofs via a verification agent, and further benchmark the verifier against human-expert proof judgements on a set of target statements and generated proofs pairs. Our reference verifier achieves over 90% accuracy on the expert labeled set.

Vincent Cohen-Addad, Dimitris Paparas, E. V. Wijland et al. · 1 citation
Review Jul 2026

From Solvers to Research: Large Language Model-Driven Formal Mathematics at the Research Frontier

It is argued that the next leap in AI4Math systems requires a decisive shift from predefined problem-solvers to research agents that can address frontier mathematical challenges with rigorous formal mathematical reasoning, highlighting core limitations of existing systems in serving as mathematical research agents.

E. Jiang, Xiao Liang, Yikai Zhang et al. · 1 citation

Modular End-to-End Pipeline for Formal Property Verification using Large Language Models

A modular, end-to-end pipeline for FPV using Large Language Models is introduced and results show that the assertion pass rate can be improved by more than 2x and formal coverage can be improved by 86% with this pipeline compared to the baseline.

Luca M¨uller, C. Jha, Benjamin Arlt et al. · 0 citations
Preprint Jul 2026

Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs

This work proposes Formal Disco: a distributed system for coordination of LLM-based workers that can be easily applied to open-ended synthetic data generation at scale and proposes a principle of maximum entropy for synthetic program generation.

Gabriel Poesia, Simon Henniger, Tzu-Han Hsu et al. · 0 citations
#software testing Preprint Aug 2026

An Empirical Evaluation of Using Large Language Models for Automated Model-Based Test Generation

This paper presents an empirical evaluation of Large Language Models (LLMs) for automated model-based test generation, compared with a state-of-the-art model-based testing tool (GraphWalker) and its built-in algorithms (random and quick random for edge and vertex coverage settings).

Hafize Sanli, Onur Kilinççeker, Cihat Çetinkaya · 0 citations

Related blog posts

MIT News · Artificial Intelligence Aug 27, 2026

Looking beyond natural sequences

A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.