On the public citation graph

Combining PDR and reverse PDR for hardware model checking

0 signed · 26 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/3-540-45657-0_38openalex-snapshot
Mixing Forward and Backward Traversals in Guided-Prioritized BDD-Based Verification
inferredcites →https://doi.org/10.1007/3-540-49059-0_14openalex-snapshot
Symbolic Model Checking without BDDs
inferredcites →https://doi.org/10.1007/978-3-319-08867-9_17openalex-snapshot
Interpolating Property Directed Reachability
inferredcites →https://doi.org/10.1007/978-3-319-08867-9_55openalex-snapshot
Counterexample to Induction-Guided Abstraction-Refinement (CTIGAR)
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_37openalex-snapshot
An Extensible SAT-solver
inferredcites →https://doi.org/10.1007/978-3-540-30494-4_29openalex-snapshot
Invariant Checking Combining Forward and Backward Traversal
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_1openalex-snapshot
Interpolation and SAT-Based Model Checking
inferredcites →https://doi.org/10.1007/978-3-642-18275-4_7openalex-snapshot
SAT-Based Model Checking without Unrolling
inferredcites →https://doi.org/10.1007/978-3-642-36742-7_22openalex-snapshot
Intertwined Forward-Backward Reachability Analysis Using Interpolants
inferredcites →https://doi.org/10.1109/fmcad.2013.6679405openalex-snapshot
Better generalization in IC3
inferredcites →https://doi.org/10.1109/fmcad.2015.7542254openalex-snapshot
Pushing to the top
inferredcites →https://doi.org/10.1184/r1/6612656openalex-snapshot
Using SAT based image computation for reachability analysis
inferredcites →https://doi.org/10.1613/jair.4231openalex-snapshot
Property Directed Reachability for Automated Planning
inferredcites →https://doi.org/10.21236/ada360973openalex-snapshot
Symbolic Model Checking without BDDs
inferredcites →https://doi.org/10.5555/2157654.2157675openalex-snapshot
Efficient implementation of property directed reachability
inferredcites →https://doi.org/10.5555/2157654.2157676openalex-snapshot
Incremental formal verification of hardware

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-13185-1_12openalex-snapshot
The Lattice-Theoretic Essence of Property Directed Reachability Analysis
inferred← citeshttps://doi.org/10.1007/978-3-031-37703-7_14openalex-snapshot
Searching for i-Good Lemmas to Accelerate Safety Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-031-37703-7_3openalex-snapshot
Exploiting Adjoints in Property Directed Reachability Analysis
inferred← citeshttps://doi.org/10.1007/s10703-026-00496-7openalex-snapshot
Adjointness in property directed reachability analysis
inferred← citeshttps://doi.org/10.1109/dac63849.2025.11132734openalex-snapshot
Leveraging Critical Proof Obligations for Efficient IC3 Verification
inferred← citeshttps://doi.org/10.1109/tcad.2022.3198260openalex-snapshot
Everything You Always Wanted to Know About Generalization of Proof Obligations in PDR
inferred← citeshttps://doi.org/10.1145/3713081.3731743openalex-snapshot
Reversing Programs for Error Reachability Analysis
inferred← citeshttps://doi.org/10.1145/3744916.3787819openalex-snapshot
Accelerating IC3 Verification by Exploiting Unsatisfiable Cores and Satisfying Models
inferred← citeshttps://doi.org/10.21655/ijsi.1673-7288.00302openalex-snapshot
UC-based Approximate Incremental Reachability
inferred← citeshttps://doi.org/10.23919/date.2019.8714819openalex-snapshot
fbPDR: In-depth combination of forward and backward analysis in Property Directed Reachability
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.