On the public citation graph

Argument-bounded algorithms as a basis for automated termination proofs

https://doi.org/10.1007/bfb0012861
0 signed · 31 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.1007/3-540-16780-3_132openalex-snapshot
The karlsruhe induction theorem proving system
inferredcites →https://doi.org/10.1007/978-94-009-8399-1openalex-snapshot
Universal Algebra
inferredcites →https://doi.org/10.1016/0004-3702(87)90017-8openalex-snapshot
Proof by consistency
inferredcites →https://doi.org/10.1016/0304-3975(79)90034-3openalex-snapshot
Mechanizing structural induction part I: Formal system
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.21236/ad0406138openalex-snapshot
LISP 1.5 PROGRAMMER'S MANUAL

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.1994.1004openalex-snapshot
A Constructor-Based Approach to Positive/Negative-Conditional Equational Specifications
inferred← citeshttps://doi.org/10.1007/10704567_2openalex-snapshot
On Formalised Proofs of Termination of Recursive Functions
inferred← citeshttps://doi.org/10.1007/3-540-57292-9_37openalex-snapshot
Building and executing proof strategies in a formal metatheory
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_47openalex-snapshot
Proving termination of logic programs by transforming them into equivalent term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_3openalex-snapshot
Synthesis of induction orderings for existence proofs
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_4openalex-snapshot
Lazy generation of induction hypotheses
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_9openalex-snapshot
Mechanizable inductive proofs for a class of ∀ ∃ formulas
inferred← citeshttps://doi.org/10.1007/3-540-60343-3_33openalex-snapshot
Automated termination proofs with measure functions
inferred← citeshttps://doi.org/10.1007/3-540-60360-3_38openalex-snapshot
Termination analysis for functional programs using term orderings
inferred← citeshttps://doi.org/10.1007/3-540-60381-6_10openalex-snapshot
On termination and confluence of conditional rewrite systems
inferred← citeshttps://doi.org/10.1007/3-540-61286-6_179openalex-snapshot
Automated inductive reasoning as a support of deductive reasoning in a user-independent automation of inductive theorem proving
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_73openalex-snapshot
Termination of algorithms over non-freely generated data types
inferred← citeshttps://doi.org/10.1007/3-540-61739-6_37openalex-snapshot
Termination analysis for partial functions
inferred← citeshttps://doi.org/10.1007/978-94-017-0437-3_6openalex-snapshot
Termination Analysis for Functional Programs
inferred← citeshttps://doi.org/10.1007/bf00120880openalex-snapshot
A recursive techniques editor for Prolog
inferred← citeshttps://doi.org/10.1007/bfb0013076openalex-snapshot
Computing induction axioms
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.05.005openalex-snapshot
Shallow confluence of conditional term rewriting systems
inferred← citeshttps://doi.org/10.1017/s0956796801004191openalex-snapshot
A predicative analysis of structural recursion
inferred← citeshttps://doi.org/10.1017/s0956796818000072openalex-snapshot
Size-based termination of higher-order rewriting
inferred← citeshttps://doi.org/10.1023/a:1005797629953openalex-snapshot
Termination of Nested and Mutually Recursive Algorithms
inferred← citeshttps://doi.org/10.1023/a:1005903504159openalex-snapshot
Automated Synthesis of Recursive Programs from a ∀∃ Logical Specification
inferred← citeshttps://doi.org/10.1051/ita:2004015openalex-snapshot
Termination checking with types
inferred← citeshttps://doi.org/10.1093/jigpal/jzr048openalex-snapshot
Computer-assisted human-oriented inductive theorem proving by descente infinie--a manifesto
inferred← citeshttps://doi.org/10.48550/arxiv.1309.6226openalex-snapshot
Automation of Mathematical Induction as part of the History of Logic
inferred← citeshttps://doi.org/10.7146/dpb.v24i492.7020openalex-snapshot
Termination analysis based on operational semantics
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.