On the public citation graph

Efficient SAT-Based Search for Longest Sensitisable Paths

0 signed · 43 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/978-3-540-24605-3_37openalex-snapshot
An Extensible SAT-solver
inferredcites →https://doi.org/10.1007/s10766-009-0124-7openalex-snapshot
Thread-Parallel Integrated Test Pattern Generator Utilizing Satisfiability Analysis
inferredcites →https://doi.org/10.1023/a:1024648227669openalex-snapshot
On Selecting Testable Paths in Scan Designs
inferredcites →https://doi.org/10.1109/43.536723openalex-snapshot
Combinational test generation using satisfiability
inferredcites →https://doi.org/10.1109/aspdac.2007.358108openalex-snapshot
Multithreaded SAT Solving
inferredcites →https://doi.org/10.1109/ats.2009.31openalex-snapshot
Dynamic Compaction in SAT-Based ATPG
inferredcites →https://doi.org/10.1109/ats.2010.61openalex-snapshot
An Efficient Algorithm for Finding a Universal Set of Testable Long Paths
inferredcites →https://doi.org/10.1109/date.2002.998262openalex-snapshot
BerkMin: A fast and robust SAT-solver
inferredcites →https://doi.org/10.1109/ddecs.2011.5783055openalex-snapshot
SAT-based analysis of sensitisable paths
inferredcites →https://doi.org/10.1109/iccd.2004.1347921openalex-snapshot
Diagnosis of hold time defects
inferredcites →https://doi.org/10.1109/mm.2004.85openalex-snapshot
Razor: circuit-level correction of timing errors for low-power operation
inferredcites →https://doi.org/10.1109/tcad.2008.923107openalex-snapshot
On Acceleration of SAT-Based ATPG for Industrial Designs
inferredcites →https://doi.org/10.1109/tcad.2010.2043591openalex-snapshot
Test-Pattern Selection for Screening Small-Delay Defects in Very-Deep Submicrometer Integrated Circuits
inferredcites →https://doi.org/10.1109/test.1989.82368openalex-snapshot
Efficient generation of test patterns using Boolean difference
inferredcites →https://doi.org/10.1109/test.1993.470604openalex-snapshot
Delay testing for non-robust untestable circuits
inferredcites →https://doi.org/10.1109/test.2003.1270886openalex-snapshot
An efficient algorithm for finding the k longest testable paths through each gate in a combinational circuit
inferredcites →https://doi.org/10.1109/vdat.2008.4542416openalex-snapshot
Debugging clock-data race failures caused by vulnerable design
inferredcites →https://doi.org/10.1109/vlsi.design.2009.20openalex-snapshot
TIGUAN: Thread-Parallel Integrated Test Pattern Generator Utilizing Satisfiability ANalysis
inferredcites →https://doi.org/10.1145/2024724.2024822openalex-snapshot
Testability driven statistical path selection
inferredcites →https://doi.org/10.1145/378239.379017openalex-snapshot
Chaff

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-642-40564-8_10openalex-snapshot
Accurate Computation of Sensitizable Paths Using Answer Set Programming
inferred← citeshttps://doi.org/10.1007/s10836-026-06231-8openalex-snapshot
ATPG Optimization for Bridging Faults in Incomplete Testing of SoCs
inferred← citeshttps://doi.org/10.1109/aspdac.2013.6509651openalex-snapshot
Provably optimal test cube generation using quantified boolean formula solving
inferred← citeshttps://doi.org/10.1109/ats.2012.14openalex-snapshot
Variation-Aware Fault Grading
inferred← citeshttps://doi.org/10.1109/ats.2012.35openalex-snapshot
Robust Timing-Aware Test Generation Using Pseudo-Boolean Optimization
inferred← citeshttps://doi.org/10.1109/date.2012.6176507openalex-snapshot
On the optimality of K longest path generation algorithm under memory constraints
inferred← citeshttps://doi.org/10.1109/dft.2013.6653575openalex-snapshot
Mixed structural-functional path delay test generation and compaction
inferred← citeshttps://doi.org/10.1109/dtis.2014.6850674openalex-snapshot
Recent advances in SAT-based ATPG: Non-standard fault models, multi constraints and optimization
inferred← citeshttps://doi.org/10.1109/ets.2012.6233026openalex-snapshot
Multi-conditional SAT-ATPG for power-droop testing
inferred← citeshttps://doi.org/10.1109/ets.2012.6233027openalex-snapshot
On the quality of test vectors for post-silicon characterization
inferred← citeshttps://doi.org/10.1109/ets.2014.6847806openalex-snapshot
Variation-aware deterministic ATPG
inferred← citeshttps://doi.org/10.1109/iccad.2013.6691102openalex-snapshot
Improved SAT-based ATPG: More constraints, better compaction
inferred← citeshttps://doi.org/10.1109/iccad.2013.6691103openalex-snapshot
Automatic test pattern generation for delay defects using timed characteristic functions
inferred← citeshttps://doi.org/10.1109/iolts60994.2024.10616077openalex-snapshot
Fault Grading Techniques for Evaluating Software-Based Self-Test with Respect to Small Delay Defects
inferred← citeshttps://doi.org/10.1109/test.2012.6401550openalex-snapshot
Functional test of small-delay faults using SAT and Craig interpolation
inferred← citeshttps://doi.org/10.1109/test.2013.6651925openalex-snapshot
Early-life-failure detection using SAT-based ATPG
inferred← citeshttps://doi.org/10.1109/vlsi-dat.2015.7114503openalex-snapshot
TARGET: Timing-AwaRe Gate Exhaustive Transition ATPG for cell-internal defects
inferred← citeshttps://doi.org/10.1109/vlsid.2014.16openalex-snapshot
Techniques to Improve the Efficiency of SAT Based Path Delay Test Generation
inferred← citeshttps://doi.org/10.1109/vts.2012.6231098openalex-snapshot
SAT-ATPG using preferences for improved detection of complex defect mechanisms
inferred← citeshttps://doi.org/10.1142/s0218126619502402openalex-snapshot
Automatic Test Pattern Generation Through Boolean Satisfiability for Testing Bridging Faults
inferred← citeshttps://doi.org/10.1145/2429384.2429391openalex-snapshot
Small-delay-fault ATPG with waveform accuracy
inferred← citeshttps://doi.org/10.1515/itit-2013-1041openalex-snapshot
An effective fault ordering heuristic for SAT-based dynamic test compaction techniques
inferred← citeshttps://doi.org/10.23919/date.2019.8714898openalex-snapshot
Test Pattern Generation for Approximate Circuits Based on Boolean Satisfiability
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.