Overview on mechanized theorem proving
DOI10.13328/J.CNKI.JOS.005870zbMATH Open1449.68143MaRDI QIDQ3308161FDOQ3308161
Authors: Nan Jiang, Qingan Li, Lumeng Wang, Xiaotong Zhang, Yanxiang He
Publication date: 12 August 2020
Recommendations
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Specification and verification (program logics, model checking, etc.) (68Q60) Mechanization of proofs and logical operations (03B35) Logic in computer science (03B70) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Cited In (10)
- Mechanized result verification: An industrial application
- Theorem proving in technology transfer: The user's point of view
- Pervasive parallelism in highly-trustable interactive theorem proving systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automated theorem proving for special functions: the next phase
- Title not available (Why is that?)
- Fully reusing clause deduction algorithm based on standard contradiction separation rule
- Mechanical software verification: high level control aspects from a user's perspective
- Title not available (Why is that?)
This page was built for publication: Overview on mechanized theorem proving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3308161)