# Fine-Grained Complexity of Safety Verification

@article{Chini2018FineGrainedCO,
title={Fine-Grained Complexity of Safety Verification},
author={Peter Chini and Roland Meyer and Prakash Saivasan},
journal={ArXiv},
year={2018},
volume={abs/1802.05559}
}
• Published 2018
• Mathematics, Computer Science
• ArXiv
We study the fine-grained complexity of Leader Contributor Reachability (LCR) and Bounded-Stage Reachability (BSR), two variants of the safety verification problem for shared memory concurrent programs. For both problems, the memory is a single variable over a finite data domain. We contribute new verification algorithms and lower bounds based on the Exponential Time Hypothesis (ETH) and kernels. LCR is the question whether a designated leader thread can reach an unsafe state when interacting… Expand
9 Citations
Complexity of Liveness in Parameterized Systems
• Computer Science
• FSTTCS
• 2019
The running times of the composed algorithms match those of reachability, proving that the fine-grained lower bounds for liveness verification are met. Expand
Safety Verification of Parameterized Systems under Release-Acquire
• Computer Science
• ArXiv
• 2021
The results are strong in that they delineate the tractability border for an established semantics and show that the complexity jumps to NEXPTIME-complete for thread-modular verification where an unrestricted distinguished ‘ego’ thread interacts with an environment of CAS-free threads plus loop-free distinguished threads. Expand
Fine-Grained Complexity of Safety Verification
• Computer Science, Physics
• Journal of Automated Reasoning
• 2020
The fine-grained complexity of Leader Contributor Reachability and Bounded-Stage Reachability, two variants of the safety verification problem for shared memory concurrent programs, is studied and the absence of polynomial kernels is proved. Expand
Dynamic Data-Race Detection through the Fine-Grained Lens
• Computer Science
• CONCUR
• 2021
This work establishes several fine-grained separations between many popular notions of dynamic data races, and characterizes the complexity of well-established dynamic race-detection techniques, allowing for a rigorous comparison between them. Expand
A Framework for Consistency Algorithms
• Computer Science
• FSTTCS
• 2020
The framework shows, that despite the hardness, fast deterministic consistency algorithms can be obtained by employing tools from fine-grained complexity, and shows that the obtained algorithms for SC, TSO, PSO, and PSO are optimal in the fine- grained sense. Expand
Parameterized Complexity of Safety of Threshold Automata
The parameterized complexity of reachability of threshold automata is studied and it is shown that the problem becomes W[1]-hard even when parameterized by parameters which are quite small in practice. Expand
Bounded Context Switching for Valence Systems
• Computer Science, Mathematics
• CONCUR
• 2018
The main finding is that reachability within a bounded number of context switches is in NP, independent of the memory (the graph monoid), and therefore contributes a new way to think about BCS. Expand
• Computer Science
• NETYS
• 2019
A polynomial-time algorithm is used to solve liveness and model checking problems for broadcast networks, a system model of identical clients communicating via message passing, which demands that for all computations of a broadcast network, all participating clients satisfy the specification. Expand
F L ] 1 A pr 2 01 9 Liveness in Broadcast Networks
We study two liveness verification problems for broadcast networks, a system model of identical clients communicating via message passing. The first problem is liveness verification. It asks whetherExpand

#### References

SHOWING 1-10 OF 41 REFERENCES
On the Complexity of Bounded Context Switching
• Mathematics, Computer Science
• ESA
• 2017
A parameterized analysis of BCS and proves that BCS admits no polynomial kernel, and an algorithm that solves BCS when parameterized by the number of context switches and the size of the memory in O*(m^ (cs)2^(cs)). Expand
Context-Bounded Model Checking of Concurrent Software
• Computer Science
• TACAS
• 2005
This paper proves that the problem of verifying a concurrent boolean program is decidable, even in the presence of unbounded parallelism, if the analysis is restricted to executions in which the number of context switches is bounded by an arbitrary constant. Expand
Fine-Grained Complexity of Safety Verification
• Computer Science, Physics
• Journal of Automated Reasoning
• 2020
The fine-grained complexity of Leader Contributor Reachability and Bounded-Stage Reachability, two variants of the safety verification problem for shared memory concurrent programs, is studied and the absence of polynomial kernels is proved. Expand
Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems
• Computer Science
• CAV
• 2017
It is shown that verification of general regular properties of traces of executions, satisfying some stuttering condition, is Nexptime-complete for this model of pushdown processes communicating via shared memory. Expand
The Complexity of Predicting Atomicity Violations
• Mathematics, Computer Science
• TACAS
• 2009
It is shown that prediction for regular programs is unlikely to be fixed-parameter tractable in the parameters $(k,|\mathcal{L}|)$ by proving it is W [1]-hard. Expand
Parameterization as Abstraction: A Tractable Approach to the Dataflow Analysis of Concurrent Programs
• Vineet Kahlon
• Computer Science
• 2008 23rd Annual IEEE Symposium on Logic in Computer Science
• 2008
Where as abstract interpretation is used for control and data abstractions, the use of parameterization as an abstraction for concurrency is proposed, to lift two desirable properties of sequential dataflow analysis to the concurrent domain, i.e., precision and scalability. Expand
On parametrized verification of asynchronous, shared-memory pushdown systems
• Mathematics, Computer Science
• ArXiv
• 2016
It is proved that the verifying regular properties of traces of executions, satisfying some stuttering condition, is also decidable in NEXPTIME for this model of parametrized asynchronous shared-memory pushdown systems. Expand
On Atomicity in Presence of Non-atomic Writes
• Computer Science
• TACAS
• 2016
This paper defines the notion of conflict serializability for the Total Store Ordering TSO memory model, and study the relation between TSO-serializability and the well-known notions of SC-serialIZability and robustness, and investigates the algorithmic problem of monitoring program executions for violations ofSerializability. Expand
Model-Checking Parameterized Concurrent Programs Using Linear Interfaces
• Computer Science
• CAV
• 2010
A symbolic model-checker is implemented, and experiments verifying parameterized predicate abstractions of Linux device drivers interacting with a kernel are reported on to show the efficacy of the technique. Expand
On Bounded Reachability Analysis of Shared Memory Systems
• Mathematics, Computer Science
• FSTTCS
• 2014
This paper addresses the reachability problem for pushdown systems communicating via shared memory and proposes a restriction on the behaviours of such systems, called stage bound, towards decidability. Expand