Relational Thread-Modular Abstract Interpretation Under Relaxed Memory Models

Suzanne, Thibault; Miné, Antoine

doi:10.1007/978-3-030-02768-1_6

Cited by 10 publications

(6 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is tailored to the verification of algorithms that do not rely on explicit synchronization via mutexes such as the Bakery algorithm. Suzanne and Miné [55] extend the previous work to handle weak memory effects (PSO, TSO) by incorporating memory buffers into the thread-local se-mantics. The notion of interferences is also used by Sharma and Sharma [50] for the analysis of programs under the Release/Acquire Memory Model of C11 by additionally tracking abstractions of modification sequences for global variables.…”

Section: Related Workmentioning

confidence: 98%

Clustered Relational Thread-Modular Abstract Interpretation with Local Traces

Schwarz¹,

Saan²,

Seidl³

et al. 2023

Preprint

View full text Add to dashboard Cite

We construct novel thread-modular analyses that track relational information for potentially overlapping clusters of global variables -given that they are protected by common mutexes. We provide a framework to systematically increase the precision of clustered relational analyses by splitting control locations based on abstractions of local traces. As one instance, we obtain an analysis of dynamic thread creation and joining. Interestingly, tracking less relational information for globals may result in higher precision. We consider the class of 2-decomposable domains that encompasses many weakly relational domains (e.g., Octagons). For these domains, we prove that maximal precision is attained already for clusters of globals of sizes at most 2.

show abstract

Section: Related Workmentioning

confidence: 98%

Clustered Relational Thread-Modular Abstract Interpretation with Local Traces

Schwarz¹,

Saan²,

Seidl³

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…The goal of this paper is to better understand this intriguing incomparability and develop precision improvements to refine these analyses. We concentrate only on the basic setting of non-relational analysis and a concurrent setting without precise thread id s. We also ignore add-ons such as thread priorities or effects of weak memory, which are of major concern in [1,5,19,20]. As a common framework for the comparison, we use side-effecting constraint systems [2].…”

Section: ⊓ ⊔mentioning

confidence: 99%

Improving Thread-Modular Abstract Interpretation

Schwarz¹,

Saan²,

Seidl³

et al. 2021

Preprint

View full text Add to dashboard Cite

We give thread-modular non-relational value analyses as abstractions of a local trace semantics. The semantics as well as the analyses are formulated by means of global invariants and side-effecting constraint systems. We show that a generalization of the analysis provided by the static analyzer Goblint as well as a natural improvement of Antoine Miné's approach can be obtained as instances of this general scheme. We show that these two analyses are incomparable w.r.t. precision and provide a refinement which improves on both precision-wise. We also report on a preliminary experimental comparison of the given analyses on a meaningful suite of benchmarks.

show abstract

“…Under SC, techniques have been proposed for flow-insensitive [33] and flow-sensitive [34] TMA with AI. TMA with AI has also been used to verify programs under weak memory models [35] [36]. While these techniques are sound, they may suffer from false alarms.…”

Section: Related Workmentioning

confidence: 99%

Dynamic Verification of C/C++11 Concurrency over Multi Copy Atomics

Singh,

Sharma,

Sharma

2021

Preprint

View full text Add to dashboard Cite

We investigate the problem of runtime analysis of C11 programs under Multi-Copy-Atomic semantics (MCA ). Under MCA , one can analyze program outcomes solely through interleaving and reordering of thread events. As a result, obtaining intuitive explanations of program outcomes becomes straightforward. Newer versions of ARM (ARMv8 and later), Alpha, and Intel's x-86 support MCA . Our tests reveal that state-of-the-art dynamic verification techniques that analyze program executions under the C11 memory model generate safety property violations that can be interpreted as false alarms under MCA semantics. Sorting the true from false violations puts an undesirable burden on the user. In this work, we provide a dynamic verification technique (MoCA) to analyze C11 program executions which are permitted under the MCA model. We design a happens-before relation and introduce coherence rules to capture precisely those C11 program executions which are allowed under the MCA model. MoCA's exploration of the state-space is based on the state-of-the-art dynamic verification algorithm, source-DPOR. Our experiments validate that MoCA captures all coherent C11 program executions, and is precise for the MCA model. 1 ARMv8 calls its model other-MCA [8]. The difference with MCA is of terminology, not semantics (as clarified by [9]).

show abstract

Relational Thread-Modular Abstract Interpretation Under Relaxed Memory Models

Cited by 10 publications

References 20 publications

Clustered Relational Thread-Modular Abstract Interpretation with Local Traces

Clustered Relational Thread-Modular Abstract Interpretation with Local Traces

Improving Thread-Modular Abstract Interpretation

Dynamic Verification of C/C++11 Concurrency over Multi Copy Atomics

Contact Info

Product

Resources

About