On the public citation graph
A general approach to partial order reductions in symbolic verification
0 signed · 49 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.1006/inco.1996.0053openalex-snapshot
Verifying Programs with Unreliable Channels
inferredcites →https://doi.org/10.1007/3-540-51285-3_42openalex-snapshot
A method for refining atomicity in parallel algorithms
inferredcites →https://doi.org/10.1007/3-540-53863-1_36openalex-snapshot
Stubborn sets for reduced state space generation
inferredcites →https://doi.org/10.1007/3-540-56922-7_33openalex-snapshot
On-the-fly verification with stubborn sets
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/3-540-61474-5_53openalex-snapshot
Symbolic verification of communication protocols with infinite state spaces using QDDs
inferredcites →https://doi.org/10.1007/3-540-63166-6_34openalex-snapshot
Partial-order reduction in symbolic state space exploration
inferredcites →https://doi.org/10.1007/978-0-387-34878-0_13openalex-snapshot
An Improvement in Formal Verification
inferredcites →https://doi.org/10.1007/978-0-387-35271-8_16openalex-snapshot
An Improved Search Strategy for Lossy Channel Systems
inferredcites →https://doi.org/10.1007/bf00121262openalex-snapshot
Combining partial order reductions with on-the-fly model-checking
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/bf01384314openalex-snapshot
A technique of state space search based on unfolding
inferredcites →https://doi.org/10.1007/bf01786631openalex-snapshot
A theorem on atomicity in distributed algorithms
inferredcites →https://doi.org/10.1016/0304-3975(92)90054-jopenalex-snapshot
Defining conditional independence using collapses
inferredcites →https://doi.org/10.1016/0890-5401(90)90009-7openalex-snapshot
Reduction and covering of infinite reachability trees
inferredcites →https://doi.org/10.1016/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
inferredcites →https://doi.org/10.1023/a:1008719024240openalex-snapshot
Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs
inferredcites →https://doi.org/10.1109/lics.1990.113766openalex-snapshot
Model-checking for real-time systems
inferredcites →https://doi.org/10.1109/lics.1993.287591openalex-snapshot
Verifying programs with unreliable channels
inferredcites →https://doi.org/10.1109/lics.1996.561359openalex-snapshot
General decidability theorems for infinite-state systems
inferredcites →https://doi.org/10.1109/real.1997.641265openalex-snapshot
Efficient verification of real-time systems: compact data structure and state-space reduction
inferredcites →https://doi.org/10.1145/135419.135461openalex-snapshot
From sequential layers to distributed processes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1520-684x(200008)31:9<1::aid-scj1>3.0.co;2-1openalex-snapshot
Yet more image computations for SMV, the symbolic model verifier
inferred← citeshttps://doi.org/10.1007/10722167_37openalex-snapshot
Unfoldings of Unbounded Petri Nets
inferred← citeshttps://doi.org/10.1007/11604655_56openalex-snapshot
Efficient Symmetry Reduction for an Actor-Based Model
inferred← citeshttps://doi.org/10.1007/11691372_13openalex-snapshot
Counterexample-Guided Abstraction Refinement for the Analysis of Graph Transformation Systems
inferred← citeshttps://doi.org/10.1007/3-540-46419-0_19openalex-snapshot
Compositional State Space Generation with Partial Order Reductions for Asynchronous Communicating Systems
inferred← citeshttps://doi.org/10.1007/3-540-46419-0_29openalex-snapshot
Symbolic Representation of Upward-Closed Sets
inferred← citeshttps://doi.org/10.1007/978-3-030-31277-0_1openalex-snapshot
Dynamic Partial Order Reduction Under the Release-Acquire Semantics (Tutorial)
inferred← citeshttps://doi.org/10.1007/978-3-030-91384-7_5openalex-snapshot
Regular Model Checking: Evolution and Perspectives
inferred← citeshttps://doi.org/10.1007/978-3-031-22337-2_24openalex-snapshot
Consistency and Persistency in Program Verification: Challenges and Opportunities
inferred← citeshttps://doi.org/10.1007/978-3-031-56222-8_1openalex-snapshot
Fairness and Liveness Under Weak Consistency
inferred← citeshttps://doi.org/10.1007/978-3-031-98682-6_18openalex-snapshot
Counterexample-Guided Commutativity
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_21openalex-snapshot
Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_55openalex-snapshot
Unfolding Concurrent Well-Structured Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-87405-8_21openalex-snapshot
Towards the Verification of Attributed Graph Transformation Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-03240-0_9openalex-snapshot
Efficient Symbolic Model Checking for Process Algebras
inferred← citeshttps://doi.org/10.1007/978-3-642-20398-5_29openalex-snapshot
Combining Partial-Order Reduction and Symbolic Model Checking to Verify LTL Properties
inferred← citeshttps://doi.org/10.1007/s00236-009-0111-xopenalex-snapshot
Symmetry and partial order reduction techniques in model checking Rebeca
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.08.049openalex-snapshot
Diagram Chase in Relational System Development
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.04.042openalex-snapshot
Augur 2 — A New Version of a Tool for the Analysis of Graph Transformation Systems
inferred← citeshttps://doi.org/10.1016/j.ic.2008.04.002openalex-snapshot
A framework for the verification of infinite-state graph transformation systems
inferred← citeshttps://doi.org/10.1023/b:form.0000004786.30007.f8openalex-snapshot
SAT-Solving the Coverability Problem for Petri Nets
inferred← citeshttps://doi.org/10.1093/comjnl/bxl039openalex-snapshot
Verifying an ATM Protocol Using a Combination of Formal Techniques
inferred← citeshttps://doi.org/10.1109/acsd.2012.26openalex-snapshot
An Algorithmic Framework for Coverability in Well-Structured Systems
inferred← citeshttps://doi.org/10.1109/apsec.2014.49openalex-snapshot
A Symbolic Partial Order Method for Verifying SystemC
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.2.26openalex-snapshot
Graph transformation systems, Petri nets and Semilinear Sets: Checking for the Absence of Forbidden Paths in Graphs
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.