Autoref
From MaRDI portal
Software:24733
swMATH12809MaRDI QIDQ24733FDOQ24733
Author name not available (Why is that?)
Cited In (17)
- Probabilistic Functions and Cryptographic Oracles in Higher Order Logic
- A formalisation in HOL of the fundamental theorem of linear algebra and its application to the solution of the least squares problem
- Refinement to imperative HOL
- Lifting and Transfer: A Modular Design for Quotients in Isabelle/HOL
- Efficient verified (UN)SAT certificate checking
- CryptHOL: game-based proofs in higher-order logic
- A verified ODE solver and the Lorenz attractor
- A verified SAT solver framework with learn, forget, restart, and incrementality
- Quotients of Bounded Natural Functors
- Title not available (Why is that?)
- Title not available (Why is that?)
- From LCF to Isabelle/HOL
- Title not available (Why is that?)
- Verified iptables firewall analysis and verification
- Formally verified certificate checkers for hardest-to-round computation
- Automatic refinement to efficient data structures: a comparison of two approaches
- Formalization and Execution of Linear Algebra: From Theorems to Algorithms
This page was built for software: Autoref
