Certification of Termination Proofs Using CeTA (Q3183545): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-03359-9_31
+Normal rank
@@ Property / OpenAlex ID @@
+W1482572800
@@ Property / OpenAlex ID: W1482572800 / rank @@
+Normal rank
@@ Property / cites work @@
+Termination of term rewriting using dependency pairs
+Normal rank
@@ Property / cites work @@
+Term Rewriting and All That
@@ Property / cites work: Term Rewriting and All That / rank @@
+Normal rank
@@ Property / cites work @@
+Certification of Automated Termination Proofs
@@ Property / cites work: Certification of Automated Termination Proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Certifying a Termination Criterion Based on Graphs, without Graphs
+Normal rank
@@ Property / cites work @@
+Logic for Programming, Artificial Intelligence, and Reasoning
+Normal rank
@@ Property / cites work @@
+Frontiers of Combining Systems
@@ Property / cites work: Frontiers of Combining Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Automating the dependency pair method
@@ Property / cites work: Automating the dependency pair method / rank @@
+Normal rank
@@ Property / cites work @@
+Tyrolean termination tool: techniques and features
+Normal rank
@@ Property / cites work @@
+An Efficient Unification Algorithm
@@ Property / cites work: An Efficient Unification Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Q4414308
@@ Property / cites work: Q4414308 / rank @@
+Normal rank