The following pages link to Sascha Böhme (Q287336):
Displaying 12 items.
- Semi-intelligible Isar proofs from machine-generated proofs (Q287340) (← links)
- A framework for the verification of certifying computations (Q2351144) (← links)
- Extending Sledgehammer with SMT solvers (Q2351158) (← links)
- HOL-Boogie -- an interactive prover-backend for the verifying C compiler (Q2655335) (← links)
- Encoding Monomorphic and Polymorphic Types (Q2974796) (← links)
- Reconstruction of Z3’s Bit-Vector Proofs in HOL4 and Isabelle/HOL (Q3100212) (← links)
- HOL-Boogie — An Interactive Prover for the Boogie Program-Verifier (Q3543656) (← links)
- Extending Sledgehammer with SMT Solvers (Q5200019) (← links)
- Heaps and Data Structures: A Challenge for Automated Provers (Q5200023) (← links)
- Encoding Monomorphic and Polymorphic Types (Q5326348) (← links)
- Fast LCF-Style Proof Reconstruction for Z3 (Q5747649) (← links)
- Sledgehammer: Judgement Day (Q5747754) (← links)
