On the public citation graph
Memory Efficient State Space Storage in Explicit Software Model Checking
0 signed · 44 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/11494744_26openalex-snapshot
High Level Petri Nets Analysis with Helena
inferredcites →https://doi.org/10.1007/3-540-36577-x_35openalex-snapshot
Using Petri Net Invariants in State Space Construction
inferredcites →https://doi.org/10.1007/3-540-44829-2_9openalex-snapshot
A Nearly Memory-Optimal Data Structure for Sets and Mappings
inferredcites →https://doi.org/10.1007/3-540-44947-7openalex-snapshot
Reliable Software Technologies — Ada-Europe 2003
inferredcites →https://doi.org/10.1007/3-540-44947-7_12openalex-snapshot
Quasar: A New Tool for Concurrent Ada Programs Analysis
inferredcites →https://doi.org/10.1007/3-540-45139-0_6openalex-snapshot
Addressing dynamic issues of program model checking
inferredcites →https://doi.org/10.1007/3-540-45319-9_31openalex-snapshot
A Sweep-Line Method for State Space Exploration
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_2openalex-snapshot
Runtime Efficient State Compaction in Spin
inferredcites →https://doi.org/10.1007/3-540-53863-1_31openalex-snapshot
Coloured petri nets: A high level language for system design and analysis
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_6openalex-snapshot
Reliable hashing without collision detection
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_16openalex-snapshot
Obtaining Memory-Efficient Reachability Graph Representations Using the Sweep-Line Method
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_17openalex-snapshot
Automated Generation of a Progress Measure for the Sweep-Line Method
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-24732-6_3openalex-snapshot
State Caching Reconsidered
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_40openalex-snapshot
To Store or Not to Store
inferredcites →https://doi.org/10.1007/b136988openalex-snapshot
Applications and Theory of Petri Nets 2005
inferredcites →https://doi.org/10.1007/bfb0035380openalex-snapshot
Space efficient reachability analysis through use of pseudo-root states
inferredcites →https://doi.org/10.1016/s1571-0661(05)80009-xopenalex-snapshot
Space-Reduction Strategies for Model Checking Dynamic Software
inferredcites →https://doi.org/10.1090/dimacs/032/13openalex-snapshot
Memory efficient state storage in SPIN
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1145/263699.263717openalex-snapshot
Model checking for programming languages using VeriSoft
inferredcites →https://doi.org/10.5555/368058.368416openalex-snapshot
Efficient encoding schemes for symbolic analysis of petri nets
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118720103openalex-snapshot
Verification of Communication Protocols in Web Services
inferred← citeshttps://doi.org/10.1002/9781118720103.ch5openalex-snapshot
MEMORY‐EFFICIENT STATE‐SPACE ANALYSIS IN SOFTWARE MODEL CHECKING
inferred← citeshttps://doi.org/10.1002/9781118720103.ch6openalex-snapshot
TIME‐EFFICIENT STATE‐SPACE ANALYSIS IN SOFTWARE MODEL CHECKING
inferred← citeshttps://doi.org/10.1007/11494744_26openalex-snapshot
High Level Petri Nets Analysis with Helena
inferred← citeshttps://doi.org/10.1007/978-3-319-02444-8_16openalex-snapshot
Multi-threaded Explicit State Space Exploration with State Reconstruction
inferred← citeshttps://doi.org/10.1007/978-3-319-63387-9_28openalex-snapshot
Compositional Model Checking with Incremental Counter-Example Construction
inferred← citeshttps://doi.org/10.1007/978-3-319-67729-3_15openalex-snapshot
PTrie: Data Structure for Compressing and Storing Sets via Prefix Sharing
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_49openalex-snapshot
Correcting a Space-Efficient Simulation Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-70952-7_24openalex-snapshot
Distributed Colored Petri Net Model-Checking with Cyclades
inferred← citeshttps://doi.org/10.1007/978-3-642-04856-2_8openalex-snapshot
The ComBack Method Revisited: Caching Strategies and Extension with Delayed Duplicate Detection
inferred← citeshttps://doi.org/10.1007/978-3-642-18222-8_2openalex-snapshot
Search-Order Independent State Caching
inferred← citeshttps://doi.org/10.1007/978-3-642-22306-8_4openalex-snapshot
Parallel Recursive State Compression for Free
inferred← citeshttps://doi.org/10.1007/s10009-010-0137-yopenalex-snapshot
Solving the ignoring problem for partial order reduction
inferred← citeshttps://doi.org/10.1007/s10009-022-00667-xopenalex-snapshot
Bounded DBM-based clock state construction for timed automata in Uppaal
inferred← citeshttps://doi.org/10.1109/iceccs54210.2022.00021openalex-snapshot
Distributed Explicit State Space Exploration with State Reconstruction for RDMA Networks
inferred← citeshttps://doi.org/10.6100/ir643995openalex-snapshot
Improved verification methods for concurrent systems
inferred← citeshttps://doi.org/10.7146/dpb.v37i588.7188openalex-snapshot
Ninth Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, Aarhus, Denmark, October 20-22, 2008
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.