Specifying and Verifying Programs Over the MCA ARMv8 Architecture with TLA+
- 23 June 2025
- journal article
- Published by World Scientific Pub Co Pte Ltd in Journal of Circuits, Systems and Computers
- Vol. 35 (01)
Abstract
Modern hardware architectures and mainstream programming languages employ relaxed memory models for efficiency purposes. However, these memory models may bring in many behaviors which do not adhere to people’s intuition. In addition, different relaxed memory models produce different relaxed behaviors. The existing facts make the verification of the multi-threaded programs running against these models more difficult. In this paper, we are committed to proposing a general framework for modeling and verifying programs over various relaxed memory models, and we take the MCA ARMv8 architecture as an example. This architecture allows out-of-order execution through thread-local out-of-order, speculative execution and thread-local buffering. Above all, through analyzing the dependencies among statements, any program under MCA ARMv8 is translated into a unified form, which has the ability to describe each program under various memory models. Then, we model the translated programs with the formal specification language TLA[ ], and verify three properties, namely Reordering, Read-after-write elimination and Barriers, by the model checker TLC. Our verification results indicate that these properties align with the specification of MCA ARMv8. This not only validates the effectiveness of our method but also provides a more consistent approach for ensuring program correctness across a wide range of memory models.Keywords
Funding Information
- National Natural Science Foundation of China (62032024)
- Open Project of Shanghai Key Laboratory of Trustworthy Computing, the Fundamental Research Funds for the Central Universities (2232024D-26)
- Digital Silk Road Shanghai International Joint Lab of Trustworthy Intelligent Software (22510750100)
This publication has 22 references indexed in Scilit:
- View-based axiomatic reasoning for the weak memory models PSO and SRAScience of Computer Programming, 2024
- Modelling and Verifying Programs Under the Total Store Order Memory Model in an Algebraic Semantics Style2024
- Reliability-Aware Personalized Deployment of Approximate Computation IoT Applications in Serverless Mobile Edge ComputingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2024
- Trace Semantics and Algebraic Laws for Total Store Order Memory ModelJournal of Computer Science and Technology, 2021
- Specification and Verification of the Zab Protocol with TLA+Journal of Computer Science and Technology, 2020
- Value-Dependent Information-Flow Security on Weak Memory Models2019
- A Better x86 Memory Model: x86-TSO2009
- Model Checking TLA+ Specifications1999
- Shared memory consistency models: a tutorialComputer, 1996
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess ProgramsIEEE Transactions on Computers, 1979