Structure in Theorem Proving: Analyzing and Improving the Isabelle Archive of Formal Proofs

  title={Structure in Theorem Proving: Analyzing and Improving the Isabelle Archive of Formal Proofs},
  author={Fabian Huch},
  • Fabian Huch
  • Published 27 September 2022
  • Computer Science
  • ArXiv
The Isabelle Archive of Formal Proofs has grown to a significant size in the past years. It makes up for an impressive body of research, which enables a number of statistical approaches to various aspects in theorem proving, and has not yet been utilized exhaustively. However, the growing size also poses some challenges to address: Material becomes increasingly harder to find, reusability and ease of understanding become more important. This thesis abstract summarizes my research plans on those… 

Figures from this paper



An Evaluation of the Archive of Formal Proofs

An online survey of the Archive of Formal Proofs was conducted in November 2020 to assess the suitability of the website.

FindFacts: A Scalable Theorem Search

FindFacts 2, a novel domain-specific search tool for formal Isabelle theory content, which puts special emphasis on scalability of the search system, so that the whole AFP can be searched interactively.

Mining the Archive of Formal Proofs

An in-depth analysis of the Archive of Formal Proofs is performed, looking at various properties of the proof developments, including size, dependencies, and proof style, which gives some insights into the nature of formal proofs.

Isabelle: The Next Seven Hundred Theorem Provers

Isabelle [2] is a theorem prover for a large class of logics that is intuitionistic higher-order logic with implication, universal quantifiers, and equality, and allows new symbols to be defined as abbreviations.

SErAPIS : A Concept-Oriented Search Engine for the Isabelle Libraries Based on Natural Language

The SErAPIS pipeline that indexes Isabelle facts by associating them to words and concepts in Wikipedia mathematics articles, which describes three models for extracting textual descriptions of facts from these articles and presents a preliminary experiment with four retrieval models based on the indexing methods.

Predicting defects using network analysis on dependency graphs

This paper proposes to use network analysis on dependency graphs of the entire system to identify central program units that are more likely to face defects and finds that the recall for models building from network measures is by 10% points higher than for models built from complexity metrics.

Graph Clustering Evaluation Metrics as Software Metrics

It can be concluded that the cohesiveness of a software entity is estimated in isolation as those metrics rely only on internal dependencies, while external dependencies, dependencies reflecting coupling between software modules, are not taken into account.

Managing and Mining Graph Data

This is the first comprehensive survey book in the emerging topic of graph data processing and contains extensive surveys on important graph topics such as graph languages, indexing, clustering, data generation, pattern mining, classification, keyword search, pattern matching, and privacy.

Software systems through complex networks science: review, analysis and applications

The study reveals that network theory can provide a prominent set of techniques for the exploratory analysis of large complex software system, and proposes different network-based quality indicators that address software design, efficiency, reusability, vulnerability, controllability and other.

Software systems as complex networks: structure, function, and evolvability of software collaboration graphs

  • C. Myers
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2003
This work has examined software collaboration graphs contained within several open-source software systems, and found them to reveal scale-free, small-world networks similar to those identified in other technological, sociological, and biological systems.