On the public citation graph

Automatically proving termination where simplification orderings fail

0 signed · 53 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.1994.1003openalex-snapshot

Termination of term rewriting: interpretation and type elimination

inferredcites →https://doi.org/10.1007/3-540-10843-2_36openalex-snapshot

Termination of linear rewriting systems

inferredcites →https://doi.org/10.1007/3-540-59200-8_44openalex-snapshot

Automatic termination proofs with transformation orderings

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-62950-5_68openalex-snapshot

Proving innermost normalisation automatically

inferredcites →https://doi.org/10.1007/bf01810293openalex-snapshot

Termination by completion

inferredcites →https://doi.org/10.1007/bfb0030602openalex-snapshot

Automatically proving termination where simplification orderings fail

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/0167-6423(87)90030-xopenalex-snapshot

Termination of rewriting systems by polynomial interpretations and its implementation

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/b978-0-444-88074-1.50011-1openalex-snapshot

Rewrite Systems

inferredcites →https://doi.org/10.1016/s0377-0427(91)90073-sopenalex-snapshot

Department of Computer Science

inferredcites →https://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot

Termination of rewriting

inferredcites →https://doi.org/10.3233/fi-1995-24123openalex-snapshot

SIMPLIFICATION ORDERINGS: HISTORY OF RESULTS

inferredcites →https://doi.org/10.3233/fi-1995-24124openalex-snapshot

TERMINATION OF TERM REWRITING BY SEMANTIC LABELLING

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10704567_3openalex-snapshot

Argument Filtering Transformation

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/11805618_2openalex-snapshot

Solving Partial Order Constraints for LPO Termination

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-45142-0_5openalex-snapshot

Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings

inferred← citeshttps://doi.org/10.1007/3-540-45653-8_36openalex-snapshot

On Termination of Meta-programs

inferred← citeshttps://doi.org/10.1007/3-540-46674-6_16openalex-snapshot

On Automating Inductive and Non-inductive Termination Methods

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-48242-3_8openalex-snapshot

Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems

inferred← citeshttps://doi.org/10.1007/3-540-48685-2_23openalex-snapshot

Transforming Context-Sensitive Rewrite Systems

inferred← citeshttps://doi.org/10.1007/3-540-62950-5_68openalex-snapshot

Proving innermost normalisation automatically

inferred← citeshttps://doi.org/10.1007/978-3-540-71067-7_17openalex-snapshot

Certifying a Termination Criterion Based on Graphs, without Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-60831-5_7openalex-snapshot

Deduction as a Cross-Sectional Technology The DFG Focus Programme on Deduction

inferred← citeshttps://doi.org/10.1007/978-94-017-0437-3_6openalex-snapshot

Termination Analysis for Functional Programs

inferred← citeshttps://doi.org/10.1007/bfb0032752openalex-snapshot

TEA: Automatically proving termination of programs in a non-strict higher-order functional language

inferred← citeshttps://doi.org/10.1007/bfb0052368openalex-snapshot

Decidable approximations of sets of descendants and sets of normal forms

inferred← citeshttps://doi.org/10.1007/bfb0052373openalex-snapshot

Modularity of termination using dependency pairs

inferred← citeshttps://doi.org/10.1007/bfb0052374openalex-snapshot

Termination of associative-commutative rewriting by dependency pairs

inferred← citeshttps://doi.org/10.1007/bfb0052376openalex-snapshot

Towards automated termination proofs through “freezing”

inferred← citeshttps://doi.org/10.1007/s002000100063openalex-snapshot

Verification of Erlang Processes by Dependency Pairs

inferred← citeshttps://doi.org/10.1007/s10817-006-9053-yopenalex-snapshot

Elimination Transformations for Associative–Commutative Rewriting Systems

inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50009-6openalex-snapshot

Paramodulation-Based Theorem Proving

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.2020.102474openalex-snapshot

Formalizing the dependency pair criterion for innermost termination

inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00207-8openalex-snapshot

Termination of term rewriting using dependency pairs

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80551-6openalex-snapshot

On automating the extraction of programs from proofs using product types

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.1093/ietisy/e88-d.3.583openalex-snapshot

On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems

inferred← citeshttps://doi.org/10.1145/1180475.1180480openalex-snapshot

Program termination analysis in polynomial time

inferred← citeshttps://doi.org/10.1145/1596600.1596604openalex-snapshot

Automatic assessment of failure recovery in Erlang applications

inferred← citeshttps://doi.org/10.1145/1706356.1706370openalex-snapshot

A3PAT, an approach for certified automated termination proofs

inferred← citeshttps://doi.org/10.29375/25392115.1088openalex-snapshot

On Automating the Extraction of Programs from Termination Proofs

showing the first 33 of 34 · page through all 34

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.