On the public citation graph

Reliability theory of program testing

0 signed · 19 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/bf00260923openalex-snapshot

Algebraic program testing

inferredcites →https://doi.org/10.1093/comjnl/20.3.232openalex-snapshot

Testing programs with finite sets of data

inferredcites →https://doi.org/10.1109/c-m.1978.218136openalex-snapshot

Hints on Test Data Selection: Help for the Practicing Programmer

inferredcites →https://doi.org/10.1109/tse.1976.233816openalex-snapshot

Reliability of the Path Analysis Testing Strategy

inferredcites →https://doi.org/10.1109/tse.1977.231145openalex-snapshot

Testing Programs with the Aid of a Compiler

inferredcites →https://doi.org/10.1109/tse.1980.234487openalex-snapshot

Error Sensitive Test Cases Analysis (ESTCA)

inferredcites →https://doi.org/10.1145/390016.808473openalex-snapshot

Toward a theory of test data selection

inferredcites →https://doi.org/10.1145/800027.808473openalex-snapshot

Toward a theory of test data selection

inferredcites →https://doi.org/10.1145/800152.804914openalex-snapshot

A patent problem for abstract programming languages; machine-independent computations

What points at this work

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

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

The incorporation of testing into formal verification: Direct, modular, and hierarchical correctness degrees

inferred← citeshttps://doi.org/10.1016/0026-2714(92)90032-gopenalex-snapshot

Reliability testing: Bibliography

inferred← citeshttps://doi.org/10.1016/j.infsof.2012.06.003openalex-snapshot

Software quality assurance economics

inferred← citeshttps://doi.org/10.1109/52.143097openalex-snapshot

Are we testing for true reliability?

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

Test case generation by means of learning techniques

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

Testing by means of inductive program learning

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

Test case generation by means of learning techniques

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

The evaluation of program-based software test data adequacy criteria

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

Assessing Test Data Adequacy through Program Inference

inferred← citeshttps://doi.org/10.6083/5425kb02wopenalex-snapshot

Release testing for probable correctness

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.