Academic Journal
A Lightweight Modeling and Verification Framework for Programs Over Weak Memory Models in an Algebraic Semantics Style.
| Title: | A Lightweight Modeling and Verification Framework for Programs Over Weak Memory Models in an Algebraic Semantics Style. |
|---|---|
| Authors: | Xiao, Lili, Zhu, Huibiao, Bowen, Jonathan P. |
| Source: | Journal of Software: Evolution & Process; Jul2026, Vol. 38 Issue 7, p1-21, 21p |
| Subject Terms: | Consistency models (Computers), Programming language semantics, Semantics methodology, ARM microprocessors, Parallel programs (Computer programs), Software verification |
| Abstract: | Modeling and verification of multithreaded programs are difficult since one must consider all the ways that instructions in different threads can be interleaved. Modern hardware architectures and mainstream programming languages employ weak memory models (WMMs) for efficiency reasons, and the additional interleavings from them make the modeling and verification more complex. In addition, different WMMs cause various relaxed‐memory effects, and their operational semantics has distinguished expressions and transition rules. On this basis, multiple algorithms are required to be designed to conduct verification on programs over WMMs. In this paper, we propose a lightweight modeling and verification framework for programs over WMMs. Above all, we apply Unifying Theories of Programming (UTP) to investigate the unified algebraic semantics. A set of algebraic laws are explored, which can dynamically generate configuration sequences of programs under WMMs. Two memory models, total store order (TSO) implemented in the ×$$ \times $$86 architecture and SPARC implementations, and ARMv8 supported by the ARM architecture, are used to instantiate the proposed algebraic modeling method. During this process, we record the data state of each configuration and define properties capturing the unique features of the TSO and ARMv8 memory models, and then check whether the properties are satisfied. The algebraic laws are implemented in the rewriting engine Maude, and the verification is also conducted in Maude. The verification results show that the properties all agree with our expectations. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of Software: Evolution & Process is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Complementary Index |
| FullText | Links: – Type: other Text: Availability: 0 |
|---|---|
| Header | DbId: edb DbLabel: Complementary Index An: 195655455 RelevancyScore: 1082 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 1082.42175292969 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: A Lightweight Modeling and Verification Framework for Programs Over Weak Memory Models in an Algebraic Semantics Style. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Xiao%2C+Lili%22">Xiao, Lili</searchLink><br /><searchLink fieldCode="AR" term="%22Zhu%2C+Huibiao%22">Zhu, Huibiao</searchLink><br /><searchLink fieldCode="AR" term="%22Bowen%2C+Jonathan+P%2E%22">Bowen, Jonathan P.</searchLink> – Name: TitleSource Label: Source Group: Src Data: Journal of Software: Evolution & Process; Jul2026, Vol. 38 Issue 7, p1-21, 21p – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22Consistency+models+%28Computers%29%22">Consistency models (Computers)</searchLink><br /><searchLink fieldCode="DE" term="%22Programming+language+semantics%22">Programming language semantics</searchLink><br /><searchLink fieldCode="DE" term="%22Semantics+methodology%22">Semantics methodology</searchLink><br /><searchLink fieldCode="DE" term="%22ARM+microprocessors%22">ARM microprocessors</searchLink><br /><searchLink fieldCode="DE" term="%22Parallel+programs+%28Computer+programs%29%22">Parallel programs (Computer programs)</searchLink><br /><searchLink fieldCode="DE" term="%22Software+verification%22">Software verification</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Modeling and verification of multithreaded programs are difficult since one must consider all the ways that instructions in different threads can be interleaved. Modern hardware architectures and mainstream programming languages employ weak memory models (WMMs) for efficiency reasons, and the additional interleavings from them make the modeling and verification more complex. In addition, different WMMs cause various relaxed‐memory effects, and their operational semantics has distinguished expressions and transition rules. On this basis, multiple algorithms are required to be designed to conduct verification on programs over WMMs. In this paper, we propose a lightweight modeling and verification framework for programs over WMMs. Above all, we apply Unifying Theories of Programming (UTP) to investigate the unified algebraic semantics. A set of algebraic laws are explored, which can dynamically generate configuration sequences of programs under WMMs. Two memory models, total store order (TSO) implemented in the ×$$ \times $$86 architecture and SPARC implementations, and ARMv8 supported by the ARM architecture, are used to instantiate the proposed algebraic modeling method. During this process, we record the data state of each configuration and define properties capturing the unique features of the TSO and ARMv8 memory models, and then check whether the properties are satisfied. The algebraic laws are implemented in the rewriting engine Maude, and the verification is also conducted in Maude. The verification results show that the properties all agree with our expectations. [ABSTRACT FROM AUTHOR] – Name: Abstract Label: Group: Ab Data: <i>Copyright of Journal of Software: Evolution & Process is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edb&AN=195655455 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1002/smr.70149 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 21 StartPage: 1 Subjects: – SubjectFull: Consistency models (Computers) Type: general – SubjectFull: Programming language semantics Type: general – SubjectFull: Semantics methodology Type: general – SubjectFull: ARM microprocessors Type: general – SubjectFull: Parallel programs (Computer programs) Type: general – SubjectFull: Software verification Type: general Titles: – TitleFull: A Lightweight Modeling and Verification Framework for Programs Over Weak Memory Models in an Algebraic Semantics Style. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Xiao, Lili – PersonEntity: Name: NameFull: Zhu, Huibiao – PersonEntity: Name: NameFull: Bowen, Jonathan P. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 07 Text: Jul2026 Type: published Y: 2026 Identifiers: – Type: issn-print Value: 20477473 Numbering: – Type: volume Value: 38 – Type: issue Value: 7 Titles: – TitleFull: Journal of Software: Evolution & Process Type: main |
| ResultId | 1 |