On the public citation graph
Parameterized verification under TSO is PSPACE-complete
0 signed · 57 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/978-3-319-10575-8_21openalex-snapshot
Model Checking Parameterized Systems
inferredcites →https://doi.org/10.1007/978-3-319-52234-0_23openalex-snapshot
Reachability for Dynamic Parametric Processes
inferredcites →https://doi.org/10.1007/978-3-319-63390-9_9openalex-snapshot
Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems
inferredcites →https://doi.org/10.1007/978-3-540-30124-0_26openalex-snapshot
Parameterized Model Checking of Ring-Based Message Passing Systems
inferredcites →https://doi.org/10.1007/978-3-540-39724-3_22openalex-snapshot
Exact and Efficient Verification of Parameterized Cache Coherence Protocols
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_24openalex-snapshot
Iterating Transducers in the Large (Extended Abstract)
inferredcites →https://doi.org/10.1007/978-3-642-03359-9_27openalex-snapshot
A Better x86 Memory Model: x86-TSO
inferredcites →https://doi.org/10.1007/978-3-642-14295-6_55openalex-snapshot
Dynamic Cutoff Detection in Parameterized Concurrent Programs
inferredcites →https://doi.org/10.1007/978-3-642-15375-4openalex-snapshot
CONCUR 2010 - Concurrency Theory
inferredcites →https://doi.org/10.1007/978-3-642-15375-4_22openalex-snapshot
Parameterized Verification of Ad Hoc Networks
inferredcites →https://doi.org/10.1007/978-3-642-15375-4_7openalex-snapshot
Constrained Monotonic Abstraction: A CEGAR for Parameterized Verification
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_29openalex-snapshot
Checking and Enforcing Robustness against TSO
inferredcites →https://doi.org/10.1007/978-3-662-49674-9_39openalex-snapshot
Parameterized Compositional Model Checking
inferredcites →https://doi.org/10.1007/s10009-011-0205-yopenalex-snapshot
Abstract regular (tree) model checking
inferredcites →https://doi.org/10.1007/s10009-015-0406-xopenalex-snapshot
Parameterized verification through view abstraction
inferredcites →https://doi.org/10.1016/0020-0190(86)90071-2openalex-snapshot
Limits for automatic verification of finite-state concurrent systems
inferredcites →https://doi.org/10.1016/0304-3975(94)00231-7openalex-snapshot
Complexity results for 1-safe nets
inferredcites →https://doi.org/10.1016/s0022-0000(70)80006-xopenalex-snapshot
Relationships between nondeterministic and deterministic tape complexities
inferredcites →https://doi.org/10.1016/s0304-3975(00)00103-1openalex-snapshot
Symbolic model checking with rich assertional languages
inferredcites →https://doi.org/10.1016/s0304-3975(01)00330-9openalex-snapshot
Model checking of systems with many identical timed processes
inferredcites →https://doi.org/10.1109/hpca.2014.6835927openalex-snapshot
TSO-CC: Consistency directed cache coherence for TSO
inferredcites →https://doi.org/10.1109/lics.1999.782630openalex-snapshot
On the verification of broadcast protocols
inferredcites →https://doi.org/10.1109/lics.2008.37openalex-snapshot
Parameterization as Abstraction: A Tractable Approach to the Dataflow Analysis of Concurrent Programs
inferredcites →https://doi.org/10.1109/micro.2016.7783736openalex-snapshot
Racer: TSO consistency via race detection
inferredcites →https://doi.org/10.1145/146637.146681openalex-snapshot
Reasoning about systems with many processes
inferredcites →https://doi.org/10.1145/1706299.1706303openalex-snapshot
On the verification problem for weak memory models
inferredcites →https://doi.org/10.1145/1993498.1993520openalex-snapshot
Understanding POWER multiprocessors
inferredcites →https://doi.org/10.1145/2160910.2160915openalex-snapshot
Algorithmic verification of asynchronous programs
inferredcites →https://doi.org/10.1145/2837614.2837643openalex-snapshot
Taming release-acquire consistency
inferredcites →https://doi.org/10.1145/2842603openalex-snapshot
Parameterized Verification of Asynchronous Shared-Memory Systems
inferredcites →https://doi.org/10.1145/2951860.2951873openalex-snapshot
Decidability in Parameterized Verification
inferredcites →https://doi.org/10.1145/3314221.3314649openalex-snapshot
Verification of programs under the release-acquire semantics
inferredcites →https://doi.org/10.1561/2500000011openalex-snapshot
Principles of Eventual Consistency
inferredcites →https://doi.org/10.23638/lmcs-14(1:9)2018openalex-snapshot
A Load-Buffer Semantics for Total Store Ordering
inferredcites →https://doi.org/10.4230/lipics.concur.2015.72openalex-snapshot
Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable
inferredcites →https://doi.org/10.4230/lipics.concur.2018.6openalex-snapshot
Universal Safety for Timed Petri Nets is PSPACE-complete
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2011.457openalex-snapshot
Parameterised Pushdown Systems with Non-Atomic Writes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-17436-0_19openalex-snapshot
Verifying Reachability for TSO Programs with Dynamic Thread Creation
inferred← citeshttps://doi.org/10.1007/978-3-031-30823-9_30openalex-snapshot
Parameterized Verification under TSO with Data Types
inferred← citeshttps://doi.org/10.1007/978-3-031-57256-2_12openalex-snapshot
Decidable Verification under Localized Release-Acquire Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-031-57256-2_14openalex-snapshot
Verification under TSO with an infinite Data Domain
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470691openalex-snapshot
Verifying higher-order concurrency with data automata
inferred← citeshttps://doi.org/10.1145/3385412.3385966openalex-snapshot
Decidable verification under a causally consistent shared memory
inferred← citeshttps://doi.org/10.1145/3458593.3458595openalex-snapshot
What is decidable under the TSO memory model?
inferred← citeshttps://doi.org/10.1145/3505273openalex-snapshot
What’s Decidable About Causally Consistent Shared Memory?
inferred← citeshttps://doi.org/10.1145/3519270.3538445openalex-snapshot
Parameterized Verification under Release Acquire is PSPACE-complete
inferred← citeshttps://doi.org/10.1145/3656425openalex-snapshot
Verification under Intel-x86 with Persistency
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3257081/v1openalex-snapshot
Dynamic Partial Order Reduction Based on Interference Solution
inferred← citeshttps://doi.org/10.4204/eptcs.390.6openalex-snapshot
TSO Games - On the decidability of safety games under the total store order semantics
inferred← citeshttps://doi.org/10.48550/arxiv.2101.12123openalex-snapshot
Safety Verification of Parameterized Systems under Release-Acquire
inferred← citeshttps://doi.org/10.48550/arxiv.2105.02444openalex-snapshot
Parallelized sequential composition, pipelines, and hardware weak memory models
inferred← citeshttps://doi.org/10.70675/7c2565b1z1cb0z4a01za239z032e5c0d8182openalex-snapshot
Parameterized verification of distributed shared-memory systems
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.