Parameterized Verification of Asynchronous Shared-Memory Systems

DOI10.1145/2842603zbMath1426.68169arXiv1304.1185MaRDI QIDQ3177767

Pierre Ganty, Javier Esparza, Rupak Majumdar

Publication date: 2 August 2018

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.1185

zbMATH Keywords

decidability; formal languages; asynchronous shared memory; parameterized systems

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q45: Formal languages and automata

68Q60: Specification and verification (program logics, model checking, etc.)

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

Unnamed Item, Model checking parameterized asynchronous shared-memory systems, Fine-grained complexity of safety verification, Verifying the correctness of distributed systems via mergeable parallelism, Liveness in broadcast networks