Matthias Schaffeld, Rebecca Bernemann, Torben Weis, B. König, V. Matkovic
{"title":"Lifecycle-Based View on Cyber-Physical System Models Using Extended Hidden Markov Models","authors":"Matthias Schaffeld, Rebecca Bernemann, Torben Weis, B. König, V. Matkovic","doi":"10.1109/MEMOCODE57689.2022.9954592","DOIUrl":"https://doi.org/10.1109/MEMOCODE57689.2022.9954592","url":null,"abstract":"Many components of Cyber-Physical Systems (CPS) are designed based on models that represent the assumed behavior of the CPS at the time of deployment. However, significant or continuous small changes in the CPS, as well as wear and tear reduce the effectiveness of the CPS and its model and may lead to a total failure of the overall system. In this paper, we propose a novel lifecycle-based view of CPS models. First, we define the model's lifespan as the period from the initial conception of the model until it is no longer fit to represent the system behavior. For better differentiation, a lifespan is divided into the initial, operation, and adaptation phases. In the initial phase, a known-good baseline performance metric is established for the model's suitability to reflect the system behavior. In the operation phase, the model is used for CPS analysis, data smoothing, and fault location while its suitability is monitored. The adaptation phase is intended for necessary adaptations to the model and to the CPS itself, which lead to new iterations. To implement these lifecycle augmentations of the CPS, we use formal modeling in the form of Hidden Markov Models extended by unobservable transitions (Є-HMMT) to represent the assumed system behavior and compare the data of the observed system behavior with this modeling. In addition, we are testing our proposed formalism by designing a CPS model based on smart home systems and running a simulation for validation. The simulation covers unforeseen system changes and corrupted data.","PeriodicalId":157326,"journal":{"name":"2022 20th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132652513","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Eric Rothstein Morris, Jun Sun, Sudipta Chattopadhyay
{"title":"ORIGAMI: Folding Data Structures to Reduce Timing Side-Channel Leakage","authors":"Eric Rothstein Morris, Jun Sun, Sudipta Chattopadhyay","doi":"10.1109/MEMOCODE57689.2022.9954595","DOIUrl":"https://doi.org/10.1109/MEMOCODE57689.2022.9954595","url":null,"abstract":"Timing channels in a program allow attackers to infer secret information being processed. To avoid introducing timing channels, programmers should follow Constant-Time Programming (CTP) guidelines or rely on repair tools that prevent leakage of information via timing channels. Existing repair tools prevent this leakage when programs have branches or loops whose behaviour depends on secrets; however, these repair tools do not efficiently prevent the leakage that occurs if the program accesses a data structure using secret indices. In this work, we present ORIGAMI, a set of repair rules to enforce constant read/write operations on fixed-size, multidimensional data structures so that accessing them via secret indices does not leak information. We implement ORIGAMI as a series of LLVM optimisation passes and evaluate ORIGAMI with programs from Tomcrypt and GDK libraries. Evaluation with the repaired programs using an accurate simulator (GEM5) confirms that our approach indeed repairs the timing channels in practice.","PeriodicalId":157326,"journal":{"name":"2022 20th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123616111","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Mechanization of a Large DSML: An Experiment with AADL and Coq","authors":"J. Hugues, L. Wrage, J. Hatcliff, D. Stewart","doi":"10.1109/MEMOCODE57689.2022.9954589","DOIUrl":"https://doi.org/10.1109/MEMOCODE57689.2022.9954589","url":null,"abstract":"Domain-Specific Modeling Languages (DSMLs) rely on model-based techniques to deliver tailored languages to meet specific needs, such as system modeling, formal verification, and code generation. A DSML has specific static and dynamic behavior rules that must be properly assessed before processing the model. The definition of these rules remains a challenge. Meta-modeling techniques usually lack the foundational elements required to fully express behavioral semantics. In this context, using an interactive theorem prover provides a mathematical foundation with which the semantics of a DSML can be defined. This includes an abstract syntax tree, typing rules, and derivation of an executable simulator. In this paper, we report on an ongoing effort to capture the SAE AADL language using Coq along with specific analysis capabilities. Our contribution provides an unambiguous semantics for a large set of the language and can be used as a foundation to build rich analysis capabilities.","PeriodicalId":157326,"journal":{"name":"2022 20th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126912895","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Real-Time Scheduling of Machine Learning Operations on Heterogeneous Neuromorphic SoC","authors":"Anup Das","doi":"10.1109/MEMOCODE57689.2022.9954596","DOIUrl":"https://doi.org/10.1109/MEMOCODE57689.2022.9954596","url":null,"abstract":"Neuromorphic Systems-on-Chip (NSoCs) are becoming heterogeneous by integrating general-purpose processors (GPPs) and neural processing units (NPUs) on the same SoC. For embedded systems, an NSoC may need to execute user applications built using a variety of machine learning models. We propose a real-time scheduler, called PRISM, which can schedule machine learning models on a heterogeneous NSoC either individually or concurrently to improve their system performance. PRISM consists of the following four key steps. First, it constructs an interprocessor communication (IPC) graph of a machine learning model from a mapping and a self-timed schedule. Second, it creates a transaction order for the communication actors and embeds this order into the IPC graph. Third, it schedules the graph on an NSoC by overlapping communication with the computation. Finally, it uses a Hill Climbing heuristic to explore the design space of mapping operations on GPPs and NPUs to improve the performance. Unlike existing schedulers which use only the NPUs of an NSoC, PRISM improves performance by enabling batch, pipeline, and operation parallelism via exploiting a platform's heterogeneity. For use-cases with concurrent applications, PRISM uses a heuristic resource sharing strategy and a non-preemptive scheduling to reduce the expected wait time before concurrent operations can be scheduled on contending resources. Our extensive evaluations with 20 machine learning workloads show that PRISM significantly improves the performance per watt for both individual applications and use-cases when compared to state-of-the-art schedulers.","PeriodicalId":157326,"journal":{"name":"2022 20th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125422222","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}