On the public citation graph

Exploiting Constraints in Transformation-Based Verification

0 signed · 32 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_5openalex-snapshot
An Abstraction Algorithm for the Verification of Generalized C-Slow Designs
inferredcites →https://doi.org/10.1007/11560548_18openalex-snapshot
Maximal Input Reduction of Sequential Netlists via Synergistic Reparameterization and Localization Strategies
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-36577-x_2openalex-snapshot
Automatic Abstraction without Counterexamples
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-48153-2openalex-snapshot
Correct Hardware Design and Verification Methods
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/bf01759032openalex-snapshot
Retiming synchronous circuitry
inferredcites →https://doi.org/10.1007/bfb0028768openalex-snapshot
Design constraints in symbolic model checking
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.2004.1268842openalex-snapshot
Using counter example guided abstraction refinement to find complex bugs
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/tcad.2002.804386openalex-snapshot
Robust Boolean reasoning for equivalence checking and functional property verification
inferredcites →https://doi.org/10.1109/tools.2001.911754openalex-snapshot
The e language: a fresh separation of concerns
inferredcites →https://doi.org/10.1145/1065579.1065700openalex-snapshot
Exploiting suspected redundancy without proving it
inferredcites →https://doi.org/10.1145/309847.309968openalex-snapshot
Formal verification using parametric representations of Boolean constraints
inferredcites →https://doi.org/10.1145/775832.775909openalex-snapshot
Constraint synthesis for environment modeling in functional verification
inferredcites →https://doi.org/10.5555/968878.969048openalex-snapshot
Using counter example guided abstraction refinement to find complex bugs

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-031-63498-7_17openalex-snapshot
Certifying Phase Abstraction
inferred← citeshttps://doi.org/10.1007/s10836-010-5143-1openalex-snapshot
Learning from Constraints for Formal Property 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/fmcad.2008.ecp.7openalex-snapshot
Optimal Constraint-Preserving Netlist Simplification
inferred← citeshttps://doi.org/10.1109/hldvt.2006.319987openalex-snapshot
IChecker: An Efficient Checker for Inductive Invariants
inferred← citeshttps://doi.org/10.1109/hldvt.2009.5340176openalex-snapshot
Learning from constraints for formal property checking
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/tvlsi.2008.2005311openalex-snapshot
SEChecker: A Sequential Equivalence Checking Framework Based on ${K}$th Invariants
inferred← citeshttps://doi.org/10.5555/1874620.1875022openalex-snapshot
Speeding up model checking by exploiting explicit and hidden verification constraints
inferred← citeshttps://doi.org/10.5555/1998496.1998529openalex-snapshot
Large-scale application of formal verification: from fiction to fact
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.