Arch. Formal Proofs

26 papers2 directions
Arch. Formal Proofs, also known as the Archive of Formal Proofs, is a digital repository and publication venue dedicated to the formalization of mathematics, logic, and computer science. Active since 2011, the venue serves as a collection of machine-checked proof developments, primarily utilizing the Isabelle/HOL theorem prover. It provides a structured environment for researchers to archive and disseminate complex proofs, ensuring they are accessible and mechanically verified. The research published in this venue focuses on the rigorous verification of algorithms and the formalization of mathematical theorems. Notable contributions include the verification of the CVM algorithm using recursive analysis techniques, the formalization of the Schwartz-Zippel Lemma, and the implementation of algorithms for real quantifier elimination. Other works involve the development of software verification tools like AutoCorres2 and the exploration of topics in complex analysis, such as modular groups and elliptic functions. Prolific contributors to the venue include researchers such as Lawrence C. Paulson, Wenda Li, and Andre Platzer, who are active in the fields of automated reasoning and formal methods. In the context of machine learning and artificial intelligence, Arch. Formal Proofs serves as a foundational resource for automated theorem proving and symbolic reasoning. By maintaining a library of machine-readable proofs, the venue supports the development of AI systems designed to perform logical deduction and formal verification. It plays a role in the broader AI community by bridging the gap between abstract mathematical theory and the practical verification of computational systems, providing a corpus of verified knowledge that can be used to evaluate and improve automated reasoning engines.

Papers by Year

2025 3
2024 1
2023 1
2022 1
2021 5
2020 1
2019 3
2018 2
2017 2
2016 1
2014 2
2013 1
2012 2
2011 1

Top Research Directions

Research directions most represented by papers from this venue.

Controlling Coefficient Growth in Symbolic Polynomial Computation 1
Polynomial Root Finding via Eigendecomposition 1

Top Authors

AuthorPapers
Wenda Li12
André Platzer4
Yong Kiam Tan4
Derek Khu1
Holden Lee1
Jeremy Avigad1
Kuldeep S. Meel1
Michael Norrish1
Niels Mündler1
Rachid Guerraoui1
Stefan Mitsch1
Sunpill Kim1
Yang Liu1

Related Venues

Venues with the most similar research cluster distributions.

Papers

TitleYear
Complex Lattices, Elliptic Functions, and the Modular Group2025
Dedekind Sums2025
Verification of the CVM algorithm with a New Recursive Analysis Technique2025
AutoCorres22024
The Schwartz-Zippel Lemma2023
A First Complete Algorithm for Real Quantifier Elimination in Isabelle/HOL2022
A Verified Imperative Implementation of B-Trees2021
Grothendieck's Schemes in Algebraic Geometry2021
The BKR Decision Procedure for Univariate Real Arithmetic2021
The Theorem of Three Circles2021
Verified Quadratic Virtual Substitution for Real Arithmetic2021
Irrationality Criteria for Series by Erdős and Straus2020
Differential Game Logic2019
The Transcendence of Certain Infinite Series2019
Universal Turing Machine2019
Irrational Rapidly Convergent Series2018
The Budan-Fourier Theorem and Counting Real Roots with Multiplicity2018
Count the Number of Complex Roots2017
Evaluate winding numbers through Cauchy indices2017
A formal model for the SPARCv8 ISA and a proof of non-interference for the LEON3 processor2016
The Sturm-Tarski Theorem2014
Vector Spaces2014
The Königsberg Bridge Problem and the Friendship Theorem2013
Abortable Linearizable Modules2012
Bondy's Theorem2012
The Myhill-Nerode Theorem Based on Regular Expressions2011