Tyrolean

swMATH7830MaRDI QIDQ19846FDOQ19846

Author name not available (Why is that?)

Official website: http://cl-informatik.uibk.ac.at/software/ttt2/

Cited In (only showing first 100 items - show all)

• Modular complexity analysis for term rewriting
• Match-bounds revisited
• Multi-dimensional interpretations for termination of term rewriting
• Certification of Proving Termination of Term Rewriting by Matrix Interpretations
• A Transformational Approach to Prove Outermost Termination Automatically
• Proving operational termination of membership equational programs
• A combination framework for complexity
• Uncurrying for termination and complexity
• Proving termination of context-sensitive rewriting with MU-TERM
• CSI -- a confluence tool
• Certification of Termination Proofs Using CeTA
• 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
• Derivational Complexity of Knuth-Bendix Orders Revisited
• Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
• KBO orientability
• Modular complexity analysis via relative complexity
• The derivational complexity induced by the dependency pair method
• Attack-defense trees
• Methods for proving termination of rewriting-based programming languages by transformation
• OBJ3
• CeTA
• Timbuk
• SPIKE
• AProVE
• CSI
• CoLoR
• MTT
• CiME
• mkbTT
• Jambox
• MU-TERM
• IsaFoR
• Matchbox
• Slothrop
• Saigawa
• VMTL
• TPDB
• TPA
• TORPA
• Tsukuba
• KBCV
• A3PAT
• ConCon
• Nagoya Termination Tool
• TCAS
• RRE
• VeriFun
• term-rewriting
• CO3
• Coccinelle
• REVE
• KoAT
• 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
• Sufficient completeness verification for conditional and constrained TRS
• 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
• 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
• 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
• Reachability, confluence, and termination analysis with state-compatible automata
• Term Rewriting and Applications
• Proving Termination Using Recursive Path Orders and SAT Solving
• 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
• Koala
• WANDA
• Tuple interpretations for termination of term rewriting
• Nominal confluence tool
• Harnessing first order termination provers using higher order dependency pairs
• Term orderings for non-reachability of (conditional) rewriting
• Pattern eliminating transformations
• Using well-founded relations for proving operational termination
• Loops under Strategies
• Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
• Polynomial interpretations over the natural, rational and real numbers revisited
• Reducing relative termination to dependency pair problems
• NaTT
• On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting
• Disproving confluence of term rewriting systems by interpretation and ordering

This page was built for software: Tyrolean