On the public citation graph

Modularity of termination using dependency pairs

https://doi.org/10.1007/bfb0052373
0 signed · 42 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/3-540-59200-8_77openalex-snapshot
Generating polynomial orderings for termination proofs
inferredcites →https://doi.org/10.1007/3-540-61064-2_38openalex-snapshot
Termination by absence of infinite chains of dependency pairs
inferredcites →https://doi.org/10.1007/3-540-61464-8_43openalex-snapshot
Termination of constructor systems
inferredcites →https://doi.org/10.1007/3-540-61464-8_45openalex-snapshot
On proving termination by innermost termination
inferredcites →https://doi.org/10.1007/3-540-62950-5_68openalex-snapshot
Proving innermost normalisation automatically
inferredcites →https://doi.org/10.1007/978-3-642-74769-4openalex-snapshot
Termersetzungssysteme
inferredcites →https://doi.org/10.1007/bf01190827openalex-snapshot
Generalized sufficient conditions for modular termination of rewriting
inferredcites →https://doi.org/10.1007/bfb0014432openalex-snapshot
Modular termination of term rewriting systems revisited
inferredcites →https://doi.org/10.1007/bfb0030602openalex-snapshot
Automatically proving termination where simplification orderings fail
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(92)90015-8openalex-snapshot
Modularity of simple termination of term rewriting systems with shared constructors
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(94)00275-4openalex-snapshot
Natural termination
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/0304-3975(95)00080-gopenalex-snapshot
Modular termination of r-consistent and left-linear term rewriting systems
inferredcites →https://doi.org/10.1016/s0304-3975(96)00172-7openalex-snapshot
Simple termination of rewrite systems
inferredcites →https://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot
Termination of rewriting
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/227683.227689openalex-snapshot
Termination for direct sums of left-linear complete term rewriting systems
inferredcites →https://doi.org/10.3233/fi-1995-24121openalex-snapshot
ABSTRACT RELATIONS BETWEEN RESTRICTED TERMINATION AND CONFLUENCE PROPERTIES OF REWRITE SYSTEMS
inferredcites →https://doi.org/10.3233/fi-1995-24123openalex-snapshot
SIMPLIFICATION ORDERINGS: HISTORY OF RESULTS

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.2002.0541openalex-snapshot
Modular Termination Proofs for Rewriting Using Dependency Pairs
inferred← citeshttps://doi.org/10.1007/10705424_12openalex-snapshot
On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems
inferred← citeshttps://doi.org/10.1007/10705424_9openalex-snapshot
Automatic Verification Based on Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/10721959_25openalex-snapshot
Eliminating Dummy Elimination
inferred← citeshttps://doi.org/10.1007/10721959_27openalex-snapshot
Complete Monotonic Semantic Path Orderings
inferred← citeshttps://doi.org/10.1007/10721975openalex-snapshot
Rewriting Techniques and Applications: 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000 Proceedings
inferred← citeshttps://doi.org/10.1007/10721975_18openalex-snapshot
System Description: The Dependency Pair Method
inferred← citeshttps://doi.org/10.1007/3-540-45127-7_9openalex-snapshot
Dependency Pairs for Equational Rewriting
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-45744-5_49openalex-snapshot
Approximating Dependency Graphs Using Tree Automata Techniques
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_8openalex-snapshot
Applying Rewriting Techniques to the Verification of Erlang Processes
inferred← citeshttps://doi.org/10.1007/3-540-48685-2_23openalex-snapshot
Transforming Context-Sensitive Rewrite Systems
inferred← citeshttps://doi.org/10.1007/978-94-017-0437-3_6openalex-snapshot
Termination Analysis for Functional Programs
inferred← citeshttps://doi.org/10.1007/bf03177743openalex-snapshot
Modular and Incremental Automated Termination Proofs
inferred← citeshttps://doi.org/10.1007/s002000100063openalex-snapshot
Verification of Erlang Processes by Dependency Pairs
inferred← citeshttps://doi.org/10.1007/s002000100064openalex-snapshot
Termination of Logic Programs: Transformational Methods Revisited
inferred← citeshttps://doi.org/10.1016/j.scico.2020.102474openalex-snapshot
Formalizing the dependency pair criterion for innermost termination
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.