On the public citation graph
Pattern-Based Verification for Multithreaded Programs
0 signed · 46 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/11513988_49openalex-snapshot
Reasoning About Threads Communicating via Locks
inferredcites →https://doi.org/10.1007/11532231_25openalex-snapshot
On the Complexity of Equational Horn Clauses
inferredcites →https://doi.org/10.1007/11539452_36openalex-snapshot
Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_42openalex-snapshot
Zing: A Model Checker for Concurrent Software
inferredcites →https://doi.org/10.1007/978-3-540-31980-1_7openalex-snapshot
Context-Bounded Model Checking of Concurrent Software
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_20openalex-snapshot
Interprocedural Analysis of Concurrent Programs Under a Context Bound
inferredcites →https://doi.org/10.1007/978-3-540-85114-1_19openalex-snapshot
Symbolic Context-Bounded Analysis of Multithreaded Java Programs
inferredcites →https://doi.org/10.1007/978-3-540-85361-9_29openalex-snapshot
On the Reachability Analysis of Acyclic Networks of Pushdown Systems
inferredcites →https://doi.org/10.1007/978-3-540-85780-8_9openalex-snapshot
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
inferredcites →https://doi.org/10.1007/978-3-642-02658-4_36openalex-snapshot
Reducing Context-Bounded Concurrent Reachability to Sequential Reachability
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-28872-2_25openalex-snapshot
Language-Theoretic Abstraction Refinement
inferredcites →https://doi.org/10.1007/978-3-642-31424-7_22openalex-snapshot
Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters
inferredcites →https://doi.org/10.1007/s10703-009-0078-9openalex-snapshot
Reducing concurrent analysis under a context bound to sequential analysis
inferredcites →https://doi.org/10.1007/s10703-011-0136-yopenalex-snapshot
Bounded underapproximations
inferredcites →https://doi.org/10.1016/0022-0000(81)90028-3openalex-snapshot
The complexity of decision problems for finite-turn multicounter machines
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/j.ipl.2011.03.019openalex-snapshot
Parikhʼs theorem: A simple and direct automaton construction
inferredcites →https://doi.org/10.1090/s0002-9939-1978-0500555-0openalex-snapshot
A Bound on Solutions of Linear Integer Equalities and Inequalities
inferredcites →https://doi.org/10.1109/lics.2009.45openalex-snapshot
Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks
inferredcites →https://doi.org/10.1145/1190215.1190262openalex-snapshot
On the analysis of interacting pushdown systems
inferredcites →https://doi.org/10.1145/1190216.1190262openalex-snapshot
On the analysis of interacting pushdown systems
inferredcites →https://doi.org/10.1145/1250734.1250785openalex-snapshot
Iterative context bounding for systematic testing of multithreaded programs
inferredcites →https://doi.org/10.1145/349214.349241openalex-snapshot
Context-sensitive synchronization-sensitive analysis is undecidable
inferredcites →https://doi.org/10.2168/lmcs-7(4:4)2011openalex-snapshot
Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads
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-030-89716-1_4openalex-snapshot
Recent Advances on Reachability Problems for Valence Systems (Invited Talk)
inferred← citeshttps://doi.org/10.1007/978-3-319-41540-6_7openalex-snapshot
Liveness of Randomised Parameterised Systems under Arbitrary Schedulers
inferred← citeshttps://doi.org/10.1007/978-3-319-45994-3_11openalex-snapshot
Decidable Models of Integer-Manipulating Programs with Recursive Parallelism
inferred← citeshttps://doi.org/10.1007/978-3-319-89963-3_2openalex-snapshot
Fine-Grained Complexity of Safety Verification
inferred← citeshttps://doi.org/10.1007/978-3-662-49674-9_45openalex-snapshot
Acceleration in Multi-PushDown Systems
inferred← citeshttps://doi.org/10.1007/s00236-016-0290-1openalex-snapshot
Reachability analysis of reversal-bounded automata on series–parallel graphs
inferred← citeshttps://doi.org/10.1007/s10817-020-09572-xopenalex-snapshot
Fine-Grained Complexity of Safety Verification
inferred← citeshttps://doi.org/10.1016/j.jpdc.2021.11.008openalex-snapshot
Reachability in parallel programs is polynomial in the number of threads
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.04.050openalex-snapshot
Decidable models of integer-manipulating programs with recursive parallelism
inferred← citeshttps://doi.org/10.1117/12.3052016openalex-snapshot
An efficient formal verification method for concurrent programs
inferred← citeshttps://doi.org/10.1145/2933575.2934561openalex-snapshot
The complexity of regular abstractions of one-counter languages
inferred← citeshttps://doi.org/10.1145/3062341.3062384openalex-snapshot
Flatten and conquer: a framework for efficient analysis of string constraints
inferred← citeshttps://doi.org/10.1145/3140587.3062384openalex-snapshot
Flatten and conquer: a framework for efficient analysis of string constraints
inferred← citeshttps://doi.org/10.4204/eptcs.193.8openalex-snapshot
Reachability Analysis of Reversal-bounded Automata on Series-Parallel Graphs
inferred← citeshttps://doi.org/10.4204/eptcs.226.13openalex-snapshot
Bounded-oscillation Pushdown Automata
inferred← citeshttps://doi.org/10.70675/394d262cza014z447fzb6f9z0dcf7f11b56bopenalex-snapshot
Assertions and measurements for mixed-signal simulation
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.