The following pages link to CiME (Q21947):
Displaying 38 items.
- Sufficient completeness verification for conditional and constrained TRS (Q420848) (← links)
- Proving termination of nonlinear command sequences (Q470005) (← links)
- Rewrite rules for \(\mathrm{CTL}^\ast\) (Q518745) (← links)
- Intruder deduction problem for locally stable theories with normal forms and inverses (Q683746) (← links)
- Termination of string rewriting proved automatically (Q850497) (← links)
- Mechanically proving termination using polynomial interpretations (Q851142) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- On tree automata that certify termination of left-linear term rewriting systems (Q876043) (← links)
- Termination of just/fair computations in term rewriting (Q924727) (← links)
- Computationally sound implementations of equational theories against passive adversaries (Q1013091) (← links)
- Formally proving size optimality of sorting networks (Q1694569) (← links)
- Tuple interpretations for termination of term rewriting (Q2102931) (← links)
- Proving operational termination of membership equational programs (Q2271899) (← 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)
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting (Q2502172) (← links)
- Modular and incremental proofs of AC-termination (Q2643544) (← links)
- Certification of Classical Confluence Results for Left-Linear Term Rewrite Systems (Q2829264) (← links)
- (Q2985126) (← links)
- A Lambda-Free Higher-Order Recursive Path Order (Q2988386) (← links)
- Structural Analysis of Narratives with the Coq Proof Assistant (Q3087995) (← links)
- Proving Termination of Programs Automatically with AProVE (Q3192189) (← links)
- Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof (Q3453106) (← links)
- Slothrop: Knuth-Bendix Completion with a Modern Termination Checker (Q3527302) (← links)
- Certifying a Termination Criterion Based on Graphs, without Graphs (Q3543658) (← links)
- Towards Rewriting in Coq (Q3608814) (← links)
- Rewrite systems for natural, integral, and rational arithmetic (Q4594221) (← links)
- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic (Q5191109) (← links)
- CSI – A Confluence Tool (Q5200045) (← links)
- (Q5232901) (← links)
- (Q5277883) (← links)
- Certified Rule Labeling (Q5277884) (← links)
- Polynomials over the reals in proofs of termination : from theory to practice (Q5313720) (← links)
- (Q5389068) (← links)
- Automated Deduction – CADE-20 (Q5394603) (← links)
- Certification of Proving Termination of Term Rewriting by Matrix Interpretations (Q5448658) (← links)
- Term Rewriting and Applications (Q5703861) (← links)
- Rewriting Techniques and Applications (Q5901563) (← links)
