Interface Automata for Shared Memory

Faculty/Professorship: Software Technologies  
Author(s): Schinko, Ayleen; Vogler, Walter; Gareis, Johannes; Nguyen, Ngoc Tri; Lüttgen, Gerald  
Publisher Information: Bamberg : Otto-Friedrich-Universität
Year of publication: 2022
Pages: 36
Source/Other editions: Acta Informatica, 2021, 36 S. - ISSN: 1432-0525
is version of: 10.1007/s00236-021-00408-8
Year of first publication: 2021
Language(s): English
Licence: Creative Commons - CC BY - Attribution 4.0 International 
URN: urn:nbn:de:bvb:473-irb-547181
Interface theories based on Interface Automata (IA) are formalisms for the component-based specification of concurrent systems. Extensions of their basic synchronization mechanism permit the modelling of data, but are studied in more complex settings involving modal transition systems or do not abstract from internal computation. In this article, we show how de Alfaro and Henzinger’s original IA theory can be conservatively extended by shared memory data, without sacrificing simplicity or imposing restrictions. Our extension IA for shared Memory (IAM) decorates transitions with pre- and post-conditions over algebraic expressions on shared variables, which are taken into account by IA’s notion of component compatibility. Simplicity is preserved as IAM can be embedded into IA and, thus, accurately lifts IA’s compatibility concept to shared memory. We also provide a ground semantics for IAM that demonstrates that our abstract handling of data within IA’s open systems view is faithful to the standard treatment of data in closed systems.
GND Keywords: Nebenläufigkeit; Modul; Gemeinsamer Speicher; Beweisführung; Softwareentwicklung
Keywords: Interface Automata, Alfaro and Henzinger’s original IA theory, memory data, ground semantics
DDC Classification: 004 Computer science  
RVK Classification: ST 230   
Type: Article
Release Date: 18. July 2022

File SizeFormat  
fisba54718.pdf1.86 MBPDFView/Open