Isabelle is a generic proof assistant. It allows mathematical formulas to be expressed in a formal language and provides tools for proving those formulas in a logical calculus. The main application is the formalization of mathematical proofs and in particular formal verification, which includes proving the correctness of computer hardware or software and proving properties of computer languages and protocols.

This software is also referenced in ORMS.

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

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

1 2 3 ... 30 31 32 next

  1. Carette, Jacques; Farmer, William M.; Kohlhase, Michael; Rabe, Florian: Big math and the one-brain barrier: the tetrapod model of mathematical knowledge (2021)
  2. Färber, Michael; Kaliszyk, Cezary; Urban, Josef: Machine learning guidance for connection tableaux (2021)
  3. Fervari, Raul; Trucco, Francisco; Ziliani, Beta: Verification of dynamic bisimulation theorems in Coq (2021)
  4. Gauthier, Thibault; Kaliszyk, Cezary; Urban, Josef; Kumar, Ramana; Norrish, Michael: TacticToe: learning to prove with tactics (2021)
  5. Koutsoukou-Argyraki, Angeliki: Formalising mathematics -- in praxis; a mathematician’s first experiences with Isabelle/HOL and the why and how of getting started (2021)
  6. Maletzky, Alexander: A generic and executable formalization of signature-based Gröbner basis algorithms (2021)
  7. Xie, Wanling; Zhu, Huibiao; Xu, Qiwen: A process calculus BigrTiMo of mobile systems and its formal semantics (2021)
  8. Ballarin, Clemens: Exploring the structure of an algebra text with locales (2020)
  9. Benzmüller, Christoph; Scott, Dana S.: Automating free logic in HOL, with an experimental application in category theory (2020)
  10. Berghammer, Rudolf; Furusawa, Hitoshi; Guttmann, Walter; Höfner, Peter: Relational characterisations of paths (2020)
  11. Cui, Xiangyu; Li, Xun; Yang, Lanzhi: Better than optimal mean-variance portfolio policy in multi-period asset-liability management problem (2020)
  12. Elderhalli, Yassmeen; Hasan, Osman; Tahar, Sofiène: A framework for formal dynamic dependability analysis using HOL theorem proving (2020)
  13. Kaufmann, Matt; Moore, J. Strother: Limited second-order functionality in a first-order setting (2020)
  14. Kovács, Laura; Lachnitt, Hanna; Szeider, Stefan: Formalizing graph trail properties in Isabelle/HOL (2020)
  15. Lammich, Peter: Efficient verified (UN)SAT certificate checking (2020)
  16. Nagashima, Yutaka: Simple dataset for proof method recommendation in Isabelle/HOL (2020)
  17. Abel, Andreas; Allais, Guillaume; Hameer, Aliya; Pientka, Brigitte; Momigliano, Alberto; Schäfer, Steven; Stark, Kathrin: POPLMark reloaded: mechanizing proofs by logical relations (2019)
  18. Bottesch, Ralph; Haslbeck, Max W.; Thiemann, René: Verifying an incremental theory solver for linear arithmetic in Isabelle/HOL (2019)
  19. Chan, Hing-Lun; Norrish, Michael: Classification of finite fields with applications (2019)
  20. Condoluci, Andrea; Kohlhase, Michael; Müller, Dennis; Rabe, Florian; Sacerdoti Coen, Claudio; Wenzel, Makarius: Relational data across mathematical libraries (2019)

1 2 3 ... 30 31 32 next