On the public citation graph
State-space caching revisited
0 signed · 66 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.1002/j.1538-7305.1990.tb00101.xopenalex-snapshot
Algorithms for Automated Protocol Verification
inferredcites →https://doi.org/10.1007/3-540-52148-8_16openalex-snapshot
On-line model-checking for finite linear temporal logic specifications
inferredcites →https://doi.org/10.1007/3-540-55179-4_19openalex-snapshot
Bounded-memory algorithms for verification on-the-fly
inferredcites →https://doi.org/10.1007/3-540-56496-9_15openalex-snapshot
State space caching revisited
inferredcites →https://doi.org/10.1007/3-540-56922-7_36openalex-snapshot
Refining dependencies improves partial-order verification methods (extended abstract)
inferredcites →https://doi.org/10.1007/bf00121128openalex-snapshot
Memory-efficient algorithms for the verification of temporal properties
inferredcites →https://doi.org/10.1007/bf01383879openalex-snapshot
Using partial orders for the efficient verification of deadlock freedom and safety properties
inferredcites →https://doi.org/10.1007/bfb0023731openalex-snapshot
Using partial orders to improve automatic verification methods
inferredcites →https://doi.org/10.1007/bfb0023737openalex-snapshot
Memory efficient algorithms for the verification of temporal properties
inferredcites →https://doi.org/10.1016/0376-5075(84)90036-9openalex-snapshot
The Pandora system: An interactive system for the design of data communication protocols
inferredcites →https://doi.org/10.1016/b978-0-444-89874-6.50016-7openalex-snapshot
Protocol development success stories: Part I
inferredcites →https://doi.org/10.1016/b978-0-444-89874-6.50028-3openalex-snapshot
Coverage Preserving Reduction Strategies for Reachability Analysis
inferredcites →https://doi.org/10.1109/49.44550openalex-snapshot
Data transport in a byte stream network
inferredcites →https://doi.org/10.1109/tse.1987.233206openalex-snapshot
Automated Protocol Validation in Argos: Assertion Proving and Scatter Searching
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11539452_38openalex-snapshot
A Practical Application of Geometric Semantics to Static Analysis of Concurrent Programs
inferred← citeshttps://doi.org/10.1007/11576280_12openalex-snapshot
Sweep-Line Analysis of TCP Connection Management
inferred← citeshttps://doi.org/10.1007/3-540-44804-7_7openalex-snapshot
Randomization Helps in LTL Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-031-24950-1_7openalex-snapshot
A Pragmatic Approach to Stateful Partial Order Reduction
inferred← citeshttps://doi.org/10.1007/978-3-319-22975-1_9openalex-snapshot
Improving Search Order for Reachability Testing in Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_12openalex-snapshot
Parallel Model Checking Algorithms for Linear-Time Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-24732-6_2openalex-snapshot
Typical Structural Properties of State Spaces
inferred← citeshttps://doi.org/10.1007/978-3-540-24732-6_3openalex-snapshot
State Caching Reconsidered
inferred← citeshttps://doi.org/10.1007/978-3-540-39893-6_19openalex-snapshot
Efficient Path Finding with the Sweep-Line Method Using External Storage
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_40openalex-snapshot
To Store or Not to Store
inferred← citeshttps://doi.org/10.1007/978-3-540-73094-1_26openalex-snapshot
The ComBack Method – Extending Hash Compaction with Backtracking
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_16openalex-snapshot
On Commutativity Based Edge Lean Search
inferred← citeshttps://doi.org/10.1007/978-3-540-85114-1_13openalex-snapshot
Layered Duplicate Detection in External-Memory Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-00768-2_21openalex-snapshot
Hierarchical Adaptive State Space Caching Based on Level Sampling
inferred← citeshttps://doi.org/10.1007/978-3-642-04761-9_17openalex-snapshot
On-the-fly Emptiness Check of Transition-Based Streett Automata
inferred← citeshttps://doi.org/10.1007/bfb0055632openalex-snapshot
Detecting deadlocks in concurrent systems
inferred← citeshttps://doi.org/10.1007/s10009-007-0050-1openalex-snapshot
Analysis of the Datagram Congestion Control Protocol’s connection management procedures using the sweep-line method
inferred← citeshttps://doi.org/10.1007/s10472-009-9167-0openalex-snapshot
On commutativity based Edge Lean search
inferred← citeshttps://doi.org/10.1007/s10515-014-0163-1openalex-snapshot
A model-driven framework for guided design space exploration
inferred← citeshttps://doi.org/10.1007/s10703-005-1489-xopenalex-snapshot
Software Model Checking: The VeriSoft Approach
inferred← citeshttps://doi.org/10.1007/s10703-025-00479-0openalex-snapshot
Awaiting for Godot : stateless model checking that avoids executions where nothing happens
inferred← citeshttps://doi.org/10.1016/j.ins.2007.10.023openalex-snapshot
ACTLW – An action-based computation tree logic with unless operator
inferred← citeshttps://doi.org/10.1016/j.jmsy.2014.11.009openalex-snapshot
Identifying FMS repetitive patterns for efficient search-based scheduling algorithm: A colored Petri net approach
inferred← citeshttps://doi.org/10.1016/j.scico.2012.06.005openalex-snapshot
State-cover testing for nondeterministic terminating concurrent programs with an infinite number of synchronization sequences
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.07.004openalex-snapshot
More efficient on-the-fly LTL verification with Tarjan's algorithm
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.036openalex-snapshot
The sweep-line state space exploration method
inferred← citeshttps://doi.org/10.1023/a:1008129319165openalex-snapshot
Application of Partial-Order Methods to Reactive Programs with Event Memorization
inferred← citeshttps://doi.org/10.1049/ic:19980529openalex-snapshot
Modelling and analysis of broadcasting embedded control systems
inferred← citeshttps://doi.org/10.1109/ase.2011.6100051openalex-snapshot
A model-driven framework for guided design space exploration
inferred← citeshttps://doi.org/10.1109/cmpass.1995.521903openalex-snapshot
An Estelle-NPN based system for protocol verification
inferred← citeshttps://doi.org/10.1109/csd.1998.657535openalex-snapshot
How to make concurrent programs highly reliable-more than state space analysis
inferred← citeshttps://doi.org/10.1109/csd.2004.1309129openalex-snapshot
Nested emptiness search for generalized Buchi automata
inferred← citeshttps://doi.org/10.1109/isads.2001.917397openalex-snapshot
On Godefroid's state-less search technique for testing concurrent programs
inferred← citeshttps://doi.org/10.1109/qsic.2011.12openalex-snapshot
A Comparison of Test Generation Algorithms for Testing Application Interactions
inferred← citeshttps://doi.org/10.1109/tsmca.2003.820582openalex-snapshot
Exploiting Equivalence Reduction and the Sweep-Line Method for Detecting Terminal States
inferred← citeshttps://doi.org/10.1145/1858996.1859043openalex-snapshot
A bounded statistical approach for model checking of unbounded until properties
inferred← citeshttps://doi.org/10.1145/2535838.2535845openalex-snapshot
Optimal dynamic partial order reduction
inferred← citeshttps://doi.org/10.1145/2578855.2535845openalex-snapshot
Optimal dynamic partial order reduction
inferred← citeshttps://doi.org/10.1145/263699.263717openalex-snapshot
Model checking for programming languages using VeriSoft
inferred← citeshttps://doi.org/10.1145/3158119openalex-snapshot
Data-centric dynamic partial order reduction
inferred← citeshttps://doi.org/10.1145/3360550openalex-snapshot
Value-centric dynamic partial order reduction
inferred← citeshttps://doi.org/10.1145/3664476.3664523openalex-snapshot
Adversary Tactic Driven Scenario and Terrain Generation with Partial Infrastructure Specification
inferred← citeshttps://doi.org/10.1609/socs.v7i1.18393openalex-snapshot
Sleep Sets Meet Duplicate Elimination
inferred← citeshttps://doi.org/10.54337/aau534292082openalex-snapshot
Efficient Model Checking: The Power of Randomness
inferred← citeshttps://doi.org/10.70675/3b17a406zc9dbz4a47z853czb9ebaaa90425openalex-snapshot
Verification of timed automata : reachability, liveness and modelling
inferred← citeshttps://doi.org/10.70675/eab868faz45d9z4b39zbf0czec19d367f3a2openalex-snapshot
Méthode de conception de logiciel système critique couplée à une démarche de vérification formelle
inferred← citeshttps://doi.org/10.7146/dpb.v35i579.7322openalex-snapshot
Seventh Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, Aarhus, Denmark, October 24-26, 2006
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.