On the public citation graph
Prioritized Traversal: Efficient Reachability Analysis for Verification and Falsification
0 signed · 50 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-63166-6_37openalex-snapshot
On combining formal and informal verification
inferredcites →https://doi.org/10.1007/978-1-4615-0292-0_4openalex-snapshot
A Unified Framework for the Formal Verification of Sequential Circuits
inferredcites →https://doi.org/10.1007/bfb0028744openalex-snapshot
On-the-fly model checking of RCTL formulas
inferredcites →https://doi.org/10.1016/s1571-0661(04)80665-0openalex-snapshot
Evaluating Semi-Exhaustive Verification Techniques for Bug Hunting
inferredcites →https://doi.org/10.1109/43.275352openalex-snapshot
Symbolic model checking for sequential circuit verification
inferredcites →https://doi.org/10.1109/43.759068openalex-snapshot
Improving the efficiency of BDD-based operators by means of partitioning
inferredcites →https://doi.org/10.1109/iccad.1990.129859openalex-snapshot
A unified framework for the formal verification of sequential circuits
inferredcites →https://doi.org/10.1109/iccad.1995.480006openalex-snapshot
High-density reachability analysis
inferredcites →https://doi.org/10.1109/iccad.1996.569819openalex-snapshot
Improved reachability analysis of large finite state machines
inferredcites →https://doi.org/10.1109/iccad.1996.569909openalex-snapshot
Partitioned ROBDDs-a compact, canonical and efficiently manipulable representation for Boolean functions
inferredcites →https://doi.org/10.1109/iccd.1991.139995openalex-snapshot
Implicit manipulation of equivalence classes using binary decision diagrams
inferredcites →https://doi.org/10.1109/iccd.1999.808582openalex-snapshot
Efficient fixpoint computation for invariant checking
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1145/277044.277168openalex-snapshot
Approximation and decomposition of binary decision diagrams
inferredcites →https://doi.org/10.1145/277044.277201openalex-snapshot
Validation with guided search of the state space
inferredcites →https://doi.org/10.1145/277044.277204openalex-snapshot
Hybrid verification using saturated simulation
inferredcites →https://doi.org/10.5555/224841.224874openalex-snapshot
High-density reachability analysis
inferredcites →https://doi.org/10.5555/244522.244894openalex-snapshot
Partitioned ROBDDs—a compact, canonical and efficiently manipulable representation for Boolean functions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11513988_35openalex-snapshot
Symbolic Systems, Explicit Properties: On Hybrid Approaches for LTL Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/11560548_12openalex-snapshot
Achieving Speedups in Distributed Symbolic Reachability Analysis Through Asynchronous Computation
inferred← citeshttps://doi.org/10.1007/11562436_21openalex-snapshot
Abstraction-Guided Model Checking Using Symbolic IDA* and Heuristic Synthesis
inferred← citeshttps://doi.org/10.1007/11562948_4openalex-snapshot
Verifying Very Large Industrial Circuits Using 100 Processes and Beyond
inferred← citeshttps://doi.org/10.1007/11804192_11openalex-snapshot
Abstraction and Refinement in Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-36577-x_13openalex-snapshot
Multiple-Counterexample Guided Iterative Abstraction Refinement: An Industrial Evaluation
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_43openalex-snapshot
Benefits of Bounded Model Checking at an Industrial Setting
inferred← citeshttps://doi.org/10.1007/3-540-44798-9_23openalex-snapshot
Efficient Debugging in a Formal Verification Environment
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_38openalex-snapshot
Mixing Forward and Backward Traversals in Guided-Prioritized BDD-Based Verification
inferred← citeshttps://doi.org/10.1007/3-540-45988-x_5openalex-snapshot
Integrating BDD-Based and SAT-Based Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_18openalex-snapshot
GSTE Is Partitioned Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_35openalex-snapshot
Enhanced Vacuity Detection in Linear Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-69850-0_8openalex-snapshot
Fifteen Years of Formal Property Verification in Intel
inferred← citeshttps://doi.org/10.1007/978-3-642-00431-5_5openalex-snapshot
Survey on Directed Model Checking
inferred← citeshttps://doi.org/10.1007/978-981-32-9767-8_35openalex-snapshot
Identification of Effective Guidance Hints for Better Design Debugging by Formal Methods
inferred← citeshttps://doi.org/10.1007/s10009-004-0172-7openalex-snapshot
Are BDDs still alive within sequential verification?
inferred← citeshttps://doi.org/10.1007/s10009-010-0168-4openalex-snapshot
Symbolic systems, explicit properties: on hybrid approaches for LTL symbolic model checking
inferred← citeshttps://doi.org/10.1007/s10703-005-2246-xopenalex-snapshot
Combining Symmetry Reduction and Under-Approximation for Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/s10703-007-0036-3openalex-snapshot
GSTE is partitioned model checking
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.07.025openalex-snapshot
Language-Emptiness Checking of Alternating Tree Automata Using Symbolic Reachability Analysis
inferred← citeshttps://doi.org/10.1023/a:1020373206491openalex-snapshot
A Scalable Parallel Algorithm for Reachability Analysis of Very Large Circuits
inferred← citeshttps://doi.org/10.1109/hldvt.2004.1431221openalex-snapshot
Reference model based RTL verification: an integrated approach
inferred← citeshttps://doi.org/10.1109/iccad.2006.320120openalex-snapshot
Decomposing Image Computation for Symbolic Reachability Analysis Using Control Flow Information
inferred← citeshttps://doi.org/10.1145/1233501.1233662openalex-snapshot
Decomposing image computation for symbolic reachability analysis using control flow information
inferred← citeshttps://doi.org/10.1145/775832.775834openalex-snapshot
High level formal verification of next-generation microprocessors
inferred← citeshttps://doi.org/10.5555/1998496.1998505openalex-snapshot
SAT-based semiformal verification of hardware
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.