Image de couverture de livre

Benchmarking Testing in Automated Theorem Proving

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Kim, Jongyoon, Han, Hojae, Hwang, Seung-won
Format:	Preprint
Publié:	2026
Sujets:	Computation and Language Formal Languages and Automata Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Beyond Correctness: Exposing LLM-generated Logical Flaws in Reasoning via Multi-step Automated Theorem Proving
par: Zheng, Xinyi, et autres
Publié: (2025)

Random Testing of Model Checkers for Timed Automata with Automated Oracle Generation
par: Manini, Andrea, et autres
Publié: (2025)

TuringQ: Benchmarking AI Comprehension in Theory of Computation
par: Zahraei, Pardis Sadat, et autres
Publié: (2024)

A Factorization Theorem for Forest Algebras
par: Almagor, Shaull, et autres
Publié: (2026)

Proving Properties of $φ$-Representations with the Walnut Theorem-Prover
par: Shallit, Jeffrey
Publié: (2023)

Completeness Theorems for Kleene algebra with tests and top
par: Pous, Damien, et autres
Publié: (2023)

Myhill-Nerode Theorem for Higher-Dimensional Automata
par: Fahrenberg, Uli, et autres
Publié: (2022)

Büchi-Elgot-Trakhtenbrot Theorem for Higher-Dimensional Automata
par: Amrane, Amazigh, et autres
Publié: (2025)

Kamp Theorem for Pomset Languages of Higher Dimensional Automata
par: Clement, Emily, et autres
Publié: (2024)

The 2-Token Theorem: Recognising History-Deterministic Parity Automata Efficiently
par: Lehtinen, Karoliina, et autres
Publié: (2025)

MLRegTest: A Benchmark for the Machine Learning of Regular Languages
par: van der Poel, Sam, et autres
Publié: (2023)

The No Endmarker Theorem for One-Way Probabilistic Pushdown Automata
par: Yamakami, Tomoyuki
Publié: (2021)

Locality Testing for NFAs is PSPACE-complete
par: Amarilli, Antoine, et autres
Publié: (2025)

Automated Formal Verification of Area-Optimized Safety Registers in Automotive SoCs
par: Zhang, Shuhang, et autres
Publié: (2025)

Black-box Testing Liveness Properties of Partially Observable Stochastic Systems
par: Esparza, Javier, et autres
Publié: (2023)

Automating the Analysis and Improvement of Dynamic Programming Algorithms with Applications to Natural Language Processing
par: Vieira, Tim
Publié: (2026)

HybridProver: Augmenting Theorem Proving with LLM-Driven Proof Synthesis and Refinement
par: Hu, Jilin, et autres
Publié: (2025)

Transducing Language Models
par: Snæbjarnarson, Vésteinn, et autres
Publié: (2026)

Synchronous Signal Temporal Logic for Decidable Verification of Cyber-Physical Systems
par: Roop, Partha, et autres
Publié: (2026)

Prefix Parsing is Just Parsing
par: Pasti, Clemente, et autres
Publié: (2026)

Autoformalization in the Wild: Assessing LLMs on Real-World Mathematical Definitions
par: Zhang, Lan, et autres
Publié: (2025)

LangSAT: A Novel Framework Combining NLP and Reinforcement Learning for SAT Solving
par: Pan, Muyu, et autres
Publié: (2025)

Consistent Autoformalization for Constructing Mathematical Libraries
par: Zhang, Lan, et autres
Publié: (2024)

Directed Regular and Context-Free Languages
par: Ganardi, Moses, et autres
Publié: (2024)

Knee-Deep in C-RASP: A Transformer Depth Hierarchy
par: Yang, Andy, et autres
Publié: (2025)

A Bionic Natural Language Parser Equivalent to a Pushdown Automaton
par: Wei, Zhenghao, et autres
Publié: (2024)

Comparing Spoken Languages using Paninian System of Sounds and Finite State Machines
par: Prabhu, Shreekanth M, et autres
Publié: (2023)

Recursive numeral systems are highly regular and easy to process
par: Prasertsom, Ponrawee, et autres
Publié: (2025)

Bridging the Empirical-Theoretical Gap in Neural Network Formal Language Learning Using Minimum Description Length
par: Lan, Nur, et autres
Publié: (2024)

Explorability in Pushdown Automata
par: Bedi, Ayaan, et autres
Publié: (2025)

Reachability in symmetric VASS
par: Kamiński, Łukasz, et autres
Publié: (2025)

Tutorial: $φ$-Transductions in OpenFst via the Gallic Semiring
par: Cognetta, Marco, et autres
Publié: (2025)

Self-Replicating Mechanical Universal Turing Machine
par: Lano, Ralph P.
Publié: (2024)

Automata-based constraints for language model decoding
par: Koo, Terry, et autres
Publié: (2024)

Cluster automata
par: Kornai, András
Publié: (2025)

On the Representational Capacity of Neural Language Models with Chain-of-Thought Reasoning
par: Nowak, Franz, et autres
Publié: (2024)

A* shortest string decoding for non-idempotent semirings
par: Gorman, Kyle, et autres
Publié: (2022)

Tokenization as Finite-State Transduction
par: Cognetta, Marco, et autres
Publié: (2024)

MASA: LLM-Driven Multi-Agent Systems for Autoformalization
par: Zhang, Lan, et autres
Publié: (2025)

You May Delay, but Time Will Not: Timed Games Under Delayed Control
par: Larsen, Kim G., et autres
Publié: (2025)