No article text was recorded for this version.
manual proof overhead
Version 1 of 1118 papers129 conceptsfrozen 2026-10-04
Papers in this version
- Blog: A formally verified proof of the prime number theorem
- Blog: Syntheto: A Surface Language for APT and ACL2
- Blog: Verified Indifferentiable Hashing into Elliptic Curves
- Blog: Can a Lightweight Automated AI Pipeline Solve Research-Level Mathematical Problems?
- Blog: Introduction to Milestones in Interactive Theorem Proving
- Blog: Mathematics and the formal turn
- Blog: Preface: Selected Extended Papers from Interactive Theorem Proving 2018
- Blog: Automated Discovery of Tactic Libraries for Interactive Theorem Proving
- Blog: Reo2PVS: Formal Specification and Verification of Component Connectors
- Blog: Model-Checking the Higher-Dimensional Modal mu-Calculus
- Blog: Towards Formal Modeling and Verification of Probabilistic Connectors in Coq (S)
- Blog: Proof Automation with Large Language Models
- Blog: Neural Theorem Proving for Verification Conditions: A Real-World Benchmark
- Blog: Accelerating Automated Program Verifiers by Automatic Proof Localization
- Blog: Rely-guarantee Reasoning about Concurrent Memory Management: Correctness, Safety and Security
- Blog: Verifying Bit-vector Invertibility Conditions in Coq (Extended Abstract)
- Blog: Using LSTM to Predict Tactics in Coq
- Blog: Tactical contract composition for hybrid system component verification
- Blog: Combining Classical and Probabilistic Independence Reasoning to Verify the Security of Oblivious Algorithms
- Blog: Generalizing Logic Circuit Designs by Analyzing Proofs of Correctness
- Blog: Library Before Proof: Making LLM-Generated Rocq Usable by Mathematicians
- Blog: Infinite Objects in Type Theory
- Blog: A Comparative Evaluation of Interventions Against Misinformation: Augmenting the WHO Checklist
- Blog: Proving Differential Privacy with Shadow Execution
- Blog: ImProver: Agent-Based Automated Proof Optimization
- Blog: ARCH-COMP22 Category Report: Hybrid Systems Theorem Proving
- Blog: Combining Classical and Probabilistic Independence Reasoning to Verify the Security of Oblivious Algorithms (Extended Version)
- Blog: DafnyPro: LLM-Assisted Automated Verification for Dafny Programs
- Blog: Bit-Blasting ACL2 Theorems
- Blog: HMC: Verifying Functional Programs Using Abstract Interpreters
- Blog: Lean Copilot: Large Language Models as Copilots for Theorem Proving in Lean
- Blog: A monadic framework for relational verification: applied to information security, program equivalence, and optimizations
- Blog: ARCH-COMP20 Category Report: Hybrid Systems Theorem Proving
- Blog: HolStep: A Machine Learning Dataset for Higher-order Logic Theorem Proving
- Blog: How General-Purpose Is a Language Model? Usefulness and Safety with Human Prompters in the Wild
- Blog: Obvious Logical Inferences
- Blog: Homotopy limits in type theory
- Blog: ARCH-COMP23 Category Report: Hybrid Systems Theorem Proving
- Blog: Developing Bug-Free Machine Learning Systems With Formal Mathematics
- Blog: Verifying a Sliding Window Protocol in mCRL
- Blog: Reflective Reasoning with and between a Declarative Metatheory and the Implementation Code
- Blog: Almost all primes are partially regular
- Blog: A Usage-Aware Sequent Calculus for Differential Dynamic Logic
- Blog: Lean-auto: An Interface between Lean 4 and Automated Theorem Provers
- Blog: Event-based Compositional Reasoning of Information-Flow Security for Concurrent Systems
- Blog: A Program Logic for Verifying Secure Routing Protocols
- Blog: Magnushammer: A Transformer-Based Approach to Premise Selection
- Blog: Complete Integer Decision Procedures as Derived Rules in HOL
- Blog: Generating correctness proofs with neural networks
- Blog: A Logic of Belief and a Model Checking Algorithm for Security Protocols
- Blog: Computer-Aided Verification for Mechanism Design
- Blog: IsaRare: Automatic Verification of SMT Rewrites in Isabelle/HOL
- Blog: iCon: A Diagrammatic Theorem Prover for Ontologies
- Blog: Primal Grammars Driven Automated Induction
- Blog: Beagle as a HOL4 external ATP method
- Blog: A decision procedure for linear "big O" equations
- Blog: Lean-SMT: An SMT tactic for discharging proof goals in Lean
- Blog: Theorem Proving with Structure Sharing and Efficient
- Blog: Verified reductions for optimization
- Blog: A Monadic Framework for Relational Verification (Functional Pearl)
Showing 60 of 118 papers.
History & citation
Current · Permanent link
- This direction split from Automated Generation of Formal Specifications and Proofs (80% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_manual_proof_overhead_403e5d58,
title = {manual proof overhead},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/manual-proof-overhead/rdr_403e5d58bf6c40df9d13664487482c5b},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_manual_proof_overhead_403e5d58_v1,
title = {manual proof overhead},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/manual-proof-overhead/rdr_403e5d58bf6c40df9d13664487482c5b/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}