Networcat: applying analysis techniques of shared memory software on message-passing distributed systems.
Saved in:
| Title: | Networcat: applying analysis techniques of shared memory software on message-passing distributed systems. |
|---|---|
| Authors: | Bajczi, Levente1 (AUTHOR) levente.bajczi@edu.bme.hu, Molnár, Vince1 (AUTHOR) molnar.vince@vik.bme.hu |
| Source: | Software & Systems Modeling. Oct2025, Vol. 24 Issue 5, p1495-1514. 20p. |
| Subjects: | Communication models, Distributed computing, Reliability in engineering, Computer network protocols, Computer memory management, TCP/IP |
| Abstract: | Communication models are a key aspect in the design and implementation of distributed system architectures. Application logic must consider the guarantees of these models, which fundamentally influence its correctness. Modern multi-core processor architectures face a similar problem when it comes to accessing shared memory: the guarantees of an architecture have a fundamental impact on the observable behavior of software. The formalization of these guarantees in a declarative way has led to powerful tools and algorithms to define reusable constraints on patterns of memory access events and their relationships, enabling the efficient description and automatic formal analysis of software properties with respect to a specific architecture. The Cat memory modeling language provides a standard means of specifying these constraints. Despite the parallels, the axiomatic modeling and analysis of communication models in distributed systems remain a relatively unexplored area. In this paper, we address this gap and demonstrate how communication models can be mapped to the Cat language. We create a standard library of reusable patterns and demonstrate our approach, called NetworCat, on the simple examples of UDP and TCP, and we also present its applicability to the vastly configurable OMG-DDS service. This adaptation-based approach enables the use of ever-improving verification tools built for shared memory concurrency on distributed systems. We believe this not only benefits distributed system analyses by broadening the toolset for verification but also positively impacts the field of memory-model-aware verification by widening its audience to another domain. [ABSTRACT FROM AUTHOR] |
| Copyright of Software & Systems Modeling is the property of Springer Nature 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: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| FullText | Links: – Type: pdflink Text: Availability: 1 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 187888141 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Networcat: applying analysis techniques of shared memory software on message-passing distributed systems. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Bajczi%2C+Levente%22">Bajczi, Levente</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> levente.bajczi@edu.bme.hu</i><br /><searchLink fieldCode="AR" term="%22Molnár%2C+Vince%22">Molnár, Vince</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> molnar.vince@vik.bme.hu</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Software+%26+Systems+Modeling%22">Software & Systems Modeling</searchLink>. Oct2025, Vol. 24 Issue 5, p1495-1514. 20p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Communication+models%22">Communication models</searchLink><br /><searchLink fieldCode="DE" term="%22Distributed+computing%22">Distributed computing</searchLink><br /><searchLink fieldCode="DE" term="%22Reliability+in+engineering%22">Reliability in engineering</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+network+protocols%22">Computer network protocols</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+memory+management%22">Computer memory management</searchLink><br /><searchLink fieldCode="DE" term="%22TCP%2FIP%22">TCP/IP</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Communication models are a key aspect in the design and implementation of distributed system architectures. Application logic must consider the guarantees of these models, which fundamentally influence its correctness. Modern multi-core processor architectures face a similar problem when it comes to accessing shared memory: the guarantees of an architecture have a fundamental impact on the observable behavior of software. The formalization of these guarantees in a declarative way has led to powerful tools and algorithms to define reusable constraints on patterns of memory access events and their relationships, enabling the efficient description and automatic formal analysis of software properties with respect to a specific architecture. The Cat memory modeling language provides a standard means of specifying these constraints. Despite the parallels, the axiomatic modeling and analysis of communication models in distributed systems remain a relatively unexplored area. In this paper, we address this gap and demonstrate how communication models can be mapped to the Cat language. We create a standard library of reusable patterns and demonstrate our approach, called NetworCat, on the simple examples of UDP and TCP, and we also present its applicability to the vastly configurable OMG-DDS service. This adaptation-based approach enables the use of ever-improving verification tools built for shared memory concurrency on distributed systems. We believe this not only benefits distributed system analyses by broadening the toolset for verification but also positively impacts the field of memory-model-aware verification by widening its audience to another domain. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Software & Systems Modeling is the property of Springer Nature 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=egs&AN=187888141 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s10270-024-01258-x Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 20 StartPage: 1495 Subjects: – SubjectFull: Communication models Type: general – SubjectFull: Distributed computing Type: general – SubjectFull: Reliability in engineering Type: general – SubjectFull: Computer network protocols Type: general – SubjectFull: Computer memory management Type: general – SubjectFull: TCP/IP Type: general Titles: – TitleFull: Networcat: applying analysis techniques of shared memory software on message-passing distributed systems. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Bajczi, Levente – PersonEntity: Name: NameFull: Molnár, Vince IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 10 Text: Oct2025 Type: published Y: 2025 Identifiers: – Type: issn-print Value: 16191366 Numbering: – Type: volume Value: 24 – Type: issue Value: 5 Titles: – TitleFull: Software & Systems Modeling Type: main |
| ResultId | 1 |
