On the public citation graph

Improved SAT-based Reachability Analysis with Observability Don’t Cares

0 signed · 59 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/3-540-45657-0_19openalex-snapshot
Applying SAT Methods in Unbounded Symbolic Model Checking
inferredcites →https://doi.org/10.1007/978-1-4899-5327-8_25openalex-snapshot
On the Complexity of Derivation in Propositional Calculus
inferredcites →https://doi.org/10.1007/978-3-540-31980-1_19openalex-snapshot
Efficient Conflict Analysis for Finding All Satisfying Assignments of a Boolean Circuit
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_28openalex-snapshot
On the Complexity of Derivation in Propositional Calculus
inferredcites →https://doi.org/10.1007/978-3-662-03809-3openalex-snapshot
Introduction to Formal Hardware Verification
inferredcites →https://doi.org/10.1007/b116428openalex-snapshot
System-on-a-Chip Verification: Methodology and Techniques
inferredcites →https://doi.org/10.1016/0377-2217(90)90290-ropenalex-snapshot
Digital Systems : Testing and Testable Design
inferredcites →https://doi.org/10.1016/s0065-2458(03)58003-2openalex-snapshot
Bounded Model Checking
inferredcites →https://doi.org/10.1016/s0747-7171(86)80028-1openalex-snapshot
A Structure-preserving Clause Form Translation
inferredcites →https://doi.org/10.1017/cbo9780511816321openalex-snapshot
Testing of Digital Systems
inferredcites →https://doi.org/10.1109/43.108614openalex-snapshot
Test pattern generation using Boolean satisfiability
inferredcites →https://doi.org/10.1109/9780470544389openalex-snapshot
Digital Systems Testing and Testable Design
inferredcites →https://doi.org/10.1109/aspdac.2003.1195000openalex-snapshot
Algorithms for compacting error traces
inferredcites →https://doi.org/10.1109/aspdac.2006.1594640openalex-snapshot
Generation of shorter sequences for high resolution error diagnosis using sequential SAT
inferredcites →https://doi.org/10.1109/aspdac.2007.358109openalex-snapshot
Trace Compaction using SAT-based Reachability Analysis
inferredcites →https://doi.org/10.1109/dac.1999.781333openalex-snapshot
Symbolic model checking using SAT procedures instead of BDDs
inferredcites →https://doi.org/10.1109/dac.2001.935565openalex-snapshot
Chaff: engineering an efficient SAT solver
inferredcites →https://doi.org/10.1109/dac.2001.935566openalex-snapshot
Dynamic detection and removal of inactive clauses in SAT with application in image computation
inferredcites →https://doi.org/10.1109/date.2004.1268858openalex-snapshot
Managing don't cares in Boolean satisfiability
inferredcites →https://doi.org/10.1109/date.2004.1268859openalex-snapshot
Exploiting signal unobservability for efficient translation to CNF in formal verification of microprocessors
inferredcites →https://doi.org/10.1109/date.2005.102openalex-snapshot
Considering Circuit Observability Don't Cares in CNF Satisfiability
inferredcites →https://doi.org/10.1109/date.2005.14openalex-snapshot
A Faster Counterexample Minimization Algorithm Based on Refutation Analysis
inferredcites →https://doi.org/10.1109/date.2005.264openalex-snapshot
SAT-Based Complete Don't-Care Computation for Network Optimization
inferredcites →https://doi.org/10.1109/iccad.2003.159706openalex-snapshot
SATORI-a fast sequential SAT engine for circuits
inferredcites →https://doi.org/10.1109/iccad.2004.1382572openalex-snapshot
Debugging sequential circuits using Boolean satisfiability
inferredcites →https://doi.org/10.1109/iccad.2004.1382631openalex-snapshot
Efficient SAT-based unbounded symbolic model checking using circuit cofactoring
inferredcites →https://doi.org/10.1109/iccd.2003.1240948openalex-snapshot
SAT-based algorithms for logic minimization
inferredcites →https://doi.org/10.1109/ictai.2005.69openalex-snapshot
Good learning and implicit model enumeration
inferredcites →https://doi.org/10.1109/iscas.2006.1692903openalex-snapshot
Integrating Observability Don't Cares in All-Solution SAT Solvers
inferredcites →https://doi.org/10.1109/tcad.2004.841068openalex-snapshot
SAT-based unbounded symbolic model checking
inferredcites →https://doi.org/10.1145/1065579.1065775openalex-snapshot
Prime clauses for fast enumeration of satisfying assignments to boolean circuits
inferredcites →https://doi.org/10.1145/1120725.1120910openalex-snapshot
A fast counterexample minimization approach with refutation analysis and incremental SAT
inferredcites →https://doi.org/10.1145/1146909.1146970openalex-snapshot
SAT sweeping with local observability don't-cares
inferredcites →https://doi.org/10.1145/309847.309942openalex-snapshot
Symbolic model checking using SAT procedures instead of BDDs
inferredcites →https://doi.org/10.1145/378239.379017openalex-snapshot
Chaff
inferredcites →https://doi.org/10.1145/378239.379018openalex-snapshot
Dynamic detection and removal of inactive clauses in SAT with application in image computation
inferredcites →https://doi.org/10.3233/978-1-58603-929-5-457openalex-snapshot
Bounded Model Checking
inferredcites →https://doi.org/10.5555/968878.969032openalex-snapshot
Managing don't cares in Boolean satisfiability
inferredcites →https://doi.org/10.5860/choice.32-0950openalex-snapshot
Synthesis and optimization of digital circuits

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-319-09309-3_2openalex-snapshot
Preliminaries
inferred← citeshttps://doi.org/10.1007/978-3-319-09309-3_3openalex-snapshot
Automated Debugging for Logic Bugs
inferred← citeshttps://doi.org/10.1007/978-3-319-09309-3_4openalex-snapshot
Automated Debugging from Pre-Silicon to Post-Silicon
inferred← citeshttps://doi.org/10.1007/978-3-319-09309-3_5openalex-snapshot
Automated Debugging for Synchronization Bugs
inferred← citeshttps://doi.org/10.1007/978-3-319-09309-3_6openalex-snapshot
Analyzing Timing Variations
inferred← citeshttps://doi.org/10.1007/978-3-319-09309-3_7openalex-snapshot
Automated Debugging for Timing Variations
inferred← citeshttps://doi.org/10.1007/978-3-319-09309-3_8openalex-snapshot
Efficient Automated Speedpath Debugging
inferred← citeshttps://doi.org/10.1007/978-3-319-09309-3_9openalex-snapshot
Online Debug for NoC-Based Multiprocessor SoCs
inferred← citeshttps://doi.org/10.1016/j.micpro.2012.09.004openalex-snapshot
Automated design debugging in a testbench-based verification environment
inferred← citeshttps://doi.org/10.1109/aspdac.2010.5419784openalex-snapshot
Optimizing blocks in an SoC using symbolic code-statement reachability analysis
inferred← citeshttps://doi.org/10.1109/ats.2009.26openalex-snapshot
Speeding up SAT-Based ATPG Using Dynamic Clause Activation
inferred← citeshttps://doi.org/10.1109/date.2009.5090870openalex-snapshot
Increasing the accuracy of SAT-based debugging
inferred← citeshttps://doi.org/10.1109/ddecs.2013.6549787openalex-snapshot
Efficient automated speedpath debugging
inferred← citeshttps://doi.org/10.1109/dsd.2011.67openalex-snapshot
Automated Design Debugging in a Testbench-Based Verification Environment
inferred← citeshttps://doi.org/10.1109/idt.2014.7038596openalex-snapshot
Automated formal verification of X propagation with respect to testability issues
inferred← citeshttps://doi.org/10.1109/mdt.2012.2205479openalex-snapshot
A Highly Fault-Efficient SAT-Based ATPG Flow
inferred← citeshttps://doi.org/10.1109/test.2010.5699289openalex-snapshot
Robust algorithms for high quality Test Pattern Generation using Boolean Satisfiability
inferred← citeshttps://doi.org/10.1145/3157053openalex-snapshot
Are Short Proofs Narrow? QBF Resolution Is Not So Simple
inferred← citeshttps://doi.org/10.1145/3352155openalex-snapshot
New Resolution-Based QBF Calculi and Their Proof Complexity
inferred← citeshttps://doi.org/10.5555/1899721.1899902openalex-snapshot
Optimizing blocks in an SoC using symbolic code-statement reachability analysis
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.