On the public citation graph

Seqver : A Sequential Equivalence Verifier for Hardware Designs

0 signed · 28 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/0-387-31005-3openalex-snapshot
Logic Synthesis and Verification Algorithms
inferredcites →https://doi.org/10.1007/3-540-40922-x_8openalex-snapshot
Checking Safety Properties Using Induction and a SAT-Solver
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-52148-8_30openalex-snapshot
Verification of synchronous sequential machines based on symbolic execution
inferredcites →https://doi.org/10.1007/b117060openalex-snapshot
Logic Synthesis and Verification Algorithms
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1017/cbo9780511816239openalex-snapshot
Switching and Finite Automata Theory
inferredcites →https://doi.org/10.1109/12.481483openalex-snapshot
On removing redundancies from synchronous sequential circuits with synchronizing sequences
inferredcites →https://doi.org/10.1109/43.180261openalex-snapshot
A theory and implementation of sequential hardware equivalence
inferredcites →https://doi.org/10.1109/43.298038openalex-snapshot
Exact calculation of synchronizing sequences based on binary decision diagrams
inferredcites →https://doi.org/10.1109/fmcad.2006.25openalex-snapshot
Post-reboot Equivalence and Compositional Verification of Hardware
inferredcites →https://doi.org/10.1109/hldvt.2002.1224438openalex-snapshot
Alignability equivalence of synchronous sequential circuits
inferredcites →https://doi.org/10.1109/iccad.2004.1382543openalex-snapshot
Theoretical framework for compositional sequential hardware equivalence verification in presence of design constraints
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1145/309847.309942openalex-snapshot
Symbolic model checking using SAT procedures instead of BDDs
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving

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-540-79709-8_3openalex-snapshot
On Formal Equivalence Verification of Hardware
inferred← citeshttps://doi.org/10.1007/978-3-642-04761-9_25openalex-snapshot
Formal Verification for High-Assurance Behavioral Synthesis
inferred← citeshttps://doi.org/10.1109/date.2010.5457049openalex-snapshot
Optimizing equivalence checking for behavioral synthesis
inferred← citeshttps://doi.org/10.1109/famcad.2007.37openalex-snapshot
Industrial Strength SAT-based Alignability Algorithm for Hardware Equivalence Verification
inferred← citeshttps://doi.org/10.1109/fmcad.2009.5351129openalex-snapshot
A compositional theory for post-reboot observational equivalence checking of hardware
inferred← citeshttps://doi.org/10.1109/fmcad.2009.5351132openalex-snapshot
Verifying equivalence of memories using a first order logic theorem prover
inferred← citeshttps://doi.org/10.15760/etd.1041openalex-snapshot
Developing a Strategic Policy Choice Framework for Technological Innovation: Case of Chinese Pharmaceuticals
inferred← citeshttps://doi.org/10.15760/etd.1066openalex-snapshot
Equivalence Checking for High-Assurance Behavioral Synthesis
inferred← citeshttps://doi.org/10.15760/etd.3356openalex-snapshot
Certifying Loop Pipelining Transformations in Behavioral Synthesis
inferred← citeshttps://doi.org/10.15760/etd.5364openalex-snapshot
Certifying Loop Pipelining Transformations in Behavioral Synthesis
inferred← citeshttps://doi.org/10.5555/1870926.1871290openalex-snapshot
Optimizing equivalence checking for behavioral synthesis
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.