Thread-modular analysis of release-acquire concurrency

DOI10.1007/978-3-030-88806-0_19zbMath1497.68123arXiv2107.02346OpenAlexW3210186253MaRDI QIDQ2145344

Subodh Sharma, Divyanjali Sharma

Publication date: 17 June 2022

Full work available at URL: https://arxiv.org/abs/2107.02346

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Uses Software

• Apron

Cites Work

• Symbolic predictive analysis for concurrent programs
• Abstract interpretation with unfoldings
• A Program Logic for C11 Memory Fences
• Taming release-acquire consistency
• Precise Thread-Modular Abstract Interpretation of Concurrent Programs Using Relational Interference Abstractions
• Owicki-Gries Reasoning for Weak Memory Models
• Abstract interpretation and application to logic programs
• Abstract interpretation
• Unfolding-based Partial Order Reduction
• A promising semantics for relaxed-memory concurrency
• Mathematizing C++ concurrency
• Computer Aided Verification
• Relational thread-modular abstract interpretation under relaxed memory models
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Thread-modular analysis of release-acquire concurrency