Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems

Abstract

Abstract. The parameterized verification of concurrent algorithms and protocols has been addressed by a variety of recent methods. Experience shows that there is a trade-off between techniques which are widely applicable but depend on nontrivial human guidance, and fully automated approaches which are tailored for narrow classes of applications. In this spectrum, we propose a new framework based on environment abstraction which exhibits a large degree of automation and can be easily adjusted to different fields of application. Our approach is based on two insights: First, we argue that natural abstractions for concurrent software are derived from the "Ptolemaic" perspective of a human engineer who focuses on a single reference process. For this class of abstractions, we demonstrate soundness of abstraction under very general assumptions. Second, most protocols in given a class of protocols -for instance, cache coherence protocols and mutual exclusion protocols -can be modeled by small sets of high level compound statements. These two insights allow to us efficiently build precise abstract models for given protocols which can then be model checked. We demonstrate the power of our method by applying it to various well known classes of protocols.

Towards Modeling and Model Checking Fault-Tolerant Distributed Algorithms

“…Intuitively, dining philosophers requires us to trace indexed processes along a computation, e.g., ∀i. G (hungry i → (F eating i )), and thus to employ indexed temporal logics for specifications [7,11,12,14].…”

Parametric flows: Automated behavior equivalencing for symbolic analysis of races in CUDA programs

“…Many of our results were obtained with respect to symbolic inputs 3 . For instance, as reported in [15] for runs using GKLEE, the Histogram64 example's race will be almost impossible to detect unless the first 10 bytes of a certain array are made symbolic (the same symbolic setting was used in runs using GKLEEp also).…”

“…This demonstrates the added analysis power offered by GKLEEp. VII. RELATED WORK Past techniques [21], [3] generate finite-state abstractions of parameterized systems, apply induction [20], or seek cut-off bounds [6]. These techniques either require manual effort and do not apply to GPUs.…”

Para $$^2$$ 2 : parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms

“…Hence, FTDAs force us to develop parameterized verification methods. The problem we consider is concerned with parameterized model checking, for which many interesting results exist [14,15,[21][22][23]35]; cf. [7] for a survey.…”