2019 International Symposium on Theoretical Aspects of Software Engineering (TASE)最新文献_第2页

Automated Test Generation for IEC 61131-3 ST Programs via Dynamic Symbolic Execution 通过动态符号执行的IEC 61131-3 ST程序自动测试生成

2019 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2019-07-01 DOI: 10.1109/TASE.2019.00004

Li Hao, Jianqi Shi, Ting Su, Yanhong Huang

引用次数: 7

An Optimized Partial Rollback Co-simulation Approach for Heterogeneous FMUs 一种优化的异构fmu部分回滚联合仿真方法

2019 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2019-07-01 DOI: 10.1109/TASE.2019.00013

Dehui Du, Yao Wang, Yi Ao, Biao Chen

{"title":"An Optimized Partial Rollback Co-simulation Approach for Heterogeneous FMUs","authors":"Dehui Du, Yao Wang, Yi Ao, Biao Chen","doi":"10.1109/TASE.2019.00013","DOIUrl":"https://doi.org/10.1109/TASE.2019.00013","url":null,"abstract":"Cyber-physical systems (CPS) are generally defined as systems with integrated physical components and computational components. To simulate heterogeneous components of CPS, the Functional Mock-up Interface (FMI) standard provides the co-simulation technology to generate simulation traces. It play significant roles in analyzing and verifying behaviors of CPS. However, the FMI-based co-simulation algorithm called Master Algorithm with Step Revision (SRMA) is inefficient in some common scenarios. To improve the efficiency of SRMA, we propose an optimized Partial Rollback Co-simulation approach, which decreases the number of the rollback operations effectively. The novelty of our approach has two aspects. First, the Key FMUs Extractor and the Input/Output dependencies classification rules are proposed. They help to determine the minimum set of FMUs which are used to rollback for correcting the simulation error. Second, an optimized Master Algorithm with Partial Step Revision (PSRMA) is also proposed. To implement our approach, we also propose an extension for the FMI standard to check whether an FMU implements the function of the threshold crossing detector. The formal definition of the Zero Crossing Detector (ZCD) is presented to guide the construction of ZCD FMUs and evaluate the simulation error of the whole system. To illustrate the feasibility of our approach, two case studies are also discussed.","PeriodicalId":183749,"journal":{"name":"2019 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116941097","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}

引用次数: 1

Android Malware Family Classification and Characterization Using CFG and DFG 基于CFG和DFG的Android恶意软件家族分类与表征

2019 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2019-07-01 DOI: 10.1109/TASE.2019.00-20

Zhiwu Xu, Kerong Ren, Fu Song

{"title":"Android Malware Family Classification and Characterization Using CFG and DFG","authors":"Zhiwu Xu, Kerong Ren, Fu Song","doi":"10.1109/TASE.2019.00-20","DOIUrl":"https://doi.org/10.1109/TASE.2019.00-20","url":null,"abstract":"Android malware has become a serious threat for our daily life, and thus there is a pressing need to effectively mitigate or defend against them. Recently, many approaches and tools to analyze Android malware have been proposed to protect legitimate users from the threat. However, most approaches focus on malware detection, while only a few of them consider malware classification or malware characterization. In this paper, we propose an extension of CDGDroid to classifying and characterizing Android malware families automatically. We first perform static analysis used in CDGDroid to extract control-flow graphs and data-flow graphs on the instruction level. Then we encode the graphs into matrices, and use them to build the family classification models via deep learning. For family characterization, we extract the n-gram sequences from the graphs, which are filtered according to the weights of the classification model built for the target family. And then we construct a vector space model and select the top-k sequences as a characterization of the target family. We have conducted some experiments to evaluate our approach and have identified that the family classification model taking the horizontal combination of CFG and DFG as features offers the best performance in terms of accuracy among all the models. Compared with CDGDroid, Drebin and many antivirus tools gathered in VirusTotal, our family classification model gives a better performance. Finally, We have also conducted experiments on family characterization, and the experimental results have shown that our characterization can capture the malicious behaviors of the testing families.","PeriodicalId":183749,"journal":{"name":"2019 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"18 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134251905","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}

引用次数: 37

Distributed Mediator 分布式的中介

2019 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2019-07-01 DOI: 10.1109/TASE.2019.00-24

Yi Li, Meng Sun

引用次数: 1

Software Complexity Reduction by Automated Refactoring Schema 通过自动重构模式降低软件复杂性

2019 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2019-07-01 DOI: 10.1109/TASE.2019.00005

Siteng Cao, Yongxin Zhao, Ling Shi

引用次数: 0

Hardware Tripartite Synapse Architecture based on Stochastic Computing 基于随机计算的硬件三方突触结构

2019 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2019-07-01 DOI: 10.1109/TASE.2019.00-16

Junxiu Liu, Zhewei Liang, Yuling Luo, Jiadong Huang, Su Yang

{"title":"Hardware Tripartite Synapse Architecture based on Stochastic Computing","authors":"Junxiu Liu, Zhewei Liang, Yuling Luo, Jiadong Huang, Su Yang","doi":"10.1109/TASE.2019.00-16","DOIUrl":"https://doi.org/10.1109/TASE.2019.00-16","url":null,"abstract":"Research showed that the tripartite synapse has the capability of self-repairing in the spiking neural networks (SNNs), where the interactions between astrocyte, neuron and synapse underpin this mechanism. It has been used for the hardware electronic systems to enhance the fault-tolerant abilities, especially for the critical task applications. Due to the complex models of the tripartite synapse, its efficient hardware architecture and scalability are the research challenges. In this paper, an efficient hardware tripartite synapse architecture is proposed which is based on the Stochastic Computing (SC) technique. The SC is used to replace the conventional computing components such as DSPs in the hardware devices, and the extended stochastic logics are used to scale the data range during the calculation process. Results show that the proposed hardware architecture has the same output behaviours as the software simulations and has a low hardware resource consumption (with a reduction rate of >85% compared to state-of-the-art approach) which can maintain the system scalability for large SNNs.","PeriodicalId":183749,"journal":{"name":"2019 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114747168","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}

引用次数: 2

[Copyright notice] (版权)

2019 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2019-07-01 DOI: 10.1109/tase.2019.00003

引用次数: 0

Towards Refinement Semantics of Real-Time Trigger-Response Properties in Event-B Event-B中实时触发响应属性语义的改进

2019 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2019-07-01 DOI: 10.1109/TASE.2019.00-26

Chenyang Zhu, M. Butler, C. Cîrstea

引用次数: 5

A Common Semantic Scoring Method for Chinese Subjective Questions 汉语主观性问题的通用语义评分方法

2019 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2019-07-01 DOI: 10.1109/TASE.2019.00011

Xin-hua Zhu, Qingting Xu, Lanfang Zhang, Hanjun Deng, Hongchao Chen

{"title":"A Common Semantic Scoring Method for Chinese Subjective Questions","authors":"Xin-hua Zhu, Qingting Xu, Lanfang Zhang, Hanjun Deng, Hongchao Chen","doi":"10.1109/TASE.2019.00011","DOIUrl":"https://doi.org/10.1109/TASE.2019.00011","url":null,"abstract":"With the rapid development of computer technologies and artificial intelligence, intelligent tutoring system is increasingly applied to our daily lives. This paper proposes a common semantic scoring method for Chinese subjective questions based on dependencies, modifiers and HowNet. First, we use dependencies to construct question classification predicate formulas for determining the question type and getting the characteristic words in the question. Then, we use dependency chains to extract multiple sets of score points in the answer according to the question type, and to optimize the answer's score points according to the feature words in the question sentence. Finally, we use the common semantic dictionary HowNet to calculate the similarities between the score points that have the same dependencies respectively in the student answers and the standard answer, and to combine the modifiers in answer sentences for calculating the final score of the subjective question. Experimental results show that our proposed method has the advantages of rapidity, accuracy and efficiency, and surpasses many excellent subjective question scoring methods.","PeriodicalId":183749,"journal":{"name":"2019 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127879748","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}

引用次数: 0

ABAC Requirements Engineering for Database Applications ABAC数据库应用需求工程

2019 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2019-07-01 DOI: 10.1109/TASE.2019.00-22

J. Longstaff, Mengda He

引用次数: 1