The following pages link to (Q5389068):
Displayed 13 items.
- Rewrite rules for \(\mathrm{CTL}^\ast\) (Q518745) (← links)
- A framework for developing stand-alone certifiers (Q530847) (← links)
- Formally proving size optimality of sorting networks (Q1694569) (← links)
- Multi-dimensional interpretations for termination of term rewriting (Q2055861) (← links)
- Tuple interpretations for termination of term rewriting (Q2102931) (← links)
- Analyzing program termination and complexity automatically with \textsf{AProVE} (Q2362493) (← links)
- Automatically proving termination and memory safety for programs with pointer arithmetic (Q2362494) (← links)
- Certification of Classical Confluence Results for Left-Linear Term Rewrite Systems (Q2829264) (← links)
- Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker (Q2945629) (← links)
- (Q2985126) (← links)
- A Lambda-Free Higher-Order Recursive Path Order (Q2988386) (← links)
- Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof (Q3453106) (← links)
- CSI – A Confluence Tool (Q5200045) (← links)