On the public citation graph
Building Circuits from Relations
0 signed · 61 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-48683-6_34openalex-snapshot
Efficient Analysis of Cyclic Definitions
inferredcites →https://doi.org/10.1007/3-540-48683-6_36openalex-snapshot
Model Checking Based on Sequential ATPG
inferredcites →https://doi.org/10.1007/3-540-49059-0_14openalex-snapshot
Symbolic Model Checking without BDDs
inferredcites →https://doi.org/10.1007/3-540-49519-3_30openalex-snapshot
Techniques for Implicit State Enumeration of EFSMs
inferredcites →https://doi.org/10.1007/bf01383945openalex-snapshot
Gate-delay-fault testability properties of multiplexor-based networks
inferredcites →https://doi.org/10.1016/0167-9260(93)90002-topenalex-snapshot
Path-delay-fault testability properties of multiplexor-based networks
inferredcites →https://doi.org/10.1109/12.324545openalex-snapshot
Efficient Boolean manipulation with OBDD's can be extended to FBDD's
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/43.503942openalex-snapshot
Permissible functions for multioutput components in combinational logic optimization
inferredcites →https://doi.org/10.1109/iccad.1991.185307openalex-snapshot
Minimization of binary decision diagrams based on exchanges of variables
inferredcites →https://doi.org/10.1109/iccad.1993.580029openalex-snapshot
Dynamic variable ordering for ordered binary decision diagrams
inferredcites →https://doi.org/10.1109/iccad.1999.810715openalex-snapshot
Modeling design constraints and biasing in simulation using BDDs
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1145/123186.123222openalex-snapshot
Efficient implementation of a BDD package
inferredcites →https://doi.org/10.1145/309847.309966openalex-snapshot
Cycle-based symbolic simulation of gate-level synchronous circuits
inferredcites →https://doi.org/10.1145/309847.309968openalex-snapshot
Formal verification using parametric representations of Boolean constraints
inferredcites →https://doi.org/10.21236/ada360973openalex-snapshot
Symbolic Model Checking without BDDs
inferredcites →https://doi.org/10.5555/259794.259802openalex-snapshot
Dynamic variable ordering for ordered 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/11560548_18openalex-snapshot
Maximal Input Reduction of Sequential Netlists via Synergistic Reparameterization and Localization Strategies
inferred← citeshttps://doi.org/10.1007/3-540-36126-x_4openalex-snapshot
Simplifying Circuits for Formal Verification Using Parametric Representation
inferred← citeshttps://doi.org/10.1007/978-1-4419-7518-8_16openalex-snapshot
Extracting Functions from Boolean Relations Using SAT and Interpolation
inferred← citeshttps://doi.org/10.1007/978-3-030-11245-5_5openalex-snapshot
Lazy but Effective Functional Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-030-91265-9_15openalex-snapshot
ESampler: Efficient Sampling of Satisfying Assignments for Boolean Formulas
inferred← citeshttps://doi.org/10.1007/978-3-319-41540-6_22openalex-snapshot
BDD-Based Boolean Functional Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-540-73368-3_29openalex-snapshot
Anzu: A Tool for Property Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-662-54577-5_19openalex-snapshot
Towards Parallel Boolean Functional Synthesis
inferred← citeshttps://doi.org/10.1007/978-81-322-1812-8_51-1openalex-snapshot
Synthesizing Skolem Functions: A View from Theory and Practice
inferred← citeshttps://doi.org/10.1007/978-81-322-2577-5_51openalex-snapshot
Synthesizing Skolem Functions: A View from Theory and Practice
inferred← citeshttps://doi.org/10.1007/s10009-011-0217-7openalex-snapshot
Functional synthesis for linear arithmetic and sets
inferred← citeshttps://doi.org/10.1007/s10703-023-00410-5openalex-snapshot
Functional synthesis via input–output separation
inferred← citeshttps://doi.org/10.1007/s10836-010-5143-1openalex-snapshot
Learning from Constraints for Formal Property Checking
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.09.004openalex-snapshot
Specify, Compile, Run: Hardware from PSL
inferred← citeshttps://doi.org/10.1016/j.sysarc.2022.102615openalex-snapshot
ESampler: Boosting sampling of satisfying assignments for Boolean formulas via derivation
inferred← citeshttps://doi.org/10.1109/aspdac.2005.1466517openalex-snapshot
Supporting sequential assumptions in hybrid verification
inferred← citeshttps://doi.org/10.1109/cscwd.2009.4968035openalex-snapshot
Random stimulus generation with self-tuning
inferred← citeshttps://doi.org/10.1109/dac.2003.1219012openalex-snapshot
Constraint synthesis for environment modeling in functional verification
inferred← citeshttps://doi.org/10.1109/date.2007.364456openalex-snapshot
Automatic Hardware Synthesis from Specifications: A Case Study
inferred← citeshttps://doi.org/10.1109/hldvt.2009.5340176openalex-snapshot
Learning from constraints for formal property checking
inferred← citeshttps://doi.org/10.1109/iccad.2002.1167583openalex-snapshot
Combinational equivalence checking through function transformation
inferred← citeshttps://doi.org/10.1109/iccad.2003.159683openalex-snapshot
A framework for constrained functional verification
inferred← citeshttps://doi.org/10.1109/iccad.2003.159684openalex-snapshot
Generator-based verification
inferred← citeshttps://doi.org/10.1109/iccad.2005.1560218openalex-snapshot
Scalable compositional minimization via static analysis
inferred← citeshttps://doi.org/10.1109/iccad.2007.4397275openalex-snapshot
Stimulus generation for constrained random simulation
inferred← citeshttps://doi.org/10.1109/iccad51958.2021.9643583openalex-snapshot
Engineering an Efficient Boolean Functional Synthesis Engine
inferred← citeshttps://doi.org/10.1109/jproc.2015.2480891openalex-snapshot
Application of a Key–Value Paradigm to Logic Factoring
inferred← citeshttps://doi.org/10.1109/mdt.2002.1018138openalex-snapshot
Using formal specifications for functional validation of hardware designs
inferred← citeshttps://doi.org/10.1109/tcad.2008.2006088openalex-snapshot
An Implicit Approach to Minimizing Range-Equivalent Circuits
inferred← citeshttps://doi.org/10.1109/tse.2024.3419919openalex-snapshot
A Scalable t-Wise Coverage Estimator: Algorithms and Applications
inferred← citeshttps://doi.org/10.1145/2593069.2593097openalex-snapshot
Balancing Scalability and Uniformity in SAT Witness Generator
inferred← citeshttps://doi.org/10.1145/3510003.3510218openalex-snapshot
A scalable t-wise coverage estimator
inferred← citeshttps://doi.org/10.23919/fmcad.2017.8102250openalex-snapshot
Factored boolean functional synthesis
inferred← citeshttps://doi.org/10.23919/fmcad.2018.8603000openalex-snapshot
Functional Synthesis via Input-Output Separation
inferred← citeshttps://doi.org/10.29007/h4p9openalex-snapshot
Knowledge Compilation meets Uniform Sampling
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.