On the public citation graph

Boolean Difference Calculus and Fault Finding

https://doi.org/10.1137/0124014
0 signed · 16 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.1109/pgec.1966.264376openalex-snapshot
On Finding a Nearly Minimal Set of Fault Detection Tests for Combinational Logic Nets
inferredcites →https://doi.org/10.1109/tc.1972.5008925openalex-snapshot
Path Sensitization, Partial Boolean Difference, and Automated Fault Diagnosis

What points at this work

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

inferred← citeshttps://doi.org/10.1002/stvr.1641openalex-snapshot
Prioritizing MCDC test cases by spectral analysis of Boolean functions
inferred← citeshttps://doi.org/10.1007/s11219-021-09560-3openalex-snapshot
Test input generation from cause–effect graphs
inferred← citeshttps://doi.org/10.1016/0020-0255(86)90025-3openalex-snapshot
Complete test-set generation for bridging faults in combinational-logic circuits
inferred← citeshttps://doi.org/10.1016/j.infsof.2003.10.003openalex-snapshot
Comparison of fault classes in specification-based testing
inferred← citeshttps://doi.org/10.1016/s2307-1877(25)00875-2openalex-snapshot
Weighted voting systems: A threshold- Boolean perspective
inferred← citeshttps://doi.org/10.1080/00207168508803483openalex-snapshot
An efficient algorithm for single and multiple fault test sets generation
inferred← citeshttps://doi.org/10.1080/00207168808803663openalex-snapshot
A graph-theoretic multiple logic fault analysis through petri-nets
inferred← citeshttps://doi.org/10.1093/comjnl/35.6.574openalex-snapshot
A Technique for Analyzing the Effects of Changes in Formal Specifications
inferred← citeshttps://doi.org/10.1109/proc.1976.10351openalex-snapshot
On multiple fault analysis in combinational circuits by means of Boolean difference
inferred← citeshttps://doi.org/10.1109/qrs-c.2016.40openalex-snapshot
Moving Switching Functions to Continuous Domain
inferred← citeshttps://doi.org/10.1109/t-c.1975.224083openalex-snapshot
The Boolean Difference and Multiple Fault Analysis
inferred← citeshttps://doi.org/10.15407/csc.2023.01.005openalex-snapshot
A Simple Stuck-at-faults Detection Method in Digital Combinational Circuits
inferred← citeshttps://doi.org/10.15407/csc.2024.01.003openalex-snapshot
A Simple Stuck-at-faults Detection Method in Digital Combinational Circuits. II
inferred← citeshttps://doi.org/10.7603/s40632-016-0007-1openalex-snapshot
Weighted voting systems: A threshold- Boolean perspective
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.