TY - INPR A1 - Murr, Florian A1 - Mauerer, Wolfgang T1 - McFSM: Near Turing-Complete Finite-State Based Programming N2 - Finite state machines (FSMs) are an appealing mechanism for simple practical computations: They lend themselves to very effcient and deterministic implementation, are easy to understand, and allow for formally proving many properties of interest. Unfortunately, their computational power is deemed insuffcient for many tasks, and their usefulness has been further hampered by the state space explosion problem and other issues when naïvely trying to scale them to sizes large enough for many real–life applications. This paper expounds on theory and implementation of multiple coupled fnite state machines (McFSMs), a novel mechanism that combines benefits of FSMs with near Turing-complete, practical computing power, and that was designed from the ground up to support static analysis and reasoning. We develop an elaborate category–theoretical foundation based on non–deterministic Mealy machines, which gives a suitable algebraic description for novel ways of blending di#erent computing models. Our experience is based on a domain specific language and an integrated development environment that can compile McFSM models to multiple target languages, applying it to use-cases based on industrial scenarios. We discuss properties and advantages of McFSMs, explain how the mechanism can interact with real–world systems and existing code without sacrificing provability, determinism or performance. We discuss how McFSMs can be used to replace and improve on commonly employed programming patterns, and show how their effcient handling of large state spaces enables them to be used as core building blocks for distributed, safety critical, and real–time systems of industrial complexity, which contributes to the longdesired goal of providing executable specifications. KW - Finite state machines KW - Mealy machines KW - automata KW - coupled machines KW - executable specifcation KW - category theory KW - generative approaches KW - formal models KW - static analysis Y1 - 2021 UR - https://www.lfdr.de/Publications/2021/MuMa21.pdf ER - TY - GEN A1 - Mauerer, Wolfgang A1 - Joblin, Mitchell A1 - Tamburri, Damian Andrew A1 - Paradis, Carlos A1 - Kazman, Rick A1 - Apel, Sven T1 - In Search of Socio-Technical Congruence: A Large-Scale Longitudinal Study [Data set] Y1 - 2021 U6 - https://doi.org/10.5281/zenodo.4766388 N1 - Archive of the accompanying website including all datasets for "In Search of Socio-Technical Congruence: A Large-Scale Longitudinal Study" (IEEE Transactions on Software Engineering): https://doi.org/10.1109/TSE.2021.3082074 ER - TY - GEN A1 - Mauerer, Wolfgang A1 - Scherzinger, Stefanie T1 - Nullius in Verba - Reproducibility Tutorial [Data set] N2 - Reproduction package (docker image) for the ICDE 2021 tutorial "Nullius in Verba". Y1 - 2021 U6 - https://doi.org/10.5281/zenodo.4730023 N1 - In Verbindung mit dem Konferenzbeitrag: Nullius in Verba: Reproducibility for Database Systems Research, Revisited - https://doi.org/10.1109/ICDE51399.2021.00270 ER -