CiME

From MaRDI portal
Software:21947



swMATH9970MaRDI QIDQ21947


No author found.





Related Items (38)

Analyzing program termination and complexity automatically with \textsf{AProVE}Automatically proving termination and memory safety for programs with pointer arithmeticUnnamed ItemOptimizing a Certified Proof Checker for a Large-Scale Computer-Generated ProofTermination of string rewriting proved automaticallyMechanically proving termination using polynomial interpretationsModular and incremental proofs of AC-terminationProving termination of context-sensitive rewriting by transformationProving Termination of Programs Automatically with AProVEPolynomials over the reals in proofs of termination : from theory to practiceOn tree automata that certify termination of left-linear term rewriting systemsUnnamed ItemRewrite systems for natural, integral, and rational arithmeticFormally proving size optimality of sorting networksSufficient completeness verification for conditional and constrained TRSSlothrop: Knuth-Bendix Completion with a Modern Termination CheckerUnnamed ItemTermination of just/fair computations in term rewritingA Lambda-Free Higher-Order Recursive Path OrderProving termination of nonlinear command sequencesCertifying a Termination Criterion Based on Graphs, without GraphsAutomated Deduction – CADE-20Term Rewriting and ApplicationsIntruder deduction problem for locally stable theories with normal forms and inversesRewrite rules for \(\mathrm{CTL}^\ast\)Certified Rule LabelingProving operational termination of membership equational programsSolving Non-linear Polynomial Arithmetic via SAT Modulo Linear ArithmeticOn the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewritingTowards Rewriting in CoqCertification of Proving Termination of Term Rewriting by Matrix InterpretationsCSI – A Confluence ToolComputationally sound implementations of equational theories against passive adversariesStructural Analysis of Narratives with the Coq Proof AssistantCertification of Classical Confluence Results for Left-Linear Term Rewrite SystemsUnnamed ItemRewriting Techniques and ApplicationsTuple interpretations for termination of term rewriting


This page was built for software: CiME