On the public citation graph

Achieving Speedups in Distributed Symbolic Reachability Analysis Through Asynchronous Computation

0 signed · 68 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.1006/jpdc.1997.1409openalex-snapshot
Automated Parallelization of Discrete State-Space Generation
inferredcites →https://doi.org/10.1007/10722167_25openalex-snapshot
Induction in Compositional Model Checking
inferredcites →https://doi.org/10.1007/10722167_30openalex-snapshot
Prioritized Traversal: Efficient Reachability Analysis for Verification and Falsification
inferredcites →https://doi.org/10.1007/3-540-40922-x_22openalex-snapshot
SAT-Based Image Computation with Application in Reachability Analysis
inferredcites →https://doi.org/10.1007/3-540-45139-0_13openalex-snapshot
Distributed LTL model-checking in SPIN
inferredcites →https://doi.org/10.1007/3-540-45657-0_19openalex-snapshot
Applying SAT Methods in Unbounded Symbolic Model Checking
inferredcites →https://doi.org/10.1007/3-540-48234-2openalex-snapshot
Theoretical and Practical Aspects of SPIN Model Checking
inferredcites →https://doi.org/10.1007/3-540-48234-2_3openalex-snapshot
Distributed-Memory Model Checking with SPIN
inferredcites →https://doi.org/10.1007/3-540-48683-6_44openalex-snapshot
NuSMV: A New Symbolic Model Verifier
inferredcites →https://doi.org/10.1007/3-540-49519-3_32openalex-snapshot
BDDNOW: A Parallel BDD Package
inferredcites →https://doi.org/10.1007/3-540-63166-6_26openalex-snapshot
Parallelizing the Murϕ verifier
inferredcites →https://doi.org/10.1007/978-3-540-30494-4_20openalex-snapshot
Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_5openalex-snapshot
A Work-Efficient Distributed Algorithm for Reachability Analysis
inferredcites →https://doi.org/10.1007/bfb0028744openalex-snapshot
On-the-fly model checking of RCTL formulas
inferredcites →https://doi.org/10.1007/s10009-002-0093-2openalex-snapshot
Scalable distributed on-the-fly symbolic model checking
inferredcites →https://doi.org/10.1007/s10009-004-0143-zopenalex-snapshot
Issues in distributed timed model checking
inferredcites →https://doi.org/10.1007/s10009-004-0183-4openalex-snapshot
A survey of recent advances in SAT-based formal verification
inferredcites →https://doi.org/10.1016/0020-0190(80)90021-6openalex-snapshot
Termination detection for diffusing computations
inferredcites →https://doi.org/10.1016/0020-0190(83)90092-3openalex-snapshot
Derivation of a termination detection algorithm for distributed computations
inferredcites →https://doi.org/10.1016/j.entcs.2005.08.003openalex-snapshot
Constructing Induction Rules for Deductive Synthesis Proofs
inferredcites →https://doi.org/10.1016/s0065-2458(03)58003-2openalex-snapshot
Bounded Model Checking
inferredcites →https://doi.org/10.1016/s1571-0661(04)80410-9openalex-snapshot
Liveness Checking as Safety Checking
inferredcites →https://doi.org/10.1023/a:1020373206491openalex-snapshot
A Scalable Parallel Algorithm for Reachability Analysis of Very Large Circuits
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
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.1997.643565openalex-snapshot
Reachability analysis using partitioned-ROBDDs
inferredcites →https://doi.org/10.1145/240518.240639openalex-snapshot
Implementation of an efficient parallel BDD package
inferredcites →https://doi.org/10.1145/378239.379018openalex-snapshot
Dynamic detection and removal of inactive clauses in SAT with application in image computation
inferredcites →https://doi.org/10.1145/775832.776043openalex-snapshot
SAT-based unbounded symbolic model checking
inferredcites →https://doi.org/10.1145/776038.776043openalex-snapshot
SAT-based unbounded symbolic model checking
inferredcites →https://doi.org/10.1184/r1/6612656openalex-snapshot
Using SAT based image computation for reachability analysis
inferredcites →https://doi.org/10.5555/266388.266513openalex-snapshot
Reachability analysis using partitioned-ROBDDs
inferredcites →https://doi.org/10.5555/380921.380940openalex-snapshot
Distributed LTL model-checking in SPIN

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

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/11691617_7openalex-snapshot
Parallel and Distributed Model Checking in Eddy
inferred← citeshttps://doi.org/10.1007/11804192_13openalex-snapshot
Cluster-Based LTL Model Checking of Large Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-69209-4_8openalex-snapshot
Enhanced Reliability Using Formal Techniques
inferred← citeshttps://doi.org/10.1007/978-3-540-69507-3_2openalex-snapshot
Model-Checking Large Finite-State Systems and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-540-70952-7_2openalex-snapshot
Distributed Verification: Exploring the Power of Raw Computing Power
inferred← citeshttps://doi.org/10.1007/978-3-540-70952-7_23openalex-snapshot
Can Saturation Be Parallelised?
inferred← citeshttps://doi.org/10.1007/978-3-540-73368-3_31openalex-snapshot
Parallelising Symbolic State-Space Generators
inferred← citeshttps://doi.org/10.1007/978-3-540-88479-8_43openalex-snapshot
Squeeze All the Power Out of Your Hardware to Verify Your Software!
inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_4openalex-snapshot
Multicore Constraint-Based Automated Stabilization
inferred← citeshttps://doi.org/10.1007/978-3-642-19583-9_9openalex-snapshot
Parallelizing a Symbolic Compositional Model-Checking Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-31424-7_55openalex-snapshot
Cubicle: A Parallel SMT-Based Model Checker for Parameterized Systems
inferred← citeshttps://doi.org/10.1007/978-981-13-0716-4_13openalex-snapshot
Violation Resolution in Distributed Stream Networks
inferred← citeshttps://doi.org/10.1007/s10009-008-0094-xopenalex-snapshot
Parallel and distributed model checking in Eddy
inferred← citeshttps://doi.org/10.1007/s10009-010-0136-zopenalex-snapshot
Scalable shared memory LTL model checking
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.10.020openalex-snapshot
Measuring and Evaluating Parallel State-Space Exploration Algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.02.008openalex-snapshot
Automated constraint-based addition of nonmasking and stabilizing fault-tolerance
inferred← citeshttps://doi.org/10.1093/logcom/exp005openalex-snapshot
Speculative Image Computation for Distributed Symbolic Reachability Analysis
inferred← citeshttps://doi.org/10.1093/logcom/exp006openalex-snapshot
To Parallelize or to Optimize?
inferred← citeshttps://doi.org/10.1109/icpads.2010.82openalex-snapshot
Employing Multiple CUDA Devices to Accelerate LTL Model Checking
inferred← citeshttps://doi.org/10.1109/sefm.2010.35openalex-snapshot
Parallel Partial Order Reduction with Topological Sort Proviso
inferred← citeshttps://doi.org/10.1109/tvlsi.2018.2890601openalex-snapshot
Determining Application-Specific Knowledge for Improving Robustness of Sequential Circuits
inferred← citeshttps://doi.org/10.1145/1837210.1837222openalex-snapshot
Parallel disk-based computation for large, monolithic binary decision diagrams
inferred← citeshttps://doi.org/10.1145/2254064.2254091openalex-snapshot
Parallelizing top-down interprocedural analyses
inferred← citeshttps://doi.org/10.1145/2345156.2254091openalex-snapshot
Parallelizing top-down interprocedural analyses
inferred← citeshttps://doi.org/10.1145/3092282.3092284openalex-snapshot
Distributed binary decision diagrams for symbolic reachability
inferred← citeshttps://doi.org/10.1145/3377811.3380425openalex-snapshot
Pipelining bottom-up data flow analysis
inferred← citeshttps://doi.org/10.1145/3540250.3558944openalex-snapshot
Input splitting for cloud-based static application security testing platforms
inferred← citeshttps://doi.org/10.1186/s42400-025-00501-2openalex-snapshot
Survey of Consensus Protocol’s Formal Verification
inferred← citeshttps://doi.org/10.21236/ada487024openalex-snapshot
Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs
inferred← citeshttps://doi.org/10.21236/ada487170openalex-snapshot
Using Model Checking Techniques for Symbolic Synthesis of Distributed Programs
inferred← citeshttps://doi.org/10.25335/m5jh3d441openalex-snapshot
Towards automated model revision for fault-tolerant systems
inferred← citeshttps://doi.org/10.4204/eptcs.14.1openalex-snapshot
Parallel symbolic state-space exploration is difficult, but what is the alternative?
inferred← citeshttps://doi.org/10.4204/eptcs.14.7openalex-snapshot
Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs
inferred← citeshttps://doi.org/10.4204/eptcs.72.3openalex-snapshot
Distributed BDD-Based Model Checking
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.