Tyrolean
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Match-bounds revisited
- Increasing interpretations
- TALP
- CLEAN
- Haskell
- OBJ3
- Timbuk
- CeTA
- AProVE
- Multi-dimensional interpretations for termination of term rewriting
- SGGS decision procedures
- Tuple interpretations for termination of term rewriting
- Term orderings for non-reachability of (conditional) rewriting
- Pattern eliminating transformations
- Transforming orthogonal inductive definition sets into confluent term rewrite systems
- CSI
- MTT
- CoLoR
- CiME
- MU-TERM
- mkbTT
- Slothrop
- VMTL
- Jambox
- Saigawa
- IsaFoR
- TPDB
- TPA
- Matchbox
- Tsukuba
- TORPA
- SPIKE
- Proving operational termination of membership equational programs
- Using well-founded relations for proving operational termination
- Relative termination via dependency pairs
- SAT solving for termination proofs with recursive path orders and dependency pairs
- Certifying confluence of quasi-decreasing strongly deterministic conditional term rewrite systems
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting
- A combination framework for complexity
- Methods for proving termination of rewriting-based programming languages by transformation
- Nominal confluence tool
- Disproving confluence of term rewriting systems by interpretation and ordering
- Proving termination of context-sensitive rewriting with MU-TERM
- Innermost termination of rewrite systems by labeling
- A tool proving well-definedness of streams using termination tools
- Dynamic dependency pairs for algebraic functional systems
- KBCV – Knuth-Bendix Completion Visualizer
- Polynomial interpretations over the natural, rational and real numbers revisited
- Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting
- Termination of cycle rewriting by transformation and matrix interpretation
- KBOs, ordinals, subrecursive hierarchies and all that
- Max/Plus tree automata for termination of term rewriting
- Termination of Isabelle functions via termination of rewriting
- KBCV
- Harnessing first order termination provers using higher order dependency pairs
- Generalized and formalized uncurrying
- Certification of Termination Proofs Using CeTA
- TCAS
- A3PAT
- Nagoya Termination Tool
- ConCon
- VeriFun
- RRE
- Reducing relative termination to dependency pair problems
- Dependency pairs for proving termination properties of conditional term rewriting systems
- Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
- Usable Rules for Context-Sensitive Rewrite Systems
- Proving Termination Using Recursive Path Orders and SAT Solving
- Checking Conservativity of Overloaded Definitions in Higher-Order Logic
- Multi-completion with termination tools
- Uncurrying for termination and complexity
- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
- Automated Complexity Analysis Based on the Dependency Pair Method
- Certifying a Termination Criterion Based on Graphs, without Graphs
- Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
- From Outermost Termination to Innermost Termination
- Predictive Labeling with Dependency Pairs Using SAT
- Dependency Pairs for Rewriting with Non-free Constructors
- SAT Solving for Termination Analysis with Polynomial Interpretations
- Loops under Strategies
- Proving Termination of Integer Term Rewriting
- Well-Definedness of Streams by Termination
- Argument filterings and usable rules for simply typed dependency pairs
- term-rewriting
- CO3
- REVE
- Coccinelle
- Sufficient completeness verification for conditional and constrained TRS
- Proving termination by dependency pairs and inductive theorem proving
- Decreasing diagrams and relative termination
- Satisfiability checking: theory and applications
- Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations
- The recursive path and polynomial ordering for first-order and higher-order terms
- Reachability, confluence, and termination analysis with state-compatible automata
- A Transformational Approach to Prove Outermost Termination Automatically
- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
- Termination Analysis by Dependency Pairs and Inductive Theorem Proving
- Beyond Dependency Graphs
- AC completion with termination tools
This page was built for software: Tyrolean
