Tyrolean

swMATH7830MaRDI QIDQ19846FDOQ19846

Author name not available (Why is that?)

Cited In (92)

• Match-bounds revisited
• Tuple interpretations for termination of term rewriting
• Multi-dimensional interpretations for termination of term rewriting
• Certification of Proving Termination of Term Rewriting by Matrix Interpretations
• Satisfiability Checking: Theory and Applications
• A Transformational Approach to Prove Outermost Termination Automatically
• Proving operational termination of membership equational programs
• A combination framework for complexity
• Term orderings for non-reachability of (conditional) rewriting
• AC Dependency Pairs Revisited
• Uncurrying for termination and complexity
• Proving termination of context-sensitive rewriting with MU-TERM
• Pattern eliminating transformations
• CSI -- a confluence tool
• Using well-founded relations for proving operational termination
• Certification of Termination Proofs Using CeTA
• Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
• Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting
• The Derivational Complexity Induced by the Dependency Pair Method
• Beyond Dependency Graphs
• Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
• Termination Analysis by Dependency Pairs and Inductive Theorem Proving
• Frontiers of Combining Systems
• Polynomials over the reals in proofs of termination : from theory to practice
• Decreasing diagrams and relative termination
• Proving termination by dependency pairs and inductive theorem proving
• Proving termination of context-sensitive rewriting by transformation
• Nominal Confluence Tool
• Derivational Complexity of Knuth-Bendix Orders Revisited
• Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
• KBO orientability
• Transforming orthogonal inductive definition sets into confluent term rewrite systems
• Modular complexity analysis via relative complexity
• The derivational complexity induced by the dependency pair method
• Attack-defense trees
• Max/Plus tree automata for termination of term rewriting
• Methods for proving termination of rewriting-based programming languages by transformation
• Checking Conservativity of Overloaded Definitions in Higher-Order Logic
• Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering
• Title not available (Why is that?)
• Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations
• Dependency pairs for proving termination properties of conditional term rewriting systems
• Multi-completion with termination tools
• Proving Termination of Integer Term Rewriting
• Sufficient completeness verification for conditional and constrained TRS
• Modular Complexity Analysis for Term Rewriting
• Increasing interpretations
• Predictive Labeling with Dependency Pairs Using SAT
• Mechanizing and improving dependency pairs
• Tyrolean termination tool: techniques and features
• Matrix interpretations for proving termination of term rewriting
• Usable Rules for Context-Sensitive Rewrite Systems
• Dynamic dependency pairs for algebraic functional systems
• On tree automata that certify termination of left-linear term rewriting systems
• Automated Complexity Analysis Based on the Dependency Pair Method
• Context-sensitive dependency pairs
• Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
• From Outermost Termination to Innermost Termination
• Well-Definedness of Streams by Termination
• KBCV – Knuth-Bendix Completion Visualizer
• Termination of just/fair computations in term rewriting
• Termination of Isabelle functions via termination of rewriting
• Termination proofs in the dependency pair framework May induce multiple recursive derivational complexity
• Reachability, confluence, and termination analysis with state-compatible automata
• Loop detection in term rewriting using the eliminating unfoldings
• Term Rewriting and Applications
• Proving Termination Using Recursive Path Orders and SAT Solving
• SGGS decision procedures
• A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
• SAT Solving for Termination Analysis with Polynomial Interpretations
• Generalized and formalized uncurrying
• AC completion with termination tools
• On proving termination of constrained term rewrite systems by eliminating edges from dependency graphs
• Harnessing first order termination provers using higher order dependency pairs
• Loops under Strategies
• Polynomial interpretations over the natural, rational and real numbers revisited
• On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting
• Argument filterings and usable rules for simply typed dependency pairs
• Certifying a Termination Criterion Based on Graphs, without Graphs
• Relative termination via dependency pairs
• SAT solving for termination proofs with recursive path orders and dependency pairs
• Dependency Pairs for Rewriting with Non-free Constructors
• Reducing Relative Termination to Dependency Pair Problems
• Termination of Cycle Rewriting by Transformation and Matrix Interpretation
• KBOs, ordinals, subrecursive hierarchies and all that
• The recursive path and polynomial ordering for first-order and higher-order terms
• Certifying confluence of quasi-decreasing strongly deterministic conditional term rewrite systems
• A tool proving well-definedness of streams using termination tools
• Proving Termination with (Boolean) Satisfaction
• Certified subterm criterion and certified usable rules
• Monotonicity criteria for polynomial interpretations over the naturals
• Innermost termination of rewrite systems by labeling

This page was built for software: Tyrolean