On the public citation graph
SAT-Based Complete Don't-Care Computation for Network Optimization
0 signed · 113 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.1007/3-540-45657-0_19openalex-snapshot
Applying SAT Methods in Unbounded Symbolic Model Checking
inferredcites →https://doi.org/10.1007/978-1-4615-0292-0_6openalex-snapshot
Verification of Large Synthesized Designs
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_37openalex-snapshot
An Extensible SAT-solver
inferredcites →https://doi.org/10.1109/12.769433openalex-snapshot
GRASP: a search algorithm for propositional satisfiability
inferredcites →https://doi.org/10.1109/dac.2001.935565openalex-snapshot
Chaff: engineering an efficient SAT solver
inferredcites →https://doi.org/10.1109/date.2001.915010openalex-snapshot
Using SAT for combinational equivalence checking
inferredcites →https://doi.org/10.1109/date.2003.1253719openalex-snapshot
A circuit SAT solver with signal correlation guided learning
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.1993.580110openalex-snapshot
Verification of large synthesized designs
inferredcites →https://doi.org/10.1109/iccad.2001.968725openalex-snapshot
Compatible observability don't cares revisited
inferredcites →https://doi.org/10.1109/iccad.2002.1167587openalex-snapshot
Simplification of non-deterministic multi-valued networks
inferredcites →https://doi.org/10.1109/iccad.2003.1257887openalex-snapshot
A theory of non-deterministic networks
inferredcites →https://doi.org/10.1109/tcad.2002.804386openalex-snapshot
Robust Boolean reasoning for equivalence checking and functional property verification
inferredcites →https://doi.org/10.1109/tcad.2005.855978openalex-snapshot
A theory of nondeterministic networks
inferredcites →https://doi.org/10.1145/123186.123280openalex-snapshot
The use of observability and external don't cares for the simplification of multi-level networks
inferredcites →https://doi.org/10.1145/774572.774654openalex-snapshot
Simplification of non-deterministic multi-valued networks
inferredcites →https://doi.org/10.1145/775832.775871openalex-snapshot
A new enhanced constructive decomposition and mapping algorithm
inferredcites →https://doi.org/10.1145/775870.775871openalex-snapshot
A new enhanced constructive decomposition and mapping algorithm
inferredcites →https://doi.org/10.1145/996566.996688openalex-snapshot
A robust algorithm for approximate compatible observability don't care (CODC) computation
inferredcites →https://doi.org/10.5555/259794.259883openalex-snapshot
Verification of large synthesized designs
inferredcites →https://doi.org/10.5555/367072.367111openalex-snapshot
Using SAT for combinational equivalence checking
inferredcites →https://doi.org/10.5555/602902.603019openalex-snapshot
Don't cares and multi-valued logic network minimization
inferredcites →https://doi.org/10.5555/603095.603221openalex-snapshot
Compatible observability don't cares revisited
inferredcites →https://doi.org/10.5555/789083.1022837openalex-snapshot
A Circuit SAT Solver With Signal Correlation Guided Learning
inferredcites →https://doi.org/10.5555/996070.1009966openalex-snapshot
A Theory of Non-Deterministic Networks
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-1-4419-7518-8_17openalex-snapshot
A Robust Window-Based Multi-node Minimization Technique Using Boolean Relations
inferred← citeshttps://doi.org/10.1007/978-1-4419-7518-8_8openalex-snapshot
SAT Sweeping with Local Observability Don’t-Cares
inferred← citeshttps://doi.org/10.1007/978-3-031-83093-8_9openalex-snapshot
Netlist Optimization Using Formal Methods Under External Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-67295-3_8openalex-snapshot
Progressive Generation of Canonical Irredundant Sums of Products Using a SAT Solver
inferred← citeshttps://doi.org/10.1007/978-3-642-40349-1_17openalex-snapshot
Sleuth: Automated Verification of Software Power Analysis Countermeasures
inferred← citeshttps://doi.org/10.1007/s10703-015-0229-0openalex-snapshot
Optimization techniques for craig interpolant compaction in unbounded model checking
inferred← citeshttps://doi.org/10.1007/s10836-010-5144-0openalex-snapshot
Finding Multiple Equivalence-Preserving Transformations in Combinational Circuits through Incremental-SAT
inferred← citeshttps://doi.org/10.1109/aqtr.2018.8402703openalex-snapshot
Detection of hard-to-detect stuck-at faults and generation of their tests based on testability functions
inferred← citeshttps://doi.org/10.1109/asicon.2009.5351304openalex-snapshot
Power-efficient and fault-tolerant circuits and systems
inferred← citeshttps://doi.org/10.1109/asp-dac58780.2024.10473816openalex-snapshot
Transduction Method for AIG Minimization
inferred← citeshttps://doi.org/10.1109/asp-dac58780.2024.10473925openalex-snapshot
LSTP: A Logic Synthesis Timing Predictor
inferred← citeshttps://doi.org/10.1109/aspdac.2007.358021openalex-snapshot
Node Mergers in the Presence of Don't Cares
inferred← citeshttps://doi.org/10.1109/aspdac.2007.358056openalex-snapshot
Safe Delay Optimization for Physical Synthesis
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/dac.2006.229206openalex-snapshot
SAT sweeping with local observability don't-cares
inferred← citeshttps://doi.org/10.1109/dac.2006.229287openalex-snapshot
DAG-aware AIG rewriting: a fresh look at combinational logic synthesis
inferred← citeshttps://doi.org/10.1109/dac18072.2020.9218536openalex-snapshot
Probabilistic Error Propagation through Approximated Boolean Networks
inferred← citeshttps://doi.org/10.1109/dac18072.2020.9218627openalex-snapshot
ALSRAC: Approximate Logic Synthesis by Resubstitution with Approximate Care Set
inferred← citeshttps://doi.org/10.1109/dac63849.2025.11133204openalex-snapshot
Simulation-based Parallel Sweeping: A New Perspective on Combinational Equivalence Checking
inferred← citeshttps://doi.org/10.1109/eurosp.2016.15openalex-snapshot
Precisely Measuring Quantitative Information Flow: 10K Lines of Code and Beyond
inferred← citeshttps://doi.org/10.1109/ewdts50664.2020.9225031openalex-snapshot
Optimizing Components of Multi-Module Systems Based on don’t Care Input Sequences
inferred← citeshttps://doi.org/10.1109/ewdts52692.2021.9580991openalex-snapshot
FSM-based Sequential Circuits Optimization by Changing Initial State of Specification
inferred← citeshttps://doi.org/10.1109/ewdts52692.2021.9580995openalex-snapshot
Optimizing Components of Finite State Machines Composition Based on Don’t Care Input Sequences in Hardware Implementation
inferred← citeshttps://doi.org/10.1109/fmcad.2008.ecp.7openalex-snapshot
Optimal Constraint-Preserving Netlist Simplification
inferred← citeshttps://doi.org/10.1109/fmcad.2009.5351118openalex-snapshot
SAT-based synthesis of clock gating functions using 3-valued abstraction
inferred← citeshttps://doi.org/10.1109/fmcad.2009.5351131openalex-snapshot
Scalable conditional equivalence checking: An automated invariant-generation based approach
inferred← citeshttps://doi.org/10.1109/fmcad.2016.7886657openalex-snapshot
Reducing interpolant circuit size by ad-hoc logic synthesis and SAT-based weakening
inferred← citeshttps://doi.org/10.1109/fpl.2011.95openalex-snapshot
IPF: In-Place X-Filling to Mitigate Soft Errors in SRAM-Based FPGAs
inferred← citeshttps://doi.org/10.1109/hldvt.2009.5340177openalex-snapshot
Exploiting incrementality in SAT-based search for multiple equivalence-preserving transformations in combinational circuits
inferred← citeshttps://doi.org/10.1109/iccad.2007.4397270openalex-snapshot
Scalable exploration of functional dependency by interpolation and incremental SAT solving
inferred← citeshttps://doi.org/10.1109/iccad.2008.4681654openalex-snapshot
Robust FPGA resynthesis based on fault-tolerant Boolean matching
inferred← citeshttps://doi.org/10.1109/iccad.2014.7001375openalex-snapshot
ICCAD-2014 CAD contest in simultaneous CNF encoder optimization with SAT solver setting selection and benchmark suite: Special session paper: CAD contest
inferred← citeshttps://doi.org/10.1109/iccad45719.2019.8942137openalex-snapshot
2019 CAD Contest: Logic Regression on High Dimensional Boolean Space
inferred← citeshttps://doi.org/10.1109/iolts.2011.5994537openalex-snapshot
A robust algorithm for pessimistic analysis of logic masking effects in combinational circuits
inferred← citeshttps://doi.org/10.1109/iscas.2006.1692903openalex-snapshot
Integrating Observability Don't Cares in All-Solution SAT Solvers
inferred← citeshttps://doi.org/10.1109/iseda62518.2024.10617946openalex-snapshot
Multiplication Complexity Optimization based on Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.1109/islped.2011.5993599openalex-snapshot
FPGA glitch power analysis and reduction
inferred← citeshttps://doi.org/10.1109/jproc.2018.2869760openalex-snapshot
Logic Synthesis for Established and Emerging Computing
inferred← citeshttps://doi.org/10.1109/mlcad65511.2025.11189141openalex-snapshot
Recurrent CircuitSAT Sampling for Sequential Circuits
inferred← citeshttps://doi.org/10.1109/mtv.2008.23openalex-snapshot
Mining Unreachable Cross-Timeframe State-Pairs for Bounded Sequential Equivalence Checking
inferred← citeshttps://doi.org/10.1109/sibcon.2019.8729643openalex-snapshot
Construction of Permissible Functions and their Application for Fault Tolerance
inferred← citeshttps://doi.org/10.1109/sibcon50419.2021.9438879openalex-snapshot
BDD and DNF Based Algorithms for Constructing All Testability Functions of Combinational Circuit
inferred← citeshttps://doi.org/10.1109/tc.2010.12openalex-snapshot
To SAT or Not to SAT: Scalable Exploration of Functional Dependency
inferred← citeshttps://doi.org/10.1109/tcad.2005.855978openalex-snapshot
A theory of nondeterministic networks
inferred← citeshttps://doi.org/10.1109/tcad.2005.860955openalex-snapshot
Using simulation and satisfiability to compute flexibilities in Boolean networks
inferred← citeshttps://doi.org/10.1109/tcad.2011.2120950openalex-snapshot
Effective Robustness Analysis Using Bounded Model Checking Techniques
inferred← citeshttps://doi.org/10.1109/tcad.2015.2481860openalex-snapshot
${m}$ -Inductive Property of Sequential Circuits
inferred← citeshttps://doi.org/10.1109/tcad.2018.2791465openalex-snapshot
SAT-Based Fault Equivalence Checking in Functional Safety Verification
inferred← citeshttps://doi.org/10.1109/tcad.2018.2808229openalex-snapshot
Logic Synthesis for Interpolant Circuit Compaction
inferred← citeshttps://doi.org/10.1109/tcad.2019.2915328openalex-snapshot
ALFANS: Multilevel Approximate Logic Synthesis Framework by Approximate Node Simplification
inferred← citeshttps://doi.org/10.1109/tcad.2019.2946254openalex-snapshot
Parallel Combinational Equivalence Checking
inferred← citeshttps://doi.org/10.1109/tcad.2021.3108704openalex-snapshot
A Simulation-Guided Paradigm for Logic Synthesis and Verification
inferred← citeshttps://doi.org/10.1109/tcad.2022.3147444openalex-snapshot
A Don’t-Care-Based Approach to Reducing the Multiplicative Complexity in Logic Networks
inferred← citeshttps://doi.org/10.1109/tcad.2026.3661840openalex-snapshot
Simulation-Based Combinational Equivalence Checking With Multiple GPUs
inferred← citeshttps://doi.org/10.1109/test.2009.5355713openalex-snapshot
Speeding up bounded sequential equivalence checking with cross-timeframe state-pair constraints from data learning
inferred← citeshttps://doi.org/10.1109/tr.2015.2440234openalex-snapshot
Simulation-Based Method for Synthesizing Soft Error Tolerant Combinational Circuits
inferred← citeshttps://doi.org/10.1145/1146909.1146970openalex-snapshot
SAT sweeping with local observability don't-cares
inferred← citeshttps://doi.org/10.1145/1146909.1147048openalex-snapshot
DAG-aware AIG rewriting a fresh look at combinational logic synthesis
inferred← citeshttps://doi.org/10.1145/1216919.1216944openalex-snapshot
Improved SAT-based Boolean matching using implicants for LUT-based FPGAs
inferred← citeshttps://doi.org/10.1145/1391469.1391478openalex-snapshot
FPGA area reduction by multi-output function based sequential resynthesis
inferred← citeshttps://doi.org/10.1145/1508128.1508152openalex-snapshot
Scalable don't-care-based logic optimization and resynthesis
inferred← citeshttps://doi.org/10.1145/1531542.1531623openalex-snapshot
Robust window-based multi-node technology-independent logic minimization
inferred← citeshttps://doi.org/10.1145/1629911.1630019openalex-snapshot
Handling don't-care conditions in high-level synthesis and application for reducing initialized registers
inferred← citeshttps://doi.org/10.1145/1837274.1837401openalex-snapshot
LUT-based FPGA technology mapping for reliability
inferred← citeshttps://doi.org/10.1145/2068716.2068720openalex-snapshot
Scalable don't-care-based logic optimization and resynthesis
inferred← citeshttps://doi.org/10.1145/2228360.2228507openalex-snapshot
Generalized SAT-sweeping for post-mapping optimization
inferred← citeshttps://doi.org/10.1145/2897937.2897982openalex-snapshot
An efficient method for multi-level approximate logic synthesis under error rate constraint
inferred← citeshttps://doi.org/10.1145/3658617.3697720openalex-snapshot
High-Effort Logic Synthesis Using Randomized Transduction
inferred← citeshttps://doi.org/10.1145/3658617.3697760openalex-snapshot
DEMOTIC: A Differentiable Sampler for Multi-Level Digital Circuits
inferred← citeshttps://doi.org/10.1609/aaai.v37i4.25524openalex-snapshot
Circuit Minimization with QBF-Based Exact Synthesis
inferred← citeshttps://doi.org/10.2197/ipsjtsldm.5.55openalex-snapshot
A Robust Algorithm for Pessimistic Analysis of Logic Masking Effects in Combinational Circuits
inferred← citeshttps://doi.org/10.23919/date58400.2024.10546556openalex-snapshot
Using Formal Verification Methods for Optimization of Circuits Under External Constraints
inferred← citeshttps://doi.org/10.31114/2078-7707-2018-1-50-56openalex-snapshot
Development of Resynthesis Flow for Improving Logical Masking Features of Combinational Circuits
inferred← citeshttps://doi.org/10.3233/sat190050openalex-snapshot
Improved SAT-based Reachability Analysis with Observability Don’t Cares
inferred← citeshttps://doi.org/10.3390/a17060253openalex-snapshot
Hardware Model Checking Algorithms and Techniques
inferred← citeshttps://doi.org/10.3390/cryptography7040061openalex-snapshot
Garbled Circuits Reimagined: Logic Synthesis Unleashes Efficient Secure Computation
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.713-715.1127openalex-snapshot
Reliability Oriented Selective Triple Modular Redundancy for SRAM-Based FPGAs
inferred← citeshttps://doi.org/10.48550/arxiv.2007.02579openalex-snapshot
Simulation-Guided Boolean Resubstitution
inferred← citeshttps://doi.org/10.5555/1326073.1326120openalex-snapshot
Scalable exploration of functional dependency by interpolation and incremental SAT solving
inferred← citeshttps://doi.org/10.5555/1509456.1509611openalex-snapshot
Robust FPGA resynthesis based on fault-tolerant Boolean matching
inferred← citeshttps://doi.org/10.5555/1899721.1899902openalex-snapshot
Optimizing blocks in an SoC using symbolic code-statement reachability analysis
inferred← citeshttps://doi.org/10.5555/2016802.2016811openalex-snapshot
FPGA glitch power analysis and reduction
inferred← citeshttps://doi.org/10.5555/2691365.2691437openalex-snapshot
ICCAD-2014 CAD contest in simultaneous CNF encoder optimization with SAT solver setting selection and benchmark suite
inferred← citeshttps://doi.org/10.5555/996070.1009966openalex-snapshot
A Theory of Non-Deterministic Networks
inferred← citeshttps://doi.org/10.5821/dissertation-2117-130006openalex-snapshot
Logic decomposition and adaptive clocking for the optimization of digital circuits
showing the first 86 of 87 · page through all 87
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.