Pages that link to "Item:Q3094178"
From MaRDI portal
The following pages link to CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates (Q3094178):
Displaying 16 items.
- CoLoR (Q21785) (← links)
- Mechanically certifying formula-based Noetherian induction reasoning (Q507366) (← links)
- A framework for developing stand-alone certifiers (Q530847) (← links)
- How to get more out of your oracles (Q1687729) (← 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)
- Formally verifying the solution to the Boolean Pythagorean triples problem (Q2323449) (← 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)
- A Framework for Certified Self-Stabilization (Q2827460) (← links)
- Certification of Classical Confluence Results for Left-Linear Term Rewrite Systems (Q2829264) (← links)
- A Lambda-Free Higher-Order Recursive Path Order (Q2988386) (← links)
- Termination of Isabelle Functions via Termination of Rewriting (Q3088004) (← links)
- Syntactic soundness proof of a type-and-capability system with hidden state (Q4912884) (← links)
- (Q5111307) (← links)
