Verifying B proof rules using deep embedding and automated theorem proving
From MaRDI portal
Recommendations
- Tableaux modulo theories using superdeduction. An application to the verification of B proof rules with the Zenon automated theorem prover
- Soundly proving B method formulæ using typed sequent calculus
- Why Would You Trust B?
- Verified Compilation and the B Method: A Proposal and a First Appraisal
- scientific article; zbMATH DE number 1746646
Cites work
- scientific article; zbMATH DE number 1696760 (Why is no real title available?)
- scientific article; zbMATH DE number 2079999 (Why is no real title available?)
- scientific article; zbMATH DE number 2080004 (Why is no real title available?)
- The B-Book
- Why Would You Trust B?
- Zenon: An Extensible Automated Theorem Prover Producing Checkable Proofs
Cited in
(4)
This page was built for publication: Verifying B proof rules using deep embedding and automated theorem proving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095242)