On the public citation graph

Modular and Incremental Automated Termination Proofs

0 signed · 69 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jsco.1993.1024openalex-snapshot
Completeness of Combinations of Constructor Systems
inferredcites →https://doi.org/10.1006/jsco.1995.1036openalex-snapshot
Modular Properties of Composable Term Rewriting Systems
inferredcites →https://doi.org/10.1007/10704567_3openalex-snapshot
Argument Filtering Transformation
inferredcites →https://doi.org/10.1007/10721959_27openalex-snapshot
Complete Monotonic Semantic Path Orderings
inferredcites →https://doi.org/10.1007/3-540-44881-0_22openalex-snapshot
Tsukuba Termination Tool
inferredcites →https://doi.org/10.1007/3-540-45744-5_49openalex-snapshot
Approximating Dependency Graphs Using Tree Automata Techniques
inferredcites →https://doi.org/10.1007/3-540-48685-2_23openalex-snapshot
Transforming Context-Sensitive Rewrite Systems
inferredcites →https://doi.org/10.1007/3-540-57887-0_97openalex-snapshot
Simple termination of hierarchical combinations of term rewriting systems
inferredcites →https://doi.org/10.1007/3-540-60381-6_6openalex-snapshot
Hierarchical termination
inferredcites →https://doi.org/10.1007/bf01190827openalex-snapshot
Generalized sufficient conditions for modular termination of rewriting
inferredcites →https://doi.org/10.1007/bfb0052373openalex-snapshot
Modularity of termination using dependency pairs
inferredcites →https://doi.org/10.1007/s10817-005-9022-xopenalex-snapshot
Mechanically Proving Termination Using Polynomial Interpretations
inferredcites →https://doi.org/10.1016/0020-0190(87)90039-1openalex-snapshot
On termination of the direct sum of term-rewriting systems
inferredcites →https://doi.org/10.1016/0020-0190(87)90122-0openalex-snapshot
Counterexamples to termination for the direct sum of term rewriting systems
inferredcites →https://doi.org/10.1016/0020-0190(94)90032-9openalex-snapshot
Generating polynomial orderings
inferredcites →https://doi.org/10.1016/0304-3975(94)00039-lopenalex-snapshot
On the modularity of termination of term rewriting systems
inferredcites →https://doi.org/10.1016/0304-3975(95)00075-8openalex-snapshot
Modular proofs for completeness of hierarchical term rewriting systems
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50014-7openalex-snapshot
Recursive Applicative Program Schemes
inferredcites →https://doi.org/10.1016/j.jsc.2004.02.003openalex-snapshot
Modular and incremental proofs of AC-termination
inferredcites →https://doi.org/10.1016/s0304-3975(99)00207-8openalex-snapshot
Termination of term rewriting using dependency pairs
inferredcites →https://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot
Termination of rewriting
inferredcites →https://doi.org/10.1016/s1571-0661(04)00284-1openalex-snapshot
Induction for termination with local strategies
inferredcites →https://doi.org/10.1145/570186.570189openalex-snapshot
Simple termination of context-sensitive rewriting
inferredcites →https://doi.org/10.1145/888251.888264openalex-snapshot
Simplification and termination of strategies in rule-based languages
inferredcites →https://doi.org/10.3233/fi-1995-24121openalex-snapshot
ABSTRACT RELATIONS BETWEEN RESTRICTED TERMINATION AND CONFLUENCE PROPERTIES OF REWRITE SYSTEMS

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11591191_17openalex-snapshot
Recursive Path Orderings Can Also Be Incremental
inferred← citeshttps://doi.org/10.1007/11805618_24openalex-snapshot
Predictive Labeling
inferred← citeshttps://doi.org/10.1007/3-540-44881-0_22openalex-snapshot
Tsukuba Termination Tool
inferred← citeshttps://doi.org/10.1007/978-3-031-75783-9_14openalex-snapshot
Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-319-13770-4_4openalex-snapshot
Using Representation Theorems for Proving Polynomials Non-negative
inferred← citeshttps://doi.org/10.1007/978-3-540-25979-4_18openalex-snapshot
Dependency Pairs Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-30210-0_16openalex-snapshot
Polynomial Interpretations with Negative Coefficients
inferred← citeshttps://doi.org/10.1007/978-3-540-32275-7_21openalex-snapshot
The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs
inferred← citeshttps://doi.org/10.1007/978-3-540-70590-1_1openalex-snapshot
Modular Termination of Basic Narrowing
inferred← citeshttps://doi.org/10.1007/978-3-540-70590-1_9openalex-snapshot
Usable Rules for Context-Sensitive Rewrite Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_31openalex-snapshot
Predictive Labeling with Dependency Pairs Using SAT
inferred← citeshttps://doi.org/10.1007/978-3-540-74621-8_10openalex-snapshot
Certification of Automated Termination Proofs
inferred← citeshttps://doi.org/10.1007/978-3-540-89439-1_44openalex-snapshot
Improving Context-Sensitive Dependency Pairs
inferred← citeshttps://doi.org/10.1007/978-3-642-04222-5_7openalex-snapshot
Argument Filterings and Usable Rules for Simply Typed Dependency Pairs
inferred← citeshttps://doi.org/10.1007/978-3-642-12592-8_5openalex-snapshot
Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing
inferred← citeshttps://doi.org/10.1007/978-3-642-16310-4_2openalex-snapshot
Twenty Years of Rewriting Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-16310-4_4openalex-snapshot
A Dependency Pair Framework for A ∨ C-Termination
inferred← citeshttps://doi.org/10.1007/978-3-642-40885-4_22openalex-snapshot
Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering
inferred← citeshttps://doi.org/10.1007/978-3-642-54624-2_5openalex-snapshot
Incremental Proofs of Termination, Confluence and Sufficient Completeness of OBJ Specifications
inferred← citeshttps://doi.org/10.1007/s00200-007-0046-9openalex-snapshot
Enhancing dependency pair method using strong computability in simply-typed term rewriting
inferred← citeshttps://doi.org/10.1007/s10817-005-9022-xopenalex-snapshot
Mechanically Proving Termination Using Polynomial Interpretations
inferred← citeshttps://doi.org/10.1007/s10817-006-9053-yopenalex-snapshot
Elimination Transformations for Associative–Commutative Rewriting Systems
inferred← citeshttps://doi.org/10.1007/s10817-006-9057-7openalex-snapshot
Mechanizing and Improving Dependency Pairs
inferred← citeshttps://doi.org/10.1007/s10990-008-9028-2openalex-snapshot
Proving operational termination of membership equational programs
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.05.041openalex-snapshot
Proving Termination of Context-Sensitive Rewriting with MU-TERM
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.12.004openalex-snapshot
Automatic Proofs of Termination With Elementary Interpretations
inferred← citeshttps://doi.org/10.1016/j.ic.2004.10.004openalex-snapshot
Automating the dependency pair method
inferred← citeshttps://doi.org/10.1016/j.ic.2006.07.001openalex-snapshot
Proving termination of context-sensitive rewriting by transformation
inferred← citeshttps://doi.org/10.1016/j.ic.2006.08.010openalex-snapshot
Tyrolean termination tool: Techniques and features
inferred← citeshttps://doi.org/10.1016/j.jlap.2012.06.003openalex-snapshot
Twenty years of rewriting logic
inferred← citeshttps://doi.org/10.1016/j.jsc.2004.02.003openalex-snapshot
Modular and incremental proofs of AC-termination
inferred← citeshttps://doi.org/10.1016/j.scico.2025.103417openalex-snapshot
The annotated dependency pair framework for almost-sure termination of probabilistic term rewriting
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.09.024openalex-snapshot
Stability of termination and sufficient-completeness under pushouts via amalgamation
inferred← citeshttps://doi.org/10.1093/jigpal/jzq009openalex-snapshot
Modular termination of basic narrowing and equational unification
inferred← citeshttps://doi.org/10.1109/jcsse.2014.6841891openalex-snapshot
An incremental approach to local equality predicates in OBJ specification languages
inferred← citeshttps://doi.org/10.1145/1014007.1014022openalex-snapshot
Proving termination of membership equational programs
inferred← citeshttps://doi.org/10.1145/1706356.1706370openalex-snapshot
A3PAT, an approach for certified automated termination proofs
inferred← citeshttps://doi.org/10.1145/2003476.2003481openalex-snapshot
Incremental checking of well-founded recursive specifications modulo axioms
inferred← citeshttps://doi.org/10.1587/transinf.e92.d.2007openalex-snapshot
Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems
inferred← citeshttps://doi.org/10.1587/transinf.e92.d.235openalex-snapshot
Static Dependency Pair Method for Simply-Typed Term Rewriting and Related Techniques
inferred← citeshttps://doi.org/10.4230/lipics.rta.2010.325openalex-snapshot
Certified Subterm Criterion and Certified Usable Rules
inferred← citeshttps://doi.org/10.4995/thesis/10251/11003openalex-snapshot
Towards a Framework for Proving Termination of Maude Programs
inferred← citeshttps://doi.org/10.4995/thesis/10251/19251openalex-snapshot
Termination of Narrowing: Automated Proofs and Modularity Properties
inferred← citeshttps://doi.org/10.6100/ir637480openalex-snapshot
Termination of rewriting and its certification
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.