On the public citation graph
An approach to automating the verification of compact parallel coordination programs. I
0 signed · 83 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/bf00264015openalex-snapshot
Formal derivation of strongly correct concurrent programs
inferredcites →https://doi.org/10.1007/bf00268134openalex-snapshot
An axiomatic proof technique for parallel programs I
inferredcites →https://doi.org/10.1007/bf00289519openalex-snapshot
Hierarchical ordering of sequential processes
inferredcites →https://doi.org/10.1007/bfb0022469openalex-snapshot
On the absence of livelocks in parallel programs
inferredcites →https://doi.org/10.1016/0020-0190(79)90147-9openalex-snapshot
A starvation-free solution to the mutual exclusion problem
inferredcites →https://doi.org/10.1016/0304-3975(79)90041-0openalex-snapshot
On the reachability problem for 5-dimensional vector addition systems
inferredcites →https://doi.org/10.1016/0304-3975(81)90110-9openalex-snapshot
The temporal semantics of concurrent programs
inferredcites →https://doi.org/10.1016/0304-3975(81)90113-4openalex-snapshot
System modelling with high-level Petri nets
inferredcites →https://doi.org/10.1016/s0022-0000(69)80011-5openalex-snapshot
Parallel program schemata
inferredcites →https://doi.org/10.1016/s0022-0000(75)80018-3openalex-snapshot
Proving assertions about parallel programs
inferredcites →https://doi.org/10.1109/tc.1983.1676201openalex-snapshot
The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer
inferredcites →https://doi.org/10.1109/tse.1977.229904openalex-snapshot
Proving the Correctness of Multiprocess Programs
inferredcites →https://doi.org/10.1145/357103.357109openalex-snapshot
Synthesis of Resource Invariants for Concurrent Programs
inferredcites →https://doi.org/10.1145/357172.357178openalex-snapshot
Proving Liveness Properties of Concurrent Programs
inferredcites →https://doi.org/10.1145/360051.360224openalex-snapshot
Verifying properties of parallel programs
inferredcites →https://doi.org/10.1145/361268.361277openalex-snapshot
Synchronization of communicating processes
inferredcites →https://doi.org/10.1145/362759.362813openalex-snapshot
Concurrent control with “readers” and “writers”
inferredcites →https://doi.org/10.1145/69624.357206openalex-snapshot
Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors
inferredcites →https://doi.org/10.2140/pjm.1955.5.285openalex-snapshot
A lattice-theoretical fixpoint theorem and its applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10721959_19openalex-snapshot
Reducing Model Checking of the Many to the Few
inferred← citeshttps://doi.org/10.1007/11901433_6openalex-snapshot
Reducing Model Checking of the Few to the One
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_371openalex-snapshot
A verifier for compact parallel coordination programs
inferred← citeshttps://doi.org/10.1007/3-540-36576-1_6openalex-snapshot
Parameterized Verification by Probabilistic Abstraction
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_1openalex-snapshot
Model Checking: Theory into Practice
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_9openalex-snapshot
Liveness with (0,1, ∞)- Counter Abstraction
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_43openalex-snapshot
Symbolic verification with periodic sets
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_60openalex-snapshot
Automatic verification of parameterized synchronous systems
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_65openalex-snapshot
Verifying systems with replicated components in murϕ
inferred← citeshttps://doi.org/10.1007/978-1-4471-3756-6_16openalex-snapshot
Design, verification and documentation of concurrent systems
inferred← citeshttps://doi.org/10.1007/978-3-030-85262-7_2openalex-snapshot
Vectorized Barrier and Reduction in LLVM OpenMP Runtime
inferred← citeshttps://doi.org/10.1007/978-3-031-82700-6_4openalex-snapshot
Correctness Witnesses for Concurrent Programs: Bridging the Semantic Divide with Ghosts
inferred← citeshttps://doi.org/10.1007/978-3-319-21690-4_6openalex-snapshot
SMT and POR Beat Counter Abstraction: Parameterized Model Checking of Threshold-Based Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-95582-7_30openalex-snapshot
View Abstraction for Systems with Component Identities
inferred← citeshttps://doi.org/10.1007/978-3-540-24732-6_15openalex-snapshot
Using Fairness to Make Abstractions Work
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_37openalex-snapshot
Thread Quantification for Concurrent Shape Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-73210-5_32openalex-snapshot
Non-interference Properties for Data-Type Reduction of Communicating Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-75596-8_5openalex-snapshot
Mind the Shapes: Abstraction Refinement Via Topology Invariants
inferred← citeshttps://doi.org/10.1007/978-3-540-77566-9_40openalex-snapshot
Verifying Parameterized taDOM+ Lock Managers
inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_9openalex-snapshot
Symbolic Counter Abstraction for Concurrent Software
inferred← citeshttps://doi.org/10.1007/978-3-642-19835-9_4openalex-snapshot
Compositionality Entails Sequentializability
inferred← citeshttps://doi.org/10.1007/978-3-662-44584-6_10openalex-snapshot
On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability
inferred← citeshttps://doi.org/10.1007/bf00625968openalex-snapshot
Better verification through symmetry
inferred← citeshttps://doi.org/10.1007/bf01379320openalex-snapshot
Two algorithms for barrier synchronization
inferred← citeshttps://doi.org/10.1007/bf01407956openalex-snapshot
Synchronization barrier and related tools for shared memory parallel programming
inferred← citeshttps://doi.org/10.1007/bf02577738openalex-snapshot
Using true concurrency to model execution of parallel programs
inferred← citeshttps://doi.org/10.1007/bfb0028766openalex-snapshot
Verification of a parameterized bus arbitration protocol
inferred← citeshttps://doi.org/10.1007/s10009-022-00648-0openalex-snapshot
Parameterized verification of systems with component identities, using view abstraction
inferred← citeshttps://doi.org/10.1007/s10703-010-0096-7openalex-snapshot
Context-aware counter abstraction
inferred← citeshttps://doi.org/10.1007/s10703-017-0297-4openalex-snapshot
Para $$^2$$ 2 : parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
inferred← citeshttps://doi.org/10.1016/j.cl.2004.02.006openalex-snapshot
Model checking and abstraction to the aid of parameterized systems (a survey)
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.03.019openalex-snapshot
Efficient Reduction Techniques for Systems with Many Components
inferred← citeshttps://doi.org/10.1016/j.ic.2016.03.006openalex-snapshot
On the completeness of bounded model checking for threshold-based distributed algorithms: Reachability
inferred← citeshttps://doi.org/10.1016/j.ipl.2024.106533openalex-snapshot
Counter abstraction for regular open teams
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.scico.2013.03.018openalex-snapshot
CSP-based counter abstraction for systems with node identifiers
inferred← citeshttps://doi.org/10.1017/s0269964800001790openalex-snapshot
Quicker Convergence for Iterative Numerical Solutions to Stochastic Problems: Probabilistic Interpretations, Ordering Heuristics, and Parallel Processing
inferred← citeshttps://doi.org/10.1023/a:1008723125149openalex-snapshot
Verifying Systems with Replicated Components in Murϕ
inferred← citeshttps://doi.org/10.1023/a:1026276129010openalex-snapshot
Constraint-Based Verification of Parameterized Cache Coherence Protocols
inferred← citeshttps://doi.org/10.1109/icdcs.2017.290openalex-snapshot
Reachability in Binary Multithreaded Programs Is Polynomial
inferred← citeshttps://doi.org/10.1109/ipdps.2000.846037openalex-snapshot
Monotonic counters: a new mechanism for thread synchronization
inferred← citeshttps://doi.org/10.1109/tse.2015.2510001openalex-snapshot
A Game-Theoretic Foundation for the Maximum Software Resilience against Dense Errors
inferred← citeshttps://doi.org/10.1145/103727.103729openalex-snapshot
Algorithms for scalable synchronization on shared-memory multiprocessors
inferred← citeshttps://doi.org/10.1145/1190215.1190266openalex-snapshot
Interprocedural analysis of asynchronous programs
inferred← citeshttps://doi.org/10.1145/1190216.1190266openalex-snapshot
Interprocedural analysis of asynchronous programs
inferred← citeshttps://doi.org/10.1145/2837614.2837657openalex-snapshot
Scaling network verification using symmetry and surgery
inferred← citeshttps://doi.org/10.1145/2914770.2837657openalex-snapshot
Scaling network verification using symmetry and surgery
inferred← citeshttps://doi.org/10.1145/3009837.3009860openalex-snapshot
A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
inferred← citeshttps://doi.org/10.1145/3093333.3009860openalex-snapshot
A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
inferred← citeshttps://doi.org/10.1145/323596.323625openalex-snapshot
Simple, efficient asynchronous parallel algorithms for maximization
inferred← citeshttps://doi.org/10.1145/3586033openalex-snapshot
Enabling Bounded Verification of Doubly-Unbounded Distributed Agreement-Based Systems via Bounded Regions
inferred← citeshttps://doi.org/10.1145/3779649openalex-snapshot
Analysing a Library of Concurrency Primitives using CSP
inferred← citeshttps://doi.org/10.1145/42190.42278openalex-snapshot
Simple, efficient, asynchronous parallel algorithms for maximization
inferred← citeshttps://doi.org/10.1145/996841.996844openalex-snapshot
Race checking by context inference
inferred← citeshttps://doi.org/10.1145/996893.996844openalex-snapshot
Race checking by context inference
inferred← citeshttps://doi.org/10.3384/diss.diva-173568openalex-snapshot
Parameterized Verification of Synchronized Concurrent Programs
inferred← citeshttps://doi.org/10.3390/sym2020799openalex-snapshot
Replication and Abstraction: Symmetry in Automated Formal Verification
inferred← citeshttps://doi.org/10.3990/1.9789036515641openalex-snapshot
Towards effective model checking
inferred← citeshttps://doi.org/10.4204/eptcs.96.2openalex-snapshot
Rapid Recovery for Systems with Scarce Faults
inferred← citeshttps://doi.org/10.4230/dagsemproc.10051.3openalex-snapshot
Spotlight Abstraction of Agents and Areas
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.