On the public citation graph
Synchronizing sequences and symbolic traversal techniques in test generation
0 signed · 98 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 this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0377-2217(90)90290-ropenalex-snapshot
Digital Systems : Testing and Testable Design
inferredcites →https://doi.org/10.1109/43.79502openalex-snapshot
Test generation and verification for highly sequential circuits
inferredcites →https://doi.org/10.1109/54.82040openalex-snapshot
A test-pattern-generation algorithm for sequential circuits
inferredcites →https://doi.org/10.1109/9780470544389openalex-snapshot
Digital Systems Testing and Testable Design
inferredcites →https://doi.org/10.1109/dac.1992.227811openalex-snapshot
Exact calculation of synchronization sequences based on binary decision diagrams
inferredcites →https://doi.org/10.1109/edac.1991.206393openalex-snapshot
HITEC: a test generation package for sequential circuits
inferredcites →https://doi.org/10.1109/ftcs.1991.146632openalex-snapshot
Test generation for synchronous sequential circuits using multiple observation times
inferredcites →https://doi.org/10.1109/ftcsh.1995.532659openalex-snapshot
TEST GENERATION FOR SYNCHRONOUS SEQUENTIAL CIRCUITS USING MULTIPLE OBSERVATION TIMES
inferredcites →https://doi.org/10.1109/iccad.1988.122451openalex-snapshot
Logic verification using binary decision diagrams in a logic synthesis environment
inferredcites →https://doi.org/10.1109/iccad.1989.76938openalex-snapshot
State assignment for initializable synthesis (gate level analysis)
inferredcites →https://doi.org/10.1109/iccad.1990.129860openalex-snapshot
Implicit state enumeration of finite state machines using BDD's
inferredcites →https://doi.org/10.1109/iccad.1990.129861openalex-snapshot
ATPG aspects of FSM verification
inferredcites →https://doi.org/10.1109/iccad.1990.129940openalex-snapshot
Don't care minimization of multi-level sequential logic networks
inferredcites →https://doi.org/10.1109/iccad.1991.185279openalex-snapshot
An ATPG-based approach to sequential logic optimization
inferredcites →https://doi.org/10.1109/iccad.1991.185280openalex-snapshot
Calculating resettability and reset sequences
inferredcites →https://doi.org/10.1109/iccad.1991.185300openalex-snapshot
A new test generation method for sequential circuits
inferredcites →https://doi.org/10.1109/iccad.1991.185302openalex-snapshot
Increasing fault coverage for synchronous sequential circuits by the multiple observation time test strategy
inferredcites →https://doi.org/10.1109/iccd.1991.139849openalex-snapshot
Redundancy identification and removal based on implicit state enumeration
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1109/test.1991.519494openalex-snapshot
A COMMON APPROACH TO TEST GENERATION AND HARDWARE VERIFICATION BASED ON TEMPORAL LOGIC
inferredcites →https://doi.org/10.1109/test.1991.519495openalex-snapshot
Fast Sequential ATPG Based on Implicit State Enumeration
inferredcites →https://doi.org/10.1145/123186.123222openalex-snapshot
Efficient implementation of a BDD package
inferredcites →https://doi.org/10.5555/113938.149645openalex-snapshot
Exact calculation of synchronization sequences based on binary decision diagrams
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-58179-0_64openalex-snapshot
The verification problem for safe replaceability
inferred← citeshttps://doi.org/10.1007/978-3-030-86593-1_19openalex-snapshot
Computational Complexity of Synchronization Under Sparse Regular Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_61openalex-snapshot
Symbolic Topological Sorting with OBDDs
inferred← citeshttps://doi.org/10.1007/978-3-540-88282-4_4openalex-snapshot
Synchronizing Automata and the Černý Conjecture
inferred← citeshttps://doi.org/10.1007/978-90-481-9644-9openalex-snapshot
Design, Analysis and Test of Logic Circuits Under Uncertainty
inferred← citeshttps://doi.org/10.1007/978-90-481-9644-9_5openalex-snapshot
Signature-Based Reliability Analysis
inferred← citeshttps://doi.org/10.1007/bf00136073openalex-snapshot
Sequential circuit test generation using dynamic justification equivalence
inferred← citeshttps://doi.org/10.1016/j.jda.2005.01.008openalex-snapshot
Symbolic topological sorting with OBDDs
inferred← citeshttps://doi.org/10.1016/s0167-9260(97)00015-1openalex-snapshot
A complete testing strategy based on interacting and hierarchical FSMs
inferred← citeshttps://doi.org/10.1016/s0167-9260(98)00018-2openalex-snapshot
Testing with decision diagrams
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82545-9openalex-snapshot
SAT-Based Methods for Sequential Hardware Equivalence Verification without Synchronization
inferred← citeshttps://doi.org/10.1023/a:1008333803059openalex-snapshot
Initialization of Sequential Circuits and its Application to ATPG
inferred← citeshttps://doi.org/10.1023/a:1008376522451openalex-snapshot
Hybrid Fault Simulation for Synchronous Sequential Circuits
inferred← citeshttps://doi.org/10.1023/a:1008632417306openalex-snapshot
The General Product Machine: a New Model for Symbolic FSM Traversal
inferred← citeshttps://doi.org/10.1023/a:1008651924240openalex-snapshot
A Symbolic Algorithms for Maximum Flow in 0-1 Networks
inferred← citeshttps://doi.org/10.1023/a:1011193725824openalex-snapshot
Combining GAs and Symbolic Methods for High Quality Tests of Sequential Circuits
inferred← citeshttps://doi.org/10.1023/a:1012275631257openalex-snapshot
Sequential Circuit Test Generation Using a Symbolic/Genetic Hybrid Approach
inferred← citeshttps://doi.org/10.1051/ita/2021005openalex-snapshot
Synchronizing series-parallel deterministic finite automata with loops and related problems
inferred← citeshttps://doi.org/10.1109/12.364543openalex-snapshot
On fault simulation for synchronous sequential circuits
inferred← citeshttps://doi.org/10.1109/12.844343openalex-snapshot
A hierarchical test generation approach for large controllers
inferred← citeshttps://doi.org/10.1109/12.980008openalex-snapshot
Test generation and testability alternatives exploration of critical algorithms for embedded applications
inferred← citeshttps://doi.org/10.1109/43.238030openalex-snapshot
Redundancy identification/removal and test generation for sequential circuits using implicit state enumeration
inferred← citeshttps://doi.org/10.1109/43.552081openalex-snapshot
Markovian analysis of large finite state machines
inferred← citeshttps://doi.org/10.1109/43.631208openalex-snapshot
Symbolic FSM traversals based on the transition relation
inferred← citeshttps://doi.org/10.1109/43.631218openalex-snapshot
LOCSTEP: a logic-simulation-based test generation procedure
inferred← citeshttps://doi.org/10.1109/43.700722openalex-snapshot
Application of genetically engineered finite-state-machine sequences to sequential circuit ATPG
inferred← citeshttps://doi.org/10.1109/43.700724openalex-snapshot
Low-complexity fault simulation under the multiple observation time and the restricted multiple observation time testing approaches
inferred← citeshttps://doi.org/10.1109/43.863649openalex-snapshot
On synchronizable circuits and their synchronizing sequences
inferred← citeshttps://doi.org/10.1109/43.908455openalex-snapshot
Theory of safe replacements for sequential circuits
inferred← citeshttps://doi.org/10.1109/92.711323openalex-snapshot
Testability analysis and behavioral testing of the Hopfield neural paradigm
inferred← citeshttps://doi.org/10.1109/aspdac.1997.600172openalex-snapshot
The use of hierarchical information to test large controllers
inferred← citeshttps://doi.org/10.1109/aspdac.1999.760022openalex-snapshot
Combining GAs and symbolic methods for high quality tests of sequential circuits
inferred← citeshttps://doi.org/10.1109/aspdac.2016.7428101openalex-snapshot
Mixed 01X-RSL-Encoding for fast and accurate ATPG with unknowns
inferred← citeshttps://doi.org/10.1109/ats.2011.52openalex-snapshot
Efficient BDD-based Fault Simulation in Presence of Unknown Values
inferred← citeshttps://doi.org/10.1109/dac.1995.249970openalex-snapshot
Symbolic Fault Simulation for Sequential Circuits and the Multiple Observation Time Test Strategy
inferred← citeshttps://doi.org/10.1109/dac.1997.597218openalex-snapshot
Fault Simulation Under The Multiple Observation Time Approach Using Backward Implications
inferred← citeshttps://doi.org/10.1109/date.2011.5763209openalex-snapshot
SAT-based fault coverage evaluation in the presence of unknown values
inferred← citeshttps://doi.org/10.1109/dftvs.1994.630037openalex-snapshot
Test generation for stuck-at and gate-delay faults in sequential circuits: a mixed functional/structural method
inferred← citeshttps://doi.org/10.1109/edtc.1994.326875openalex-snapshot
Symbolic algorithms to calculate steady-state probabilities of a finite state machine
inferred← citeshttps://doi.org/10.1109/edtc.1995.470386openalex-snapshot
Improved sequential ATPG using functional observation information and new justification methods
inferred← citeshttps://doi.org/10.1109/edtc.1997.582325openalex-snapshot
Sequential circuit test generation using dynamic state traversal
inferred← citeshttps://doi.org/10.1109/etw.2000.873786openalex-snapshot
Combining symbolic and genetic techniques for efficient sequential circuit test generation
inferred← citeshttps://doi.org/10.1109/famcad.2007.37openalex-snapshot
Industrial Strength SAT-based Alignability Algorithm for Hardware Equivalence Verification
inferred← citeshttps://doi.org/10.1109/ftcs.1995.466992openalex-snapshot
LOCSTEP: a logic simulation based test generation procedure
inferred← citeshttps://doi.org/10.1109/iccd.1996.563565openalex-snapshot
Using functional information and strategy switching in sequential ATPG
inferred← citeshttps://doi.org/10.1109/icvd.1995.512085openalex-snapshot
Generalization of search state equivalence for automatic test pattern generation
inferred← citeshttps://doi.org/10.1109/icvd.1997.568078openalex-snapshot
Formal verification of digital systems
inferred← citeshttps://doi.org/10.1109/icvd.1998.646649openalex-snapshot
MIX: a test generation system for synchronous sequential circuits
inferred← citeshttps://doi.org/10.1109/iscas.1994.408814openalex-snapshot
Detecting hard faults with combined approximate forward/backward symbolic techniques
inferred← citeshttps://doi.org/10.1109/tai.2002.1180847openalex-snapshot
A genetic testing framework for digital integrated circuits
inferred← citeshttps://doi.org/10.1109/tcad.2005.850835openalex-snapshot
Sequential circuit ATPG using combinational algorithms
inferred← citeshttps://doi.org/10.1109/tcad.2008.2009139openalex-snapshot
Signature-Based SER Analysis and Design of Logic Circuits
inferred← citeshttps://doi.org/10.1109/tcad.2012.2210422openalex-snapshot
Accurate X-Propagation for Test Applications by SAT-Based Reasoning
inferred← citeshttps://doi.org/10.1109/test.1994.527946openalex-snapshot
Fastpath: a path-delay test generator for standard scan designs
inferred← citeshttps://doi.org/10.1109/test.1994.528006openalex-snapshot
A hybrid fault simulator for synchronous sequential circuits
inferred← citeshttps://doi.org/10.1109/test.1994.528047openalex-snapshot
Full symbolic ATPG for large circuits
inferred← citeshttps://doi.org/10.1109/test.1996.557148openalex-snapshot
An ATPG-based framework for verifying sequential equivalence
inferred← citeshttps://doi.org/10.1109/test.1998.743202openalex-snapshot
Implicit test generation for behavioral VHDL models
inferred← citeshttps://doi.org/10.1109/vlsid.2014.18openalex-snapshot
Efficient SAT-Based Circuit Initialization for Larger Designs
inferred← citeshttps://doi.org/10.1109/vtest.1995.512610openalex-snapshot
Identifying sequentially untestable faults using illegal states
inferred← citeshttps://doi.org/10.1109/vtest.1996.510860openalex-snapshot
Automatic test generation using genetically-engineered distinguishing sequences
inferred← citeshttps://doi.org/10.1109/vtest.1996.510864openalex-snapshot
Initialization of sequential circuits and its application to ATPG
inferred← citeshttps://doi.org/10.1109/vtest.1997.600297openalex-snapshot
EXTEST: a method to extend test sequences of synchronous sequential circuits to increase the fault coverage
inferred← citeshttps://doi.org/10.1109/vtest.1998.670864openalex-snapshot
On synchronizing sequences and test sequence partitioning
inferred← citeshttps://doi.org/10.1145/157485.164978openalex-snapshot
Minimum length synchronizing sequences of finite state machine
inferred← citeshttps://doi.org/10.1145/238997.238999openalex-snapshot
Gate-level test generation for sequential circuits
inferred← citeshttps://doi.org/10.1145/266021.266297openalex-snapshot
Fault simulation under the multiple observation time approach using backward implications
inferred← citeshttps://doi.org/10.1145/348019.348288openalex-snapshot
Dynamic state traversal for sequential circuit test generation
inferred← citeshttps://doi.org/10.1145/375977.376022openalex-snapshot
Verifying sequential equivalence using ATPG techniques
inferred← citeshttps://doi.org/10.48550/arxiv.2109.02743openalex-snapshot
Constrained Synchronization for Commutative Automata and Automata with Simple Idempotents
inferred← citeshttps://doi.org/10.5555/259794.259860openalex-snapshot
A symbolic algorithm for maximum flow in 0-1 networks
inferred← citeshttps://doi.org/10.5555/787258.787449openalex-snapshot
Improved sequential ATPG using functional observation information and new justification methods
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.