A Qualitative Analysis of Kernel Extension for Higher Order Proof Checking
Shuai Wang

TL;DR
This paper analyzes how extending the kernel of Interactive Theorem Provers affects proof size and checking, highlighting implications for reliability and efficiency.
Contribution
It provides a qualitative analysis of kernel extension effects on proof reduction and proof checking in ITPs, an area with limited prior focus.
Findings
Kernel extension reduces proof size
Impacts proof checking process
Affects reliability of ITPs
Abstract
For the sake of reliability, the kernels of Interactive Theorem Provers (ITPs) are generally kept relatively small. On top of the kernel, additional symbols and inference rules are defined. This paper presents an analysis of how kernel extension reduces the size of proofs and impacts proof checking.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSecurity and Verification in Computing · Software Testing and Debugging Techniques · Parallel Computing and Optimization Techniques
