{"title":"Modelica-Supported Attack Impact Evaluation in Cyber Physical Energy System","authors":"Kaikai Pan, D. Gusain, P. Palensky","doi":"10.1109/HASE.2019.00042","DOIUrl":"https://doi.org/10.1109/HASE.2019.00042","url":null,"abstract":"The evolved smart grid has become a cyber physical energy system that could be exposed to a massive amount of cyber threats. Vulnerabilities within the cyber part can be used to launch multiple types of attacks that corrupt the physical system. The complexity of cyber physical energy system, the existing of different kinds of attacks, require an appropriate tool to aid in modeling and simulation for cyber security analysis. In this paper, we introduce a modeling language Modelica to the security community of cyber physical system. We show the capability of Modelica in modeling complex systems and attacks by building up a power grid model with frequency control loop (i.e., automatic generation control), as well as data integrity attack and data availability attack models. The simulation results show how different types of attacks or even combined attacks can affect the system frequency stability.","PeriodicalId":136378,"journal":{"name":"2019 IEEE 19th International Symposium on High Assurance Systems Engineering (HASE)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131747857","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":"Private Blockchain Network for IoT Device Firmware Integrity Verification and Update","authors":"Samip Dhakal, Fehmi Jaafar, P. Zavarsky","doi":"10.1109/HASE.2019.00033","DOIUrl":"https://doi.org/10.1109/HASE.2019.00033","url":null,"abstract":"","PeriodicalId":136378,"journal":{"name":"2019 IEEE 19th International Symposium on High Assurance Systems Engineering (HASE)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130994614","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}
Nacha Chondamrongkul, Jing Sun, Bingyang Wei, I. Warren
{"title":"Parallel Verification of Software Architecture Design","authors":"Nacha Chondamrongkul, Jing Sun, Bingyang Wei, I. Warren","doi":"10.1109/HASE.2019.00018","DOIUrl":"https://doi.org/10.1109/HASE.2019.00018","url":null,"abstract":"In the component-based software system, certain behaviours of components and their composition may affect system reliability at runtime. This problem can be early detected through the automated verification of software architecture design, by which model checking is one of the techniques to achieve this. However, its practicality and performance issue remain challenges. This paper presents a scalable approach for the software architecture verification. The modelling is proposed to manifest the behaviours in the software component, in order to detect problematic behaviours, such as circular dependency and performance bottleneck. The outcome of the verification identifies the problem and the scenarios that cause it. In order to mitigate the verification performance issue, the parallelism is applied to the verification process so that multiple decomposed models can be simultaneously verified on a multi-threaded environment. As some software systems are designed as the monolithic architecture, we present a method that helps to automatically decompose a large monolithic model into a set of smaller sub-models. Our approach was evaluated and proved to enhance the performance of the verification process for the large-scale complex software systems. Keywords-Software Architecture, Component-based Software, Model Checking, Circular Dependency, Bottleneck","PeriodicalId":136378,"journal":{"name":"2019 IEEE 19th International Symposium on High Assurance Systems Engineering (HASE)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131589542","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":"A Lightweight Framework for Regular Expression Verification","authors":"Xiao Liu, Yufei Jiang, Dinghao Wu","doi":"10.1109/HASE.2019.00011","DOIUrl":"https://doi.org/10.1109/HASE.2019.00011","url":null,"abstract":"Regular expressions and finite state automata have been widely used in programs for pattern searching and string matching. Unfortunately, despite the popularity, regular expressions are difficult to understand and verify even for experienced programmers. Conventional testing techniques remain a challenge as large regular expressions are constantly used for security purposes such as input validation and network intrusion detection. In this paper, we present a lightweight verification framework for regular expressions. In this framework, instead of a large number of test cases, it takes in requirements in natural language descriptions to automatically synthesize formal specifications. By checking the equivalence between the synthesized specifications and target regular expressions, errors will be detected and counterexamples will be reported. We have built a web application prototype and demonstrated its usability with two case studies.","PeriodicalId":136378,"journal":{"name":"2019 IEEE 19th International Symposium on High Assurance Systems Engineering (HASE)","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122546722","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":"Timing Modeling and Analysis for AUTOSAR Schedule Tables","authors":"Rongkun Yan, Jian Guo","doi":"10.1109/HASE.2019.00027","DOIUrl":"https://doi.org/10.1109/HASE.2019.00027","url":null,"abstract":"Schedule table mechanism is an important character of AUTOSAR in addressing its real-time property and flexibility by providing an encapsulation of a static configuration with one or more actions, i.e., events set or tasks activation. As a realtime system, it is non-trivial to analyze schedulability of tasks in AUTOSAR. But it is intractable to analyze schedulability when many schedule tables run at the same time. Moreover, due to the complexity of behavior of schedule tables, the existing schedulability analysis is difficult to be applied to this mechanism. In this paper, we propose a model for AUTOSAR schedule table and give an effective algorithm to assist developers in analyzing schedule tables. A schedule table is formally modeled by a transition system. On the basis of the transition systems, we propose an algorithm to analyze schedulability by checking all the possible schedule scenarios. We show that the problem is polynomial.","PeriodicalId":136378,"journal":{"name":"2019 IEEE 19th International Symposium on High Assurance Systems Engineering (HASE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131084695","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":"Isochronous Execution Models for High-Assurance Real-Time Systems","authors":"B. Alahmad, S. Gopalakrishnan","doi":"10.1109/HASE.2019.00020","DOIUrl":"https://doi.org/10.1109/HASE.2019.00020","url":null,"abstract":"To counter the exorbitant cost of developing certifiable safety-critical software, we propose task execution models that realize an architectural mitigation-based approach to achieving high integrity and highly predictable safety-critical systems. Our premise is that high design assurance levels (DALs) for a software component may be achieved as follows: each system operation that needs a high assurance level will be handled by a software component that has high performance/quality-of-service on average, but built at a lower assurance level, and this component is “monitored” by one (or more) simple component(s) that is (are) predictable, may have lower QoS, but is (are) built at the highest assurance level. The components associated with a software function would run isochronously on separate processors. We present a suite of such isochronous allocation and scheduling problems with varying levels of generality, along with their solutions. We extend our results to the recurrent task model, where tasks should complete before their deadlines. Keywords-isochronous execution, runtime monitor, real-time task scheduling, design assurance levels.","PeriodicalId":136378,"journal":{"name":"2019 IEEE 19th International Symposium on High Assurance Systems Engineering (HASE)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127642069","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":"Vulnerability Analysis of an Automotive Infotainment System's WIFI Capability","authors":"Edwin Franco Myloth Josephlal, Sridhar Adepu","doi":"10.1109/HASE.2019.00044","DOIUrl":"https://doi.org/10.1109/HASE.2019.00044","url":null,"abstract":"","PeriodicalId":136378,"journal":{"name":"2019 IEEE 19th International Symposium on High Assurance Systems Engineering (HASE)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131579015","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":"Quantitative Validation of Formal Domain Models","authors":"A. Iliasov, A. Romanovsky, L. Laibinis","doi":"10.1109/HASE.2019.00013","DOIUrl":"https://doi.org/10.1109/HASE.2019.00013","url":null,"abstract":"Application of formal methods to verification of well-formedness and semantic correctness of data sets from a particular domain becomes increasingly practical with the advances in automated verification tools. However, it is difficult for domain experts to understand and formulate formal verification constraints (VCs), yet much trust is invested in their validity and completeness. The paper discusses a novel validation approach based on statistical testing of VCs against pre-validated data sets. We illustrate the proposed technique using a synthetic railway example and also relate our experience of integrating the approach within a large-scale industry-based project.","PeriodicalId":136378,"journal":{"name":"2019 IEEE 19th International Symposium on High Assurance Systems Engineering (HASE)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125008740","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}
Andreas Schörgenhumer, Mario Kahlhofer, Peter Chalupar, P. Grünbacher, H. Mössenböck
{"title":"A Framework for Preprocessing Multivariate, Topology-Aware Time Series and Event Data in a Multi-System Environment","authors":"Andreas Schörgenhumer, Mario Kahlhofer, Peter Chalupar, P. Grünbacher, H. Mössenböck","doi":"10.1109/HASE.2019.00026","DOIUrl":"https://doi.org/10.1109/HASE.2019.00026","url":null,"abstract":"Monitoring and predicting quality properties of complex systems relies on collecting and analyzing huge amounts of data at run time. Machine learning is frequently adopted to analyze time series and event data, often coming from multiple systems. In such a context, extracting and preprocessing data is an essential but also highly tedious task. In this paper, we thus present an offline preprocessing framework that can handle multivariate time series and event data in a multisystem environment that also takes the system’s topology into account. After a discussion of the key requirements, we present the architecture and implementation of our highly configurable and easy-to-use framework. We demonstrate how the framework allows to extract data and to yield output files for machine learning via configuration settings. In a two-step evaluation, we investigate the framework’s usefulness and scalability. We demonstrate the usefulness in an event prediction case study of real-world multi-system time series data. Our results show the significant impact of different data preprocessing settings on machine learning. Our experiments further demonstrate that processing performance scales linearly with respect to the number of systems and time series.","PeriodicalId":136378,"journal":{"name":"2019 IEEE 19th International Symposium on High Assurance Systems Engineering (HASE)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115310044","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":"Security Evaluation of a VM-Based Intrusion-Tolerant System with Pull-Type Patch Management","authors":"Junjun Zheng, H. Okamura, T. Dohi","doi":"10.1109/HASE.2019.00032","DOIUrl":"https://doi.org/10.1109/HASE.2019.00032","url":null,"abstract":"","PeriodicalId":136378,"journal":{"name":"2019 IEEE 19th International Symposium on High Assurance Systems Engineering (HASE)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114167473","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}