On the public citation graph

The Certification Problem Format

0 signed · 64 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-45744-5_42openalex-snapshot
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
inferredcites →https://doi.org/10.1007/978-3-319-04921-2_28openalex-snapshot
Reachability Analysis with State-Compatible Automata
inferredcites →https://doi.org/10.1007/978-3-319-08587-6_13openalex-snapshot
Proving Termination of Programs Automatically with AProVE
inferredcites →https://doi.org/10.1007/978-3-540-25979-4_6openalex-snapshot
Matchbox: A Tool for Match-Bounded String Rewriting
inferredcites →https://doi.org/10.1007/978-3-540-32033-3_14openalex-snapshot
Tyrolean Termination Tool
inferredcites →https://doi.org/10.1007/978-3-540-32033-3_26openalex-snapshot
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems
inferredcites →https://doi.org/10.1007/978-3-540-70590-1_14openalex-snapshot
Arctic Termination ...Below Zero
inferredcites →https://doi.org/10.1007/978-3-540-70590-1_23openalex-snapshot
Root-Labeling
inferredcites →https://doi.org/10.1007/978-3-642-02348-4_21openalex-snapshot
Tyrolean Termination Tool 2
inferredcites →https://doi.org/10.1007/978-3-642-03359-9_31openalex-snapshot
Certification of Termination Proofs Using CeTA
inferredcites →https://doi.org/10.1007/978-3-642-16242-8_16openalex-snapshot
Lazy Abstraction for Size-Change Termination
inferredcites →https://doi.org/10.1007/978-3-642-22438-6_38openalex-snapshot
CSI – A Confluence Tool
inferredcites →https://doi.org/10.1007/978-3-642-24364-6_17openalex-snapshot
Generalized and Formalized Uncurrying
inferredcites →https://doi.org/10.1007/978-3-642-31365-3_19openalex-snapshot
Proving Non-looping Non-termination Automatically
inferredcites →https://doi.org/10.1007/978-3-642-31365-3_41openalex-snapshot
KBCV – Knuth-Bendix Completion Visualizer
inferredcites →https://doi.org/10.1007/978-3-642-40885-4_22openalex-snapshot
Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_23openalex-snapshot
Simple Word Problems in Universal Algebras
inferredcites →https://doi.org/10.1007/s00200-005-0179-7openalex-snapshot
The size-change principle and dependency pairs for termination of term rewriting
inferredcites →https://doi.org/10.1007/s10817-006-9057-7openalex-snapshot
Mechanizing and Improving Dependency Pairs
inferredcites →https://doi.org/10.1007/s10817-007-9087-9openalex-snapshot
Matrix Interpretations for Proving Termination of Term Rewriting
inferredcites →https://doi.org/10.1007/s10817-012-9248-3openalex-snapshot
Uncurrying for Termination and Complexity
inferredcites →https://doi.org/10.1007/s10817-012-9249-2openalex-snapshot
Multi-Completion with Termination Tools
inferredcites →https://doi.org/10.1016/b978-0-08-012975-4.50028-xopenalex-snapshot
Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.
inferredcites →https://doi.org/10.1016/j.ic.2006.08.007openalex-snapshot
On tree automata that certify termination of left-linear term rewriting systems
inferredcites →https://doi.org/10.1016/j.ic.2006.08.010openalex-snapshot
Tyrolean termination tool: Techniques and features
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.1017/s0960129511000120openalex-snapshot
CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates
inferredcites →https://doi.org/10.1051/ita:2005029openalex-snapshot
Polynomials over the reals in proofs of termination : from theory to practice
inferredcites →https://doi.org/10.1145/360204.360210openalex-snapshot
The size-change principle for program termination
inferredcites →https://doi.org/10.1145/373243.360210openalex-snapshot
The size-change principle for program termination
inferredcites →https://doi.org/10.2168/lmcs-10(1:19)2014openalex-snapshot
Modular Complexity Analysis for Term Rewriting
inferredcites →https://doi.org/10.2168/lmcs-10(3:12)2014openalex-snapshot
Ambiguity of {\omega}-Languages of Turing Machines
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-24124openalex-snapshot
TERMINATION OF TERM REWRITING BY SEMANTIC LABELLING
inferredcites →https://doi.org/10.4230/lipics.rta.2011.21openalex-snapshot
Automated Certified Proofs with CiME3
inferredcites →https://doi.org/10.4230/lipics.rta.2013.71openalex-snapshot
Tyrolean Complexity Tool: Features and Usage.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-17502-3openalex-snapshot
Tools and Algorithms for the Construction and Analysis of Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-17502-3_10openalex-snapshot
The Termination and Complexity Competition
inferred← citeshttps://doi.org/10.1007/978-3-030-29436-6_30openalex-snapshot
Certified Equational Reasoning via Ordered Completion
inferred← citeshttps://doi.org/10.1007/978-3-030-36987-3_2openalex-snapshot
A Distributed and Trusted Web of Formal Proofs
inferred← citeshttps://doi.org/10.1007/978-3-030-79876-5_16openalex-snapshot
Multi-Dimensional Interpretations for Termination of Term Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-031-57256-2_7openalex-snapshot
Btor2-Cert: A Certifying Hardware-Verification Framework Using Software Analyzers
inferred← citeshttps://doi.org/10.1007/978-3-031-66149-5_11openalex-snapshot
Software Verification Witnesses 2.0
inferred← citeshttps://doi.org/10.1007/978-3-031-73741-1_22openalex-snapshot
Safeguarding AI-Based Software Development and Verification using Witnesses (Position Paper)
inferred← citeshttps://doi.org/10.1007/978-3-032-32537-2_2openalex-snapshot
Transition Invariants Revisited: Termination Witnesses and Their Validation
inferred← citeshttps://doi.org/10.1007/978-3-319-20615-8_4openalex-snapshot
Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof
inferred← citeshttps://doi.org/10.1007/978-3-319-22102-1_10openalex-snapshot
Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker
inferred← citeshttps://doi.org/10.1007/978-3-319-43144-4_18openalex-snapshot
Certification of Classical Confluence Results for Left-Linear Term Rewrite Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-63046-5_24openalex-snapshot
CSI: New Evidence – A Progress Report
inferred← citeshttps://doi.org/10.1007/978-3-319-63046-5_28openalex-snapshot
Certifying Safety and Termination Proofs for Integer Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-66107-0_11openalex-snapshot
How to Get More Out of Your Oracles
inferred← citeshttps://doi.org/10.1007/978-3-319-94205-6_23openalex-snapshot
Cops and CoCoWeb: Infrastructure for Confluence Tools
inferred← citeshttps://doi.org/10.1007/s10009-021-00620-4openalex-snapshot
CoCo 2019: report on the eighth confluence competition
inferred← citeshttps://doi.org/10.1007/s10817-017-9405-9openalex-snapshot
Formally Proving Size Optimality of Sorting Networks
inferred← citeshttps://doi.org/10.1007/s10817-018-9490-4openalex-snapshot
Formally Verifying the Solution to the Boolean Pythagorean Triples Problem
inferred← citeshttps://doi.org/10.1007/s10817-022-09640-4openalex-snapshot
Tuple Interpretations for Termination of Term Rewriting
inferred← citeshttps://doi.org/10.1109/ase63991.2025.00164openalex-snapshot
Non-termination Witnesses and Their Validation
inferred← citeshttps://doi.org/10.1145/2950290.2950351openalex-snapshot
Correctness witnesses: exchanging verification results between verifiers
inferred← citeshttps://doi.org/10.1145/3293880.3294099openalex-snapshot
Certified ACKBO
inferred← citeshttps://doi.org/10.1145/3477579openalex-snapshot
Verification Witnesses
inferred← citeshttps://doi.org/10.1145/3573105.3575667openalex-snapshot
A Formalization of the Development Closedness Criterion for Left-Linear Term Rewrite Systems
inferred← citeshttps://doi.org/10.1145/3703595.3705889openalex-snapshot
An Isabelle Formalization of Co-rewrite Pairs for Non-reachability in Term Rewriting
inferred← citeshttps://doi.org/10.4204/eptcs.313.4openalex-snapshot
Tools in Term Rewriting for Education
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.