Pages that link to "Item:Q3525007"
From MaRDI portal
The following pages link to Certification of Automated Termination Proofs (Q3525007):
Displayed 15 items.
- Mechanically certifying formula-based Noetherian induction reasoning (Q507366) (← links)
- A formalization of the Knuth-Bendix(-Huet) critical pair theorem (Q616850) (← links)
- Coq formalization of the higher-order recursive path ordering (Q843949) (← links)
- Automated verification of refinement laws (Q1037397) (← links)
- Incorporating quotation and evaluation into Church's type theory (Q1753993) (← links)
- Termination of Isabelle Functions via Termination of Rewriting (Q3088004) (← links)
- CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates (Q3094178) (← links)
- Automated Certification of Implicit Induction Proofs (Q3100200) (← links)
- Certification of Termination Proofs Using CeTA (Q3183545) (← links)
- Certifying a Termination Criterion Based on Graphs, without Graphs (Q3543658) (← links)
- Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme (Q3655207) (← links)
- (Q5111307) (← links)
- A PVS Theory for Term Rewriting Systems (Q5178962) (← links)
- Certification of Proving Termination of Term Rewriting by Matrix Interpretations (Q5448658) (← links)
- Mechanical certification of \(\mathrm{FOL_{ID}}\) cyclic proofs (Q6059221) (← links)