Proving weak properties of rewriting (Q554217): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2011.04.028
+Normal rank
@@ Property / OpenAlex ID @@
+W2083907114
@@ Property / OpenAlex ID: W2083907114 / rank @@
+Normal rank
@@ Property / cites work @@
+Maude: specification and programming in rewriting logic
+Normal rank
@@ Property / cites work @@
+Q4417783
@@ Property / cites work: Q4417783 / rank @@
+Normal rank
@@ Property / cites work @@
+Induction for termination with local strategies
@@ Property / cites work: Induction for termination with local strategies / rank @@
+Normal rank
@@ Property / cites work @@
+Q2851054
@@ Property / cites work: Q2851054 / rank @@
+Normal rank
@@ Property / cites work @@
+Termination of rewriting under strategies
@@ Property / cites work: Termination of rewriting under strategies / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical Aspects of Computing - ICTAC 2004
@@ Property / cites work: Theoretical Aspects of Computing - ICTAC 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations
+Normal rank
@@ Property / cites work @@
+Q4255514
@@ Property / cites work: Q4255514 / rank @@
+Normal rank
@@ Property / cites work @@
+On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
+Normal rank
@@ Property / cites work @@
+Q4246947
@@ Property / cites work: Q4246947 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4783327
@@ Property / cites work: Q4783327 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2751366
@@ Property / cites work: Q2751366 / rank @@
+Normal rank
@@ Property / cites work @@
+Proofs by induction in equational theories with constructors
+Normal rank
@@ Property / cites work @@
+Q3956381
@@ Property / cites work: Q3956381 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3690200
@@ Property / cites work: Q3690200 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3783519
@@ Property / cites work: Q3783519 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3785921
@@ Property / cites work: Q3785921 / rank @@
+Normal rank
@@ Property / cites work @@
+Automatic proofs by induction in theories without constructors
+Normal rank
@@ Property / cites work @@
+Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness
+Normal rank
@@ Property / cites work @@
+Using induction and rewriting to verify and complete parameterized specifications
+Normal rank
@@ Property / cites work @@
+Sufficient completeness verification for conditional and constrained TRS
+Normal rank
@@ Property / cites work @@
+Semantic confluence tests and completion methods
@@ Property / cites work: Semantic confluence tests and completion methods / rank @@
+Normal rank
@@ Property / cites work @@
+On sufficient-completeness and related properties of term rewriting systems
+Normal rank
@@ Property / cites work @@
+Testing for the ground (co-)reducibility property in term-rewriting systems
+Normal rank
@@ Property / cites work @@
+Encompassment properties and automata with constraints
+Normal rank
@@ Property / cites work @@
+Ground reducibility is EXPTIME-complete
@@ Property / cites work: Ground reducibility is EXPTIME-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Q2751361
@@ Property / cites work: Q2751361 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4799892
@@ Property / cites work: Q4799892 / rank @@
+Normal rank
@@ Property / cites work @@
+Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
+Normal rank
@@ Property / cites work @@
+Completeness results for basic narrowing
@@ Property / cites work: Completeness results for basic narrowing / rank @@
+Normal rank
@@ Property / cites work @@
+Proving innermost normalisation automatically
@@ Property / cites work: Proving innermost normalisation automatically / rank @@
+Normal rank
@@ Property / cites work @@
+Q3408137
@@ Property / cites work: Q3408137 / rank @@
+Normal rank