Archive Formal Proofs

Isabelle’s Archive of Formal Proofs (AFP): Mining the Archive of Formal Proofs. The Archive of Formal Proofs is a vast collection of computer-checked proofs developed using the proof assistant Isabelle. We perform an in-depth analysis of the archive, looking at various properties of the proof developments, including size, dependencies, and proof style. This gives some insights into the nature of formal proofs.


References in zbMATH (referenced in 152 articles , 1 standard article )

Showing results 1 to 20 of 152.
Sorted by year (citations)

1 2 3 ... 6 7 8 next

  1. Ballarin, Clemens: Exploring the structure of an algebra text with locales (2020)
  2. Basin, David A.; Lochbihler, Andreas; Sefidgar, S. Reza: CryptHOL: game-based proofs in higher-order logic (2020)
  3. Benzmüller, Christoph; Fuenmayor, David: Computer-supported analysis of positive properties, ultrafilters and modal collapse in variants of Gödel’s ontological argument (2020)
  4. Benzmüller, Christoph; Scott, Dana S.: Automating free logic in HOL, with an experimental application in category theory (2020)
  5. Bisping, Benjamin; Nestmann, Uwe; Peters, Kirstin: Coupled similarity: the first 32 years (2020)
  6. Divasón, Jose; Joosten, Sebastiaan J. C.; Thiemann, René; Yamada, Akihisa: A verified implementation of the Berlekamp-Zassenhaus factorization algorithm (2020)
  7. Eberl, Manuel; Haslbeck, Max W.; Nipkow, Tobias: Verified analysis of random binary tree structures (2020)
  8. Foster, Simon; Cavalcanti, Ana; Canham, Samuel; Woodcock, Jim; Zeyda, Frank: Unifying theories of reactive design contracts (2020)
  9. Gouëzel, Sébastien; Karlsson, Anders: Subadditive and multiplicative ergodic theorems (2020)
  10. Joosten, Sebastiaan J. C.; Thiemann, René; Yamada, Akihisa: A verified implementation of algebraic numbers in Isabelle/HOL (2020)
  11. Kirchner, Daniel; Benzmüller, Christoph; Zalta, Edward N.: Mechanizing Principia Logico-Metaphysica in functional type-theory (2020)
  12. Li, Wenda; Paulson, Lawrence C.: Evaluating winding numbers and counting complex roots through Cauchy indices in Isabelle/HOL (2020)
  13. Schlichtkrull, Anders; Blanchette, Jasmin; Traytel, Dmitriy; Waldmann, Uwe: Formalizing Bachmair and Ganzinger’s ordered resolution prover (2020)
  14. Sheng, Feng; Zhu, Huibiao; He, Jifeng; Yang, Zongyuan; Bowen, Jonathan P.: Theoretical and practical approaches to the denotational semantics for MDESL based on UTP (2020)
  15. Sternagel, Christian: A mechanized proof of Higman’s lemma by open induction (2020)
  16. Thiemann, René; Bottesch, Ralph; Divasón, Jose; Haslbeck, Max W.; Joosten, Sebastiaan J. C.; Yamada, Akihisa: Formalizing the LLL basis reduction algorithm and the LLL factorization algorithm in Isabelle/HOL (2020)
  17. Bayer, Jonas; David, Marco; Pal, Abhik; Stock, Benedikt: Beginners’ quest to formalize mathematics: a feasibility study in Isabelle (2019)
  18. Bentkamp, Alexander; Blanchette, Jasmin Christian; Klakow, Dietrich: A formal proof of the expressiveness of deep learning (2019)
  19. Charguéraud, Arthur; Pottier, François: Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits (2019)
  20. Fuenmayor, David; Benzmüller, Christoph: Computational hermeneutics: an integrated approach for the logical analysis of natural-language arguments (2019)

1 2 3 ... 6 7 8 next