On the public citation graph
Computer Logic, Testing and Verification.
0 signed · 62 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.
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.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-61708-6_62openalex-snapshot
Avoiding combinatorial explosion in automatic test generation: Reasoning about measurements is the key
inferred← citeshttps://doi.org/10.1007/978-1-4615-0292-0_1openalex-snapshot
Formal Methods for Functional Verification
inferred← citeshttps://doi.org/10.1007/978-1-4615-0292-0_16openalex-snapshot
Exact Minimization of Multiple-Valued Functions for PLA Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4757-3635-9_1openalex-snapshot
Introduction to the testing of integrated circuits
inferred← citeshttps://doi.org/10.1007/978-1-4899-6856-2_3openalex-snapshot
Design of combinational circuits
inferred← citeshttps://doi.org/10.1007/978-3-642-69698-5_10openalex-snapshot
Automatische Verifikation logischer Entwürfe
inferred← citeshttps://doi.org/10.1007/978-3-642-95600-3_6openalex-snapshot
Test von Semicustom-Schaltungen
inferred← citeshttps://doi.org/10.1007/978-981-97-8257-4_5openalex-snapshot
7.5 Testing Combinational Logic
inferred← citeshttps://doi.org/10.1007/bf00881867openalex-snapshot
Simplification in a satisfiability checker for VLSI applications
inferred← citeshttps://doi.org/10.1007/bf02684537openalex-snapshot
Improvement of the algorithm principles for minimization of multi-output functions
inferred← citeshttps://doi.org/10.1007/bf02943410openalex-snapshot
A complete critical path algorithm for test generation of combinational circuits
inferred← citeshttps://doi.org/10.1007/bfb0023939openalex-snapshot
Diagnostic information at your fingertips!
inferred← citeshttps://doi.org/10.1016/0165-6074(83)90112-6openalex-snapshot
A synthesis system for PLA-based programmable hardware
inferred← citeshttps://doi.org/10.1016/0165-6074(85)90070-5openalex-snapshot
Testable design with PLA macros
inferred← citeshttps://doi.org/10.1016/0898-1221(89)90223-xopenalex-snapshot
Electronic circuit diagnostic expert systems—A survey
inferred← citeshttps://doi.org/10.1049/ip-e.1988.0002openalex-snapshot
Exhaustive testing of stuck-open faults in CMOS combinational circuits
inferred← citeshttps://doi.org/10.1049/ip-e.1989.0019openalex-snapshot
Systematic procedure for test generation of PAL-based circuits
inferred← citeshttps://doi.org/10.1049/jiere.1987.0093openalex-snapshot
Functional testing of LSI/VLSI chips—A survey
inferred← citeshttps://doi.org/10.1080/00207218908925361openalex-snapshot
A distributive D-algorithm for generating the test pattern for faulty combinational circuit
inferred← citeshttps://doi.org/10.1080/00207219008920344openalex-snapshot
One more way to calculate the Hadamard-Walsh spectrum for completely and incompletely specified boolean functions
inferred← citeshttps://doi.org/10.1080/00207219108921306openalex-snapshot
Algorithm for the generation of disjoint cubes for completely and incompletely specified boolean functions
inferred← citeshttps://doi.org/10.1109/12.509916openalex-snapshot
Negation trees: a unified approach to Boolean function complementation
inferred← citeshttps://doi.org/10.1109/43.170986openalex-snapshot
Effective computer methods for the calculation of Rademacher-Walsh spectrum for completely and incompletely specified Boolean functions
inferred← citeshttps://doi.org/10.1109/43.3140openalex-snapshot
SOCRATES: a highly efficient automatic test pattern generation system
inferred← citeshttps://doi.org/10.1109/43.3200openalex-snapshot
Verification algorithms for VLSI synthesis
inferred← citeshttps://doi.org/10.1109/43.3947openalex-snapshot
Fast functional simulation: an incremental approach
inferred← citeshttps://doi.org/10.1109/43.3948openalex-snapshot
Analysis and synthesis of combinational pass transistor circuits
inferred← citeshttps://doi.org/10.1109/43.59075openalex-snapshot
The complexity of fault detection in MOS VLSI circuits
inferred← citeshttps://doi.org/10.1109/43.62795openalex-snapshot
Formal verification of memory circuits by switch-level simulation
inferred← citeshttps://doi.org/10.1109/ats.1992.224419openalex-snapshot
Techniques for reducing hardware requirement of self checking combinational circuits
inferred← citeshttps://doi.org/10.1109/date.2011.5763018openalex-snapshot
Cross-layer optimized placement and routing for FPGA soft error mitigation
inferred← citeshttps://doi.org/10.1109/dsn.2001.941402openalex-snapshot
An approach for analysing the propagation of data errors in software
inferred← citeshttps://doi.org/10.1109/dsn.2002.1028894openalex-snapshot
On the placement of software mechanisms for detection of data errors
inferred← citeshttps://doi.org/10.1109/ftcs.1988.5293openalex-snapshot
Advanced automatic test pattern generation and redundancy identification techniques
inferred← citeshttps://doi.org/10.1109/hst.2013.6581568openalex-snapshot
WordRev: Finding word-level structures in a sea of bit-level gates
inferred← citeshttps://doi.org/10.1109/iccad.2002.1167572openalex-snapshot
Binary time-frame expansion [circuit verification]
inferred← citeshttps://doi.org/10.1109/iscas.1992.230099openalex-snapshot
The Cube Calculus Machine: a ring of asynchronous automata to process multiple-valued Boolean functions
inferred← citeshttps://doi.org/10.1109/ismvl.1989.37793openalex-snapshot
Minimization of multiple-valued input multi-output mixed-radix exclusive sums of products for incompletely specified Boolean functions
inferred← citeshttps://doi.org/10.1109/mwscas.1997.666121openalex-snapshot
Test pattern generation for multiple output digital circuits using cubical calculus and Boolean differences
inferred← citeshttps://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferred← citeshttps://doi.org/10.1109/tc.2004.1275294openalex-snapshot
EPIC: profiling the propagation and effect of data errors in software
inferred← citeshttps://doi.org/10.1109/test.1989.82277openalex-snapshot
An optimal test sequence for the JTAG/IEEE P1149.1 test access port controller
inferred← citeshttps://doi.org/10.1109/tetc.2013.2294918openalex-snapshot
Reverse Engineering Digital Circuits Using Structural and Functional Analyses
inferred← citeshttps://doi.org/10.1145/103516.103519openalex-snapshot
A methodology for hardware verification based on logic simulation
inferred← citeshttps://doi.org/10.1145/123186.128296openalex-snapshot
Symbolic simulation---techniques and applications
inferred← citeshttps://doi.org/10.1145/74382.74421openalex-snapshot
New methods in the analysis of logic minimization data and algorithms
inferred← citeshttps://doi.org/10.1145/74382.74452openalex-snapshot
Test pattern generation for sequential MOS circuits by symbolic fault simulation
inferred← citeshttps://doi.org/10.1145/774572.774573openalex-snapshot
Comprehensive frequency-dependent substrate noise analysis using boundary element methods
inferred← citeshttps://doi.org/10.1145/800172.809675openalex-snapshot
Parallel processing, special-purpose hardware, and DA applications
inferred← citeshttps://doi.org/10.1147/rd.254.0281openalex-snapshot
GRIN: Interactive Graphics for Modeling Solids
inferred← citeshttps://doi.org/10.3929/ethz-a-005506737openalex-snapshot
Analytical solutions of linked fault tree probabilistic risk assessments using binary decision diagrams with emphasis on nuclear safety applications
inferred← citeshttps://doi.org/10.5120/1959-2621openalex-snapshot
Optimal Boolean Function Simplification through K-Map using Object-Oriented Algorithm
inferred← citeshttps://doi.org/10.5555/285730.285799openalex-snapshot
A fast algorithm to minimize multi-output mixed-polarity generalized Reed-Muller forms
inferred← citeshttps://doi.org/10.5555/317825.317964openalex-snapshot
Symbolic Manipulation of Boolean Functions Using a Graphical Representation
inferred← citeshttps://doi.org/10.5555/800263.809200openalex-snapshot
Techniques for Programmable Logic Array Folding
inferred← citeshttps://doi.org/10.5555/800263.809277openalex-snapshot
Implication Algorithms for MOS Switch Level Functional Macromodeling, Implication and Testing
inferred← citeshttps://doi.org/10.5555/800263.809296openalex-snapshot
Logical Correctness by Construction
inferred← citeshttps://doi.org/10.6138/jit.2012.13.5.10openalex-snapshot
An Approach to Representing Access Control Policies for Improving DFANS
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.