Pith. Sign in

RECORD

Checking Presence Reachability Properties on Parameterized Shared-Memory Systems

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Nicolas Waldburger

Formal Languages and Automata Theory · Submitted 30 Jun 2023

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim In the more general round-based setting, we establish that the parameterized verification of presence reachability properties is PSPACE-complete.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2306.17476 (version 2)
Pith IDBJCG5FGE, Pith's permanent record of this paper and its review
CitationNicolas Waldburger. "Checking Presence Reachability Properties on Parameterized Shared-Memory Systems." arXiv:2306.17476 (2023). https://pith.science/paper/BJCG5FGE
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 5,520 input tokens.

What the abstract itself states, as probabilities: claims first 0.05 · states limitation 0.31 · human participants 0.01 · controlled comparison 0.03 · randomized assignment 0.01 · states quantitative result 0.88 · compares with prior results 0.47 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v2. Results and the main claim are underlined; .

We consider the verification of distributed systems composed of an arbitrary number of asynchronous processes. Processes are identical finite-state machines that communicate by reading from and writing to a shared memory. Beyond the standard model with finitely many registers, we tackle round-based shared-memory systems with fresh registers at each round. In the latter model, both the number of processes and the number of registers are unbounded, making verification particularly challenging. The properties studied are generic presence reachability objectives, which subsume classical questions such as safety or synchronization by expressing the presence or absence of processes in some states. In the more general round-based setting, we establish that the parameterized verification of presence reachability properties is PSPACE-complete. Moreover, for the roundless model with finitely many registers, we prove that the complexity drops down to NP-complete and we provide several natural restrictions that make the problem solvable in polynomial time.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 We consider the verification of distributed systems composed of an arbitrary number of asynchronous processes. background 0.85 0.46 0.02 asserted 0.79
s1 Processes are identical finite-state machines that communicate by reading from and writing to a shared memory. background 0.79 0.09 0.01 asserted 1.00
s2 Beyond the standard model with finitely many registers, we tackle round-based shared-memory systems with fresh registers at each round. contribution 0.80 0.66 0.03 asserted 0.98
s3 In the latter model, both the number of processes and the number of registers are unbounded, making verification particularly challenging. background 0.81 0.18 0.04 asserted 1.00
s4 The properties studied are generic presence reachability objectives, which subsume classical questions such as safety or synchronization by expressing the presence or absence of processes in some states. contribution 0.47 0.39 0.04 asserted 1.00
s5 In the more general round-based setting, we establish that the parameterized verification of presence reachability properties is PSPACE-complete. result 0.99 0.95 0.71 asserted 1.00
s6 Moreover, for the roundless model with finitely many registers, we prove that the complexity drops down to NP-complete and we provide several natural restrictions that make the problem solvable in polynomial time. result 0.98 0.95 0.16 asserted 1.00

What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v2
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

We consider the verification of distributed systems composed of an arbitrary number of asynchronous processes. Processes are identical finite-state machines that communicate by reading from and writing to a shared memory. Beyond the standard model with finitely many registers, we tackle round-based shared-memory systems with fresh registers at each round. In the latter model, both the number of processes and the number of registers are unbounded, making verification particularly challenging. The properties studied are generic presence reachability objectives, which subsume classical questions such as safety or synchronization by expressing the presence or absence of processes in some states. In the more general round-based setting, we establish that the parameterized verification of presence reachability properties is PSPACE-complete. Moreover, for the roundless model with finitely many registers, we prove that the complexity drops down to NP-complete and we provide several natural restrictions that make the problem solvable in polynomial time.

Human review

How Pith checks papers → · Full audit of this paper →

How the literature uses it

What this paper does with the arXiv papers it cites

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.