Simplifying termination proofs for rewrite systems by preprocessing
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Hierarchical termination revisited
Information Processing Letters
Context-sensitive rewriting strategies
Information and Computation
Modular termination proofs for rewriting using dependency pairs
Journal of Symbolic Computation
A Monotonic Higher-Order Semantic Path Ordering
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Transforming Context-Sensitive Rewrite Systems
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
From Higher-Order to First-Order Rewriting
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Dependency Pairs for Equational Rewriting
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Termination of (Canonical) Context-Sensitive Rewriting
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Equational Termination by Semantic Labelling
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Approximating Dependency Graphs Using Tree Automata Techniques
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Termination and Reduction Checking for Higher-Order Logic Programs
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Termination of on-demand rewriting and termination of OBJ programs
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Right-linear half-monadic term rewrite systems
Theoretical Computer Science
Transformation techniques for context-sensitive rewrite systems
Journal of Functional Programming
Relaxing monotonicity for innermost termination
Information Processing Letters
On proving C ε-termination of rewriting by size-change termination
Information Processing Letters
Automating the dependency pair method
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Verifying Termination and Reduction Properties about Higher-Order Logic Programs
Journal of Automated Reasoning
Termination of String Rewriting Proved Automatically
Journal of Automated Reasoning
Integrating static analysis and general-purpose theorem proving for termination analysis
Proceedings of the 28th international conference on Software engineering
Mechanizing and Improving Dependency Pairs
Journal of Automated Reasoning
Elimination Transformations for Associative---Commutative Rewriting Systems
Journal of Automated Reasoning
Proving termination of context-sensitive rewriting by transformation
Information and Computation
Tyrolean termination tool: Techniques and features
Information and Computation
Transition predicate abstraction and fair termination
ACM Transactions on Programming Languages and Systems (TOPLAS) - Special issue on POPL 2005
Quasi-terminating logic programs for ensuring the termination of partial evaluation
Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Static Slicing of Rewrite Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Termination of abstract reduction systems
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Practical use of polynomials over the reals in proofs of termination
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Improving the Context-sensitive Dependency Graph
Electronic Notes in Theoretical Computer Science (ENTCS)
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Electronic Notes in Theoretical Computer Science (ENTCS)
Logic programming with satisfiability
Theory and Practice of Logic Programming
Matrix Interpretations for Proving Termination of Term Rewriting
Journal of Automated Reasoning
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers
Electronic Notes in Theoretical Computer Science (ENTCS)
Innermost Termination of Rewrite Systems by Labeling
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Some classes of term rewriting systems inferable from positive data
Theoretical Computer Science
Towards a Systematic Method for Proving Termination of Graph Transformation Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Characterizations of polynomial complexity classes with a better intensionality
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Loop detection in term rewriting using the eliminating unfoldings
Theoretical Computer Science
Constraints for Argument Filterings
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Predictive Labeling with Dependency Pairs Using SAT
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Dependency Pairs for Rewriting with Non-free Constructors
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Proving Termination by Bounded Increase
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Certification of Automated Termination Proofs
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Proving Termination Using Recursive Path Orders and SAT Solving
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Modular Termination of Basic Narrowing
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Effectively Checking the Finite Variant Property
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Usable Rules for Context-Sensitive Rewrite Systems
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Arctic Termination ...Below Zero
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Normalization of Infinite Terms
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Search Techniques for Rational Polynomial Orders
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Automated Complexity Analysis Based on the Dependency Pair Method
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
Language and Automata Theory and Applications
The Computability Path Ordering: The End of a Quest
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Certifying a Termination Criterion Based on Graphs, without Graphs
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Termination of rewriting under strategies
ACM Transactions on Computational Logic (TOCL)
Improving Context-Sensitive Dependency Pairs
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Complexity, Graphs, and the Dependency Pair Method
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Proving Termination with (Boolean) Satisfaction
Logic-Based Program Synthesis and Transformation
Termination Analysis of Logic Programs Based on Dependency Graphs
Logic-Based Program Synthesis and Transformation
Termination of Narrowing Using Dependency Pairs
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
From Outermost Termination to Innermost Termination
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Generating priority rewrite systems for OSOS process languages
Information and Computation
Analysis of Rewrite-Based Access Control Policies
Electronic Notes in Theoretical Computer Science (ENTCS)
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Sup-interpretations, a semantic method for static analysis of program resources
ACM Transactions on Computational Logic (TOCL)
Languages: From Formal to Natural
Proving Infinitary Normalization
Types for Proofs and Programs
Journal of Automated Reasoning
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Proving Termination of Integer Term Rewriting
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Dependency Pairs and Polynomial Path Orders
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Well-Definedness of Streams by Termination
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
The Derivational Complexity Induced by the Dependency Pair Method
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
VMTL---A Modular Termination Laboratory
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
From Outermost to Context-Sensitive Rewriting
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Transforming SAT into Termination of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Automated termination proofs for logic programs by term rewriting
ACM Transactions on Computational Logic (TOCL)
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Termination Analysis by Dependency Pairs and Inductive Theorem Proving
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Complexity of Fractran and Productivity
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Certification of Termination Proofs Using CeTA
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Termination of narrowing revisited
Theoretical Computer Science
Information and Computation
Annals of Mathematics and Artificial Intelligence
Automatic Proofs of Termination With Elementary Interpretations
Electronic Notes in Theoretical Computer Science (ENTCS)
Improved Matrix Interpretation
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
A3PAT, an approach for certified automated termination proofs
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Automating the dependency pair method
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Relaxing monotonicity for innermost termination
Information Processing Letters
On proving C E-termination of rewriting by size-change termination
Information Processing Letters
Partial and Nested Recursive Function Definitions in Higher-order Logic
Journal of Automated Reasoning
Innermost termination of context-sensitive rewriting
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Size-change termination for term rewriting
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Monotonic AC-compatible semantic path orderings
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Termination of simply typed term rewriting by translation and labelling
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Automated termination analysis for logic programs by term rewriting
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Detecting non-termination of term rewriting systems using an unfolding operator
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
SAT solving for termination analysis with polynomial interpretations
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Max/plus tree automata for termination of term rewriting
Acta Cybernetica
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Termination by quasi-periodic interpretations
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Certification of proving termination of term rewriting by matrix interpretations
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Termination of narrowing in left-linear constructor systems
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Finding lexicographic orders for termination proofs in Isabelle/HOL
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Strong normalisation of cut-elimination that simulates β-reduction
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Degrees of undecidability in term rewriting
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Argument filterings and usable rules for simply typed dependency pairs
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Context-sensitive dependency pairs
Information and Computation
An integrated framework for the diagnosis and correction of rule-based programs
Theoretical Computer Science
Transformation and debugging of functional logic programs
A 25-year perspective on logic programming
Cdiprover3: a tool for proving derivational complexities of term rewriting systems
ESSLLI'08/09 Proceedings of the 2008 international conference on Interfaces: explorations in logic, language and computation
POP and semantic labeling using SAT
ESSLLI'08/09 Proceedings of the 2008 international conference on Interfaces: explorations in logic, language and computation
Signature extensions preserve termination: an alternative proof via dependency pairs
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Automated termination proofs for haskell by term rewriting
ACM Transactions on Programming Languages and Systems (TOPLAS)
From matrix interpretations over the rationals to matrix interpretations over the naturals
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Levels of undecidability in rewriting
Information and Computation
Proving termination in the context-sensitive dependency pair framework
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
A dependency pair framework for A∨C-termination
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Lazy abstraction for size-change termination
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Satisfiability of non-linear (Ir)rational arithmetic
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Proving termination properties with MU-TERM
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Polytool: Polynomial interpretations as a basis for termination analysis of logic programs
Theory and Practice of Logic Programming
Rewrite rules for search database systems
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Dependency triples for improving termination analysis of logic programs with cut
LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
A dependency pair framework for innermost complexity analysis of term rewrite systems
CADE'11 Proceedings of the 23rd international conference on Automated deduction
WFLP'11 Proceedings of the 20th international conference on Functional and constraint logic programming
Proving Termination by Dependency Pairs and Inductive Theorem Proving
Journal of Automated Reasoning
Harnessing first order termination provers using higher order dependency pairs
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
SAT solving for argument filterings
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
A characterization of alternating log time by first order functional programs
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Context-sensitive dependency pairs
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Resource analysis by sup-interpretation
FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
Recursive path orderings can also be incremental
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
The dependency triple framework for termination of logic programs
LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
Goal-directed and relative dependency pairs for proving the termination of narrowing
LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
Termination analysis with calling context graphs
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
AProVE 1.2: automatic termination proofs in the dependency pair framework
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Matrix interpretations for proving termination of term rewriting
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Complexity invariance of real interpretations
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Proving and disproving termination of higher-order functions
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Proving liveness with fairness using rewriting
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Orderings for innermost termination
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Dependency pairs for simply typed term rewriting
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Quasi-interpretations and small space bounds
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Solving partial order constraints for LPO termination
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Checking conservativity of overloaded definitions in higher-order logic
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
TPA: termination proved automatically
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Automated termination analysis for Haskell: from term rewriting to programming languages
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Termination of string rewriting with matrix interpretations
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Decidability of termination for semi-constructor TRSs, left-linear shallow TRSs and related systems
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
A proof of finite family developments for higher-order rewriting using a prefix property
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Reducing right-hand sides for termination
Processes, Terms and Cycles
Termination of context-sensitive rewriting with built-in numbers and collection data structures
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
Monotonicity criteria for polynomial interpretations over the naturals
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
On the domain and dimension hierarchy of matrix interpretations
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs
Journal of Automated Reasoning
Nominal completion for rewrite systems with binders
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Rewriting Computation and Proof
Orderings and constraints: theory and practice of proving termination
Rewriting Computation and Proof
Computability closure: ten years later
Rewriting Computation and Proof
Modular access control via strategic rewriting
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Jumping and escaping: Modular termination and the abstract path ordering
Theoretical Computer Science
Determinization of conditional term rewriting systems
Theoretical Computer Science
Synthesis of sup-interpretations: A survey
Theoretical Computer Science
Paramodulation with Non-Monotonic Orderings and Simplification
Journal of Automated Reasoning
Unifying the Knuth-Bendix, recursive path and polynomial orders
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Better termination proving through cooperation
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Bounded programs: a new decidable class of logic programs with function symbols
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.01 |