On the public citation graph

A generalised query minimisation for program debugging

0 signed · 22 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-53104-1_33openalex-snapshot
A generic measurement proposer
inferredcites →https://doi.org/10.1007/bfb0019400openalex-snapshot
Debugging by diagnosing assumptions
inferredcites →https://doi.org/10.1016/0004-3702(87)90063-4openalex-snapshot
Diagnosing multiple faults
inferredcites →https://doi.org/10.1016/0004-3702(90)90012-oopenalex-snapshot
Using crude probability estimates to guide diagnosis
inferredcites →https://doi.org/10.1109/mc.1986.1663281openalex-snapshot
The FIS Electronics Troubleshooting System
inferredcites →https://doi.org/10.7551/mitpress/1192.001.0001openalex-snapshot
Algorithmic Program Debugging

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-540-71410-1_11openalex-snapshot
A Comparative Study of Algorithmic Debugging Strategies
inferred← citeshttps://doi.org/10.1007/978-3-642-24769-9_17openalex-snapshot
Optimal Divide and Query
inferred← citeshttps://doi.org/10.1007/978-3-642-38197-3_6openalex-snapshot
Enhancing Declarative Debugging with Loop Expansion and Tree Compression
inferred← citeshttps://doi.org/10.1007/978-3-642-38916-0_8openalex-snapshot
Speeding Up Algorithmic Debugging Using Balanced Execution Trees
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90030-2openalex-snapshot
Logic programming environments: Dynamic program analysis and debugging
inferred← citeshttps://doi.org/10.1016/j.advengsoft.2011.05.024openalex-snapshot
A survey on algorithmic debugging strategies
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.015openalex-snapshot
State of the Practice in Algorithmic Debugging
inferred← citeshttps://doi.org/10.1016/j.entcs.2011.12.005openalex-snapshot
Implementation of an Optimal Strategy for Algorithmic Debugging
inferred← citeshttps://doi.org/10.1109/ase.2011.6100055openalex-snapshot
An optimal strategy for algorithmic debugging
inferred← citeshttps://doi.org/10.1109/icesd.1994.302293openalex-snapshot
Universal program debugging using query minimisation
inferred← citeshttps://doi.org/10.1109/icicic.2007.258openalex-snapshot
Detecting Incorrect Rules Automatically in Equivalent Transformation Programs
inferred← citeshttps://doi.org/10.1109/icicic.2009.5openalex-snapshot
A Debugging Algorithm in Equivalent Transformation Model Using Oracle Rules
inferred← citeshttps://doi.org/10.1109/icsm.2010.5609661openalex-snapshot
An algorithmic debugger for Java
inferred← citeshttps://doi.org/10.1145/3106740openalex-snapshot
A Survey of Algorithmic Debugging
inferred← citeshttps://doi.org/10.48550/arxiv.1107.0350openalex-snapshot
Optimal Divide and Query (extended version)
inferred← citeshttps://doi.org/10.4995/thesis/10251/68506openalex-snapshot
Optimization Techniques for Algorithmic Debugging
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.