# On the Complexity of Bounded Context Switching

@inproceedings{Chini2017OnTC, title={On the Complexity of Bounded Context Switching}, author={Peter Chini and Jonathan Kolberg and Andreas Krebs and R. Meyer and Prakash Saivasan}, booktitle={ESA}, year={2017} }

Bounded context switching (BCS) is an under-approximate method for finding violations to safety properties in shared memory concurrent programs. Technically, BCS is a reachability problem that is known to be NP-complete. Our contribution is a parameterized analysis of BCS.
The first result is an algorithm that solves BCS when parameterized by the number of context switches (cs) and the size of the memory (m) in O*(m^(cs)2^(cs)). This is achieved by creating instances of the easier problem… Expand

#### 11 Citations

Fine-Grained Complexity of Safety Verification

- Mathematics, Computer Science
- TACAS
- 2018

Formally, it is shown that there is no polynomial kernel, no compression algorithm that reduces D or s to aPolynomial dependence on P and t, which indicates that symbolic methods may be harder to find for this problem. Expand

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

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

Reachability of scope-bounded multistack pushdown systems

- Computer Science
- Inf. Comput.
- 2020

The semantics of a multi-stack pushdown system with scope-bounded matching relations are restricted such that a symbol that is pushed onto a stack can be popped only within a given number of contexts involving s, i.e., the scope of matching push and pop transitions is bound. Expand

Stateless Model Checking under a Reads-Value-From Equivalence

- Computer Science
- CAV
- 2021

This work presents RVF-SMC, a new SMC algorithm that uses a novel reads-value-from (RVF) partitioning, which is provably coarser than recent approaches based on Mazurkiewicz and “reads-from” partitionings. Expand

Parameterized Complexity of Safety of Threshold Automata

- Computer Science
- FSTTCS
- 2020

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

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

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

Ju l 2 01 8 Fast Witness Counting

- 2018

We study the witness-counting problem: given a set of vectors V in the d-dimensional vector space over F2, a target vector t, and an integer k, count all ways to sum-up exactly k different vectors… 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

#### References

SHOWING 1-10 OF 74 REFERENCES

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

Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis

- Computer Science
- CAV
- 2008

This paper gives a general reduction from a concurrent program P, and a given context bound K, to a sequential program $P_s^K$ such that the analysis of P can be used to prove properties about K, and gives instances of the reduction for common program models used in model checking, such as Boolean programs and pushdown systems. 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

Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations

- Mathematics, Computer Science
- CONCUR
- 2011

This paper proposes a restriction of the semantics of the general model such that a symbol that is pushed onto a stack can be popped only within a bounded number of context-switches. Expand

Model checking parameterized asynchronous shared-memory systems

- Computer Science
- Formal Methods Syst. Des.
- 2017

The problem is decidable, and has a surprisingly low complexity: it is NP-complete when all processes are finite-state machines, and is in NEXPTIME (and PSPACE-hard) when they are pushdown machines. Expand

On Sequentializing Concurrent Programs

- Computer Science
- SAS
- 2011

A general framework for compositional under-approximate concurrent program analyses by reduction to sequential program analyses is proposed, and a most general instance which considers more executions is identified, by composing the rounds of different tasks in any order. Expand

Parameterized Verification of Asynchronous Shared-Memory Systems

- Computer Science
- J. ACM
- 2016

The results show that a robust, decidable class can be obtained under the assumptions of anonymity and asynchrony, and the problem is undecidable for finite-state machines operating with synchronization primitives, and already for two communicating pushdown machines. Expand

On the Reachability Analysis of Acyclic Networks of Pushdown Systems

- Mathematics, Computer Science
- CONCUR
- 2008

It is proved mainly that the reachability problem between recognizable sets of configurations is decidable for acyclic networks of pushdown systems, and that for lossy channel pushdown networks, the channel language is effectively recognizable. 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

Global Model Checking of Ordered Multi-Pushdown Systems

- Mathematics, Computer Science
- FSTTCS
- 2010

This paper addresses the verification problem of ordered multi-pushdown systems: A multistack extension of pushdown systems that comes with a constraint on stack operations such that a pop can only be performed on the first non-empty stack and obtains an 2ETIME upper bound for the model checking problem of w-regular properties forordered multi- Pushdown systems. Expand