Proof Spaces for Unbounded Parallelism
Abstract
In this paper, we present a new approach to automatically verify multi-threaded programs which are executed by an unbounded number of threads running in parallel.
Related papers
- Duet: Static Analysis for Unbounded Parallelism CAV 2013
- Fairness in Parallel Programs: The Transformational Approach TOPLAS 1988
- Numerically-Robust Inductive Proof Rules for Continuous Dynamical Systems CAV 2019
- Space-Time Interpolants CAV 2018
- Binders unbound ICFP 2011
- Space-Efficient Manifest Contracts POPL 2015
- Automatic Abstraction in SMT-Based Unbounded Software Model Checking CAV 2013
- Semantics-guided synthesis POPL 2021