On the public citation graph
Generalized sufficient conditions for modular termination of rewriting
0 signed · 77 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jsco.1994.1002openalex-snapshot
Completeness of Combinations of Conditional Constructor Systems
inferredcites →https://doi.org/10.1007/3-540-51081-8_113openalex-snapshot
Modular aspects of properties of term rewriting systems related to normal forms
inferredcites →https://doi.org/10.1007/3-540-51081-8_127openalex-snapshot
Termination for the direct sum of left-linear term rewriting systems
inferredcites →https://doi.org/10.1007/3-540-53904-2_96openalex-snapshot
Completeness of combinations of constructor systems
inferredcites →https://doi.org/10.1007/3-540-54317-1_99openalex-snapshot
Confluence of the disjoint union of conditional term rewriting systems
inferredcites →https://doi.org/10.1007/3-540-56393-8_8openalex-snapshot
Combinations of simplifying conditional term rewriting systems
inferredcites →https://doi.org/10.1007/3-540-56393-8_9openalex-snapshot
Sufficient conditions for modular termination of conditional term rewriting systems
inferredcites →https://doi.org/10.1007/bfb0013069openalex-snapshot
Relating innermost, weak, uniform and modular termination of term rewriting systems
inferredcites →https://doi.org/10.1016/0020-0190(79)90071-1openalex-snapshot
A note on simplification orderings
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(90)90221-iopenalex-snapshot
Modular term rewriting systems and the termination
inferredcites →https://doi.org/10.1016/0304-3975(82)90026-3openalex-snapshot
Orderings for term-rewriting systems
inferredcites →https://doi.org/10.1016/0304-3975(92)90015-8openalex-snapshot
Modularity of simple termination of term rewriting systems with shared constructors
inferredcites →https://doi.org/10.1016/b978-0-12-115350-2.50017-8openalex-snapshot
Equations and Rewrite Rules: A Survey
inferredcites →https://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot
Termination of rewriting
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/lics.1989.39194openalex-snapshot
A sufficient condition for the termination of the direct sum of term rewriting systems
inferredcites →https://doi.org/10.1145/7531.7534openalex-snapshot
On the Church-Rosser property for the direct sum of term rewriting systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jsco.1995.1036openalex-snapshot
Modular Properties of Composable Term Rewriting Systems
inferred← citeshttps://doi.org/10.1006/jsco.2002.0541openalex-snapshot
Modular Termination Proofs for Rewriting Using Dependency Pairs
inferred← citeshttps://doi.org/10.1007/10721959_27openalex-snapshot
Complete Monotonic Semantic Path Orderings
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_42openalex-snapshot
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
inferred← citeshttps://doi.org/10.1007/3-540-58431-5_14openalex-snapshot
On modularity of termination and confluence properties of conditional rewrite systems
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_208openalex-snapshot
Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-60381-6_18openalex-snapshot
Modular properties of constructor-sharing conditional term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-61464-8_45openalex-snapshot
On proving termination by innermost termination
inferred← citeshttps://doi.org/10.1007/3-540-61464-8_55openalex-snapshot
Modularity of termination in term graph rewriting
inferred← citeshttps://doi.org/10.1007/3-540-61735-3_7openalex-snapshot
Unravelings and ultra-properties
inferred← citeshttps://doi.org/10.1007/3-540-64299-4_38openalex-snapshot
Modular aspects of rewrite-based specifications
inferred← citeshttps://doi.org/10.1007/978-3-319-23165-5_15openalex-snapshot
Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting
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-25984-8_4openalex-snapshot
Improved Modular Termination Proofs Using Dependency Pairs
inferred← citeshttps://doi.org/10.1007/978-3-540-49020-3_7openalex-snapshot
Conservative Extension in Positive/Negative Conditional Term Rewriting with Applications to Software Renovation Factories
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-74835-9_38openalex-snapshot
Modular Access Control Via Strategic Rewriting
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-24364-6_11openalex-snapshot
Harnessing First Order Termination Provers Using Higher Order Dependency Pairs
inferred← citeshttps://doi.org/10.1007/978-3-662-21551-7_18openalex-snapshot
Simple termination is difficult
inferred← citeshttps://doi.org/10.1007/bf03177743openalex-snapshot
Modular and Incremental Automated Termination Proofs
inferred← citeshttps://doi.org/10.1007/bfb0016858openalex-snapshot
On modularity in term rewriting and narrowing
inferred← citeshttps://doi.org/10.1007/bfb0017487openalex-snapshot
On the modularity of confluence of constructor-sharing term rewriting systems
inferred← citeshttps://doi.org/10.1007/bfb0029947openalex-snapshot
When are two rewrite systems more than none?
inferred← citeshttps://doi.org/10.1007/bfb0052373openalex-snapshot
Modularity of termination using dependency pairs
inferred← citeshttps://doi.org/10.1007/s10817-006-9057-7openalex-snapshot
Mechanizing and Improving Dependency Pairs
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00187-4openalex-snapshot
Termination is not modular for confluent variable-preserving term rewriting systems
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00039-lopenalex-snapshot
On the modularity of termination of term rewriting systems
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00248-3openalex-snapshot
Modularity in noncopying term rewriting
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00075-8openalex-snapshot
Modular proofs for completeness of hierarchical term rewriting systems
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00042-4openalex-snapshot
On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50006-xopenalex-snapshot
Equational Logic and Rewriting
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.ipl.2004.11.002openalex-snapshot
On proving -termination of rewriting by size-change termination
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106207openalex-snapshot
Modular termination of prefix-constrained term rewrite systems
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.tcs.2012.09.008openalex-snapshot
Modularity in term rewriting revisited
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.07.045openalex-snapshot
Termination of rewrite relations on λ-terms based on Girard's notion of reducibility
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00272-7openalex-snapshot
Hierarchical termination revisited
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00172-7openalex-snapshot
Simple termination of rewrite systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00079-6openalex-snapshot
Modular aspects of term graph rewriting
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80124-0openalex-snapshot
Termination and normalisation under strategy Proofs in ELAN
inferred← citeshttps://doi.org/10.1145/570186.570189openalex-snapshot
Simple termination of context-sensitive rewriting
inferred← citeshttps://doi.org/10.1145/571157.571163openalex-snapshot
Modular termination of context-sensitive rewriting
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.119openalex-snapshot
On (Un)Soundness of Unravelings
inferred← citeshttps://doi.org/10.46298/lmcs-18(2:18)2022openalex-snapshot
Modular Termination for Second-Order Computation Rules and Application to Algebraic Effect Handlers
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.