On the public citation graph

Maximal Input Reduction of Sequential Netlists via Synergistic Reparameterization and Localization Strategies

0 signed · 49 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/10722167_12openalex-snapshot
Building Circuits from Relations
inferredcites →https://doi.org/10.1007/3-540-36126-x_3openalex-snapshot
Automated Abstraction Refinement for Model Checking Large State Spaces Using SAT Based Conflict Analysis
inferredcites →https://doi.org/10.1007/3-540-36126-x_4openalex-snapshot
Simplifying Circuits for Formal Verification Using Parametric Representation
inferredcites →https://doi.org/10.1007/3-540-44585-4_10openalex-snapshot
Transformation-Based Verification Using Generalized Retiming
inferredcites →https://doi.org/10.1007/3-540-45657-0_12openalex-snapshot
Property Checking via Structural Analysis
inferredcites →https://doi.org/10.1007/3-540-45657-0_20openalex-snapshot
SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques
inferredcites →https://doi.org/10.1007/3-540-46002-0_22openalex-snapshot
Fine-Grain Conjunction Scheduling for Symbolic Reachability Analysis
inferredcites →https://doi.org/10.1007/3-540-48153-2openalex-snapshot
Correct Hardware Design and Verification Methods
inferredcites →https://doi.org/10.1007/3-540-48153-2_29openalex-snapshot
Bisimulation and Model Checking
inferredcites →https://doi.org/10.1007/3-540-49519-3_20openalex-snapshot
Input Elimination and Abstraction in Model Checking
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_15openalex-snapshot
Maximal Flow Through a Network
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_35openalex-snapshot
A Temporal Logic of Nested Calls and Returns
inferredcites →https://doi.org/10.1007/978-3-540-30494-4_12openalex-snapshot
Scalable Automated Verification via Expert-System Guided Transformations
inferredcites →https://doi.org/10.1007/978-3-540-30494-4_17openalex-snapshot
Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reachable States
inferredcites →https://doi.org/10.1007/bf01759032openalex-snapshot
Retiming synchronous circuitry
inferredcites →https://doi.org/10.1023/a:1024485130001openalex-snapshot
An Abstraction Algorithm for the Verification of Level-Sensitive Latch-Based Netlists
inferredcites →https://doi.org/10.1109/43.298036openalex-snapshot
Efficient symbolic simulation-based verification using the parametric form of Boolean expressions
inferredcites →https://doi.org/10.1109/date.1998.655922openalex-snapshot
Sequential equivalence checking without state space traversal
inferredcites →https://doi.org/10.1109/iccad.2003.1257811openalex-snapshot
Iterative abstraction using SAT-based BMC with proof analysis
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.1145/1065579.1065700openalex-snapshot
Exploiting suspected redundancy without proving it
inferredcites →https://doi.org/10.1145/177492.177725openalex-snapshot
Model checking and modular verification
inferredcites →https://doi.org/10.1145/309847.309968openalex-snapshot
Formal verification using parametric representations of Boolean constraints
inferredcites →https://doi.org/10.1145/378239.378260openalex-snapshot
Formal property verification by abstraction refinement with formal, simulation and hybrid engines
inferredcites →https://doi.org/10.1145/513918.513946openalex-snapshot
Efficient state representation for symbolic simulation
inferredcites →https://doi.org/10.1145/996566.996711openalex-snapshot
A SAT-based algorithm for reparameterization in symbolic simulation
inferredcites →https://doi.org/10.4153/cjm-1956-045-5openalex-snapshot
Maximal Flow Through a Network
inferredcites →https://doi.org/10.5555/368058.368314openalex-snapshot
Sequential equivalence checking without state space traversal
inferredcites →https://doi.org/10.5555/996070.1009924openalex-snapshot
Iterative Abstraction using SAT-based BMC with Proof Analysis

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11560548_11openalex-snapshot
Efficient Symbolic Simulation via Dynamic Scheduling, Don’t Caring, and Case Splitting
inferred← citeshttps://doi.org/10.1007/11560548_21openalex-snapshot
Exploiting Constraints in Transformation-Based Verification
inferred← citeshttps://doi.org/10.1109/date.2007.364594openalex-snapshot
Formal Verification of a Pervasive Interconnect Bus System in a High-Performance Microprocessor
inferred← citeshttps://doi.org/10.1109/date.2009.5090933openalex-snapshot
Scalable liveness checking via property-preserving transformations
inferred← citeshttps://doi.org/10.1109/fmcad.2006.12openalex-snapshot
Enabling Large-Scale Pervasive Logic Verification through Multi-Algorithmic Formal Reasoning
inferred← citeshttps://doi.org/10.1109/fmcad.2008.ecp.6openalex-snapshot
Invariant-Strengthened Elimination of Dependent State Elements
inferred← citeshttps://doi.org/10.1109/hldvt.2006.319985openalex-snapshot
Practical Issues in Sequential Equivalence Checking through Alignability: Handling Don't Cares and Generating Debug Traces
inferred← citeshttps://doi.org/10.1109/iccad.2005.1560218openalex-snapshot
Scalable compositional minimization via static analysis
inferred← citeshttps://doi.org/10.1109/iccd.2006.4380826openalex-snapshot
Scalable Sequential Equivalence Checking across Arbitrary Design Transformations
inferred← citeshttps://doi.org/10.1109/tcad.2008.2006088openalex-snapshot
An Implicit Approach to Minimizing Range-Equivalent Circuits
inferred← citeshttps://doi.org/10.1109/vlsid.2014.20openalex-snapshot
Effective Liveness Verification Using a Transformation-Based Framework
inferred← citeshttps://doi.org/10.1145/3152910openalex-snapshot
Global and Local Deadlock Freedom in BIP
inferred← citeshttps://doi.org/10.23919/fmcad.2019.8894294openalex-snapshot
Input Elimination Transformations for Scalable Verification and Trace Reconstruction
inferred← citeshttps://doi.org/10.31274/etd-20210114-39openalex-snapshot
Model checking large design spaces: Theory, tools, and experiments
inferred← citeshttps://doi.org/10.34727/2020/isbn.978-3-85448-042-6_8openalex-snapshot
Accelerating Parallel Verification via Complementary Property Partitioning and Strategy Exploration
inferred← citeshttps://doi.org/10.5555/1129601.1129749openalex-snapshot
Scalable compositional minimization via static analysis
inferred← citeshttps://doi.org/10.5555/1266366.1266413openalex-snapshot
Formal verification of a pervasive interconnect bus system in a high-performance microprocessor
inferred← citeshttps://doi.org/10.5555/1874620.1875021openalex-snapshot
Scalable liveness checking via property-preserving transformations
inferred← citeshttps://doi.org/10.5555/2157654.2157672openalex-snapshot
Optimal redundancy removal without fixedpoint computation
inferred← citeshttps://doi.org/10.7873/date.2013.286openalex-snapshot
GLA: Gate-Level Abstraction Revisited
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.