References in zbMATH (referenced in 89 articles )

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

1 2 3 4 5 next

  1. Kaliszyk, Cezary; Pąk, Karol: Semantics of Mizar as an Isabelle object logic (2019)
  2. Kunčar, Ondřej; Popescu, Andrei: A consistent foundation for Isabelle/HOL (2019)
  3. Maletzky, Alexander: Formalization of Dubé’s degree bounds for Gröbner bases in Isabelle/HOL (2019)
  4. Marmsoler, Diego; Gidey, Habtom Kashay: Interactive verification of architectural design patterns in FACTum (2019)
  5. Nipkow, Tobias; Brinkop, Hauke: Amortized complexity verified (2019)
  6. Paulson, Lawrence C.; Nipkow, Tobias; Wenzel, Makarius: From LCF to Isabelle/HOL (2019)
  7. Wenzel, Makarius: Interaction with formal mathematical documents in Isabelle/PIDE (2019)
  8. Mendes, Alexandra; Ferreira, João F.: Towards verified handwritten calculational proofs (short paper) (2018)
  9. Meßner, Florian; Parsert, Julian; Schöpf, Jonas; Sternagel, Christian: A formally verified solver for homogeneous linear Diophantine equations (2018)
  10. Müller, Dennis; Rabe, Florian; Kohlhase, Michael: Theories as types (2018)
  11. Parsert, Julian; Kaliszyk, Cezary: Towards formal foundations for game theory (2018)
  12. Schlichtkrull, Anders; Blanchette, Jasmin Christian; Traytel, Dmitriy; Waldmann, Uwe: Formalizing Bachmair and Ganzinger’s ordered resolution prover (2018)
  13. Avigad, Jeremy; Hölzl, Johannes; Serafin, Luke: A formally verified proof of the central limit theorem (2017)
  14. Butterfield, Andrew: Utpcalc -- a calculator for UTP predicates (2017)
  15. Kunčar, Ondřej; Popescu, Andrei: Comprehending Isabelle/HOL’s consistency (2017)
  16. Maletzky, Alexander; Windsteiger, Wolfgang: The formalization of Vickrey auctions: a comparison of two approaches in Isabelle and Theorema (2017)
  17. Arthan, Rob: On definitions of constants and types in HOL (2016)
  18. Bengtson, Jesper; Parrow, Joachim; Weber, Tjark: Psi-calculi in Isabelle (2016)
  19. Blanchette, Jasmin Christian; Fleury, Mathias; Weidenbach, Christoph: A verified SAT solver framework with learn, forget, restart, and incrementality (2016)
  20. Esparza, Javier; Křetínský, Jan; Sickert, Salomon: From LTL to deterministic automata. A safraless compositional approach (2016)

1 2 3 4 5 next