Proving Termination of Integer Term Rewriting (Q3636817): Difference between revisions

@@ Property / describes a project that uses @@
+Haskell
@@ Property / describes a project that uses: Haskell / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Tyrolean
@@ Property / describes a project that uses: Tyrolean / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+AProVE
@@ Property / describes a project that uses: AProVE / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-02348-4_3
+Normal rank
@@ Property / OpenAlex ID @@
+W1505286461
@@ Property / OpenAlex ID: W1505286461 / rank @@
+Normal rank
@@ Property / cites work @@
+Termination of term rewriting using dependency pairs
+Normal rank
@@ Property / cites work @@
+Verification, Model Checking, and Abstract Interpretation
+Normal rank
@@ Property / cites work @@
+Computer Aided Verification
@@ Property / cites work: Computer Aided Verification / rank @@
+Normal rank
@@ Property / cites work @@
+Ranking Abstractions
@@ Property / cites work: Ranking Abstractions / rank @@
+Normal rank
@@ Property / cites work @@
+Q2769578
@@ Property / cites work: Q2769578 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4804915
@@ Property / cites work: Q4804915 / rank @@
+Normal rank
@@ Property / cites work @@
+Static Analysis
@@ Property / cites work: Static Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
+Normal rank
@@ Property / cites work @@
+SAT Solving for Termination Analysis with Polynomial Interpretations
+Normal rank
@@ Property / cites work @@
+Maximal Termination
@@ Property / cites work: Maximal Termination / rank @@
+Normal rank
@@ Property / cites work @@
+Modular termination proofs for rewriting using dependency pairs
+Normal rank
@@ Property / cites work @@
+Logic for Programming, Artificial Intelligence, and Reasoning
+Normal rank
@@ Property / cites work @@
+Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
+Normal rank
@@ Property / cites work @@
+Mechanizing and improving dependency pairs
@@ Property / cites work: Mechanizing and improving dependency pairs / rank @@
+Normal rank
@@ Property / cites work @@
+Proving Termination by Bounded Increase
@@ Property / cites work: Proving Termination by Bounded Increase / rank @@
+Normal rank
@@ Property / cites work @@
+Constraint-Based Approach for Analysis of Hybrid Systems
+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 @@
+Testing positiveness of polynomials
@@ Property / cites work: Testing positiveness of polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Termination of logic programs: Transformational methods revisited
+Normal rank
@@ Property / cites work @@
+Verification, Model Checking, and Abstract Interpretation
+Normal rank
@@ Property / cites work @@
+Transition Invariants and Transition Predicate Abstraction for Program Termination
+Normal rank
@@ Property / cites work @@
+Automated termination proofs for logic programs by term rewriting
+Normal rank
@@ Property / cites work @@
+Inference of termination conditions for numerical loops in Prolog
+Normal rank