CiME
From MaRDI portal
Cited in
(66)- Computationally sound implementations of equational theories against passive adversaries
- YAPA
- Formally proving size optimality of sorting networks
- CeTA
- Tyrolean
- AProVE
- Tuple interpretations for termination of term rewriting
- CSI
- CoLoR
- MU-TERM
- CARIBOO
- Jambox
- Saigawa
- IsaFoR
- TPDB
- TPA
- Matchbox
- Tsukuba
- TORPA
- Proving operational termination of membership equational programs
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- Automatically proving termination and memory safety for programs with pointer arithmetic
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting
- CoLL
- Ctrl
- Modular and incremental proofs of AC-termination
- Certification of classical confluence results for left-linear term rewrite systems
- KITTeL
- Certifying confluence proofs via relative termination and rule labeling
- A Lambda-Free Higher-Order Recursive Path Order
- Structural analysis of narratives with the Coq proof assistant
- Proving termination of programs automatically with AProVE
- Nagoya Termination Tool
- Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof
- STORM
- Slothrop: Knuth-Bendix Completion with a Modern Termination Checker
- Certifying a Termination Criterion Based on Graphs, without Graphs
- Towards Rewriting in Coq
- CoCoWeb
- Cops
- Well Quasi Orders
- REVE
- Coccinelle
- Decreasing Diagrams II
- Sufficient completeness verification for conditional and constrained TRS
- Rewrite systems for natural, integral, and rational arithmetic
- Proving termination of nonlinear command sequences
- Rewrite rules for \(\mathrm{CTL}^\ast\)
- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
- CSI -- a confluence tool
- Abstract completion, formalized
- scientific article; zbMATH DE number 6744203 (Why is no real title available?)
- Certified rule labeling
- Polynomials over the reals in proofs of termination : from theory to practice
- Automated certified proofs with CiME3
- Automated Deduction – CADE-20
- Certification of Proving Termination of Term Rewriting by Matrix Interpretations
- Term Rewriting and Applications
- Rewriting Techniques and Applications
- WANDA
- Intruder deduction problem for locally stable theories with normal forms and inverses
- Termination of string rewriting proved automatically
- Mechanically proving termination using polynomial interpretations
- Proving termination of context-sensitive rewriting by transformation
- On tree automata that certify termination of left-linear term rewriting systems
- Termination of just/fair computations in term rewriting
This page was built for software: CiME
