The following pages link to Formalizing Bounded Increase (Q5327348):
Displaying 4 items.
- Formally proving size optimality of sorting networks (Q1694569) (← links)
- Confluence of orthogonal term rewriting systems in the prototype verification system (Q2362205) (← links)
- Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker (Q2945629) (← links)
- Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof (Q3453106) (← links)
