Studying Operational Models of Relaxed Concurrency

Petri, Gustavo

doi:10.1007/978-3-319-05119-2_15

Search citation statements

Order By: Relevance

Paper Sections

Select...

Relaxed Memory Models1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2014

Publication Types

Select...

Book2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…axiomatic and operational. Some examples are the axiomatic x86-Tso model [7], which is sound with respect to the Intel and AMD architectures, the axiomatic models for Java and C++ languages [8,9], and the operational models of relaxed memories for programming languages [10,11]. It is also worth to remark the efforts towards unifying frameworks to capture most memory models [12] and the theory of memory models of [13].…”

Section: Relaxed Memory Modelsmentioning

confidence: 99%

Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude?

Alrahman

Andrić

Beggiato

et al. 2014

Rewriting Logic and Its Applications

View full text Add to dashboard Cite

Relaxed memory models offer suitable abstractions of the actual optimizations offered by multi-core architectures and by compilers of concurrent programming languages. Using such abstractions for verification purposes is challenging in part due to their inherent non-determinism which contributes to the state space explosion. Several techniques have been proposed to mitigate those problems so to make verification under relaxed memory models feasible. We discuss how to adopt some of those techniques in a Maude-based approach to language prototyping, and suggest the use of other techniques that have been shown successful for similar verification purposes.

show abstract