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

Efficient Algorithm for the Iteration Period Computation of Unfolded Synchronous Dataflow Graphs 展开同步数据流图迭代周期计算的高效算法

2018 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2018-08-01 DOI: 10.1109/TASE.2018.00013

Xue-Yang Zhu

引用次数: 0

Proving Partial-Correctness and Invariance Properties of Transition-System Models 证明过渡系统模型的部分正确性和不变性

2018 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2018-08-01 DOI: 10.1109/TASE.2018.00016

Vlad Rusu, G. Grimaud, M. Hauspie

{"title":"Proving Partial-Correctness and Invariance Properties of Transition-System Models","authors":"Vlad Rusu, G. Grimaud, M. Hauspie","doi":"10.1109/TASE.2018.00016","DOIUrl":"https://doi.org/10.1109/TASE.2018.00016","url":null,"abstract":"We propose a deductive verification approach for proving partial-correctness and invariance properties on transition-system models. Regarding partial correctness, we generalise the recently introduced formalism of Reachability Logic, currently used as a language-parametric logic for programs, to transition systems. We propose a sound and relatively complete proof system for the resulting reachability logic. The soundness of the proof system is formally established in the Coq proof assistant, and the mechanised proof provides us with a Coq-certified Reachability-Logic prover for transition-system models. The relative completeness of the proof system, although theoretical in nature, also has a practical value, as it induces a proof strategy that is guaranteed to prove all valid formulas on a given transition system. The strategy reduces partial-correctness verification to invariance verification; for the latter we propose an incremental technique in order to deal with the case-explosion problem that affects it. All these techniques were instrumental in enabling us to prove, within reasonable time and effort limits, that the nontrivial algorithm implemented in security hypervisor that we designed in earlier work meets its expected functional requirements.","PeriodicalId":123441,"journal":{"name":"2018 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126706189","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

Modeling and Verifying TopoGuard in OpenFlow-Based Software Defined Networks 基于openflow的软件定义网络中TopoGuard的建模与验证

2018 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2018-08-01 DOI: 10.1109/TASE.2018.00019

Shuangqing Xiang, Huibiao Zhu, Lili Xiao, Wanling Xie

{"title":"Modeling and Verifying TopoGuard in OpenFlow-Based Software Defined Networks","authors":"Shuangqing Xiang, Huibiao Zhu, Lili Xiao, Wanling Xie","doi":"10.1109/TASE.2018.00019","DOIUrl":"https://doi.org/10.1109/TASE.2018.00019","url":null,"abstract":"Software Defined Networking (SDN) is an emerging networking paradigm, which provides flexible network programmability and eases the complexity of network control and management. The OpenFlow protocol is the best-known southbound interface of SDN. As the core of a software-defined network, a controller collects topology information of the entire network in order to manage the network as well as provide services to topology-dependent applications. The accuracy of topology information gained by a controller is utmost important. However, most of the mainstream OpenFlow controllers suffer from two kinds of topology poisoning attacks: Link Fabrication Attack and Host Hijacking Attack. TopoGuard is the most famous security extension to traditional OpenFlow controllers, providing detection of the two attacks. In this paper, we model TopoGuard, OpenFlow switches, hosts and two kinds of attackers using Communication Sequential Processes (CSP). Moreover, we encode the proposed model into Process Analysis Toolkit (PAT), a model checker. Finally, we use PAT to verify whether TopoGuard is able to detect the two attacks in some specific scenarios.","PeriodicalId":123441,"journal":{"name":"2018 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117040294","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}

引用次数: 6

An Improved LLF Scheduling for Reducing Maximum Heap Memory Consumption by Considering Laxity Time 考虑松弛时间减少最大堆内存消耗的改进LLF调度

2018 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2018-08-01 DOI: 10.1109/TASE.2018.00027

Yuki Machigashira, A. Nakata

{"title":"An Improved LLF Scheduling for Reducing Maximum Heap Memory Consumption by Considering Laxity Time","authors":"Yuki Machigashira, A. Nakata","doi":"10.1109/TASE.2018.00027","DOIUrl":"https://doi.org/10.1109/TASE.2018.00027","url":null,"abstract":"Real-time embedded systems are often designed as multiprocessor systems in order to achieve both low power consumption and high-performance. Also, they are often implemented as multitasking systems in order to meet deadline constraints of response times for multiple external inputs. However, multitasking systems often increase heap memory consumption allocated for temporal use, because the allocated memories for tasks often remain allocated simultaneously when the tasks are suspended for switching to the other task. In order to reduce memory consumption in real-time multitasking, in this paper we propose an improved real-time scheduling algorithm based on LLF (Least Laxity First) to reduce maximal heap memory consumption by controlling multitask scheduling, without modifying the processing order of each task. The proposed algorithm firstly performs LLF schedulability analysis (proposed in [5]) in each scheduling cycle and then switches between LLF and our proposed Least Memory Consumption First (LMCF) scheduling policies appropriately according to the analysis result. The proposed LMCF scheduling assumes that the amount of the heap memory allocation in the next step near future for each task can be predicted and according to the prediction it selects the least ones as many as the number of the processors for schedule. We evaluate the effectiveness of the proposed algorithm by comparing the heap memory reduction ratio of the proposed algorithm with that of LLF scheduling.","PeriodicalId":123441,"journal":{"name":"2018 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115954162","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}

引用次数: 5

[Copyright notice] (版权)

2018 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2018-08-01 DOI: 10.1109/tase.2018.00003

引用次数: 0

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

2018 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2018-08-01 DOI: 10.1109/TASE.2018.00028

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

引用次数: 7

RepassDroid: Automatic Detection of Android Malware Based on Essential Permissions and Semantic Features of Sensitive APIs RepassDroid:基于关键权限和敏感api语义特征的Android恶意软件自动检测

2018 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2018-08-01 DOI: 10.1109/TASE.2018.00015

Niannian Xie, Fanping Zeng, Xiaoxia Qin, Yu Zhang, Mingsong Zhou, Chengcheng Lv

{"title":"RepassDroid: Automatic Detection of Android Malware Based on Essential Permissions and Semantic Features of Sensitive APIs","authors":"Niannian Xie, Fanping Zeng, Xiaoxia Qin, Yu Zhang, Mingsong Zhou, Chengcheng Lv","doi":"10.1109/TASE.2018.00015","DOIUrl":"https://doi.org/10.1109/TASE.2018.00015","url":null,"abstract":"Most current literature on Android malware pays particular attention to the features of applications. Much of them focus on permissions or APIs, neglecting the behavioral semantics of applications, and the literature considering behavioral semantics is often expensive and weak in extendibility. In this paper, we introduce RepassDroid - a relatively coarse-grained but faster tool for automatic Android malware detection. We define Generalized-sensitive API and emphasize on considering if the trigger points of generalized-sensitive APIs are UI-related or not. It analyzes the application by abstracting the generalized sensitive API with its trigger point as the semantic feature, with the addition of Really-essential Permission as the syntax feature. Then it utilizes machine learning to automatically determine whether an application is benign or malicious. We evaluate RepassDroid on 24288 samples in total, 20000 for training and 4288 for test. With the comparative experiments, we find that Random Forest is the optimal classification technique for our feature set, achieving 97.7% accuracy and 0.99 AUC, along with a malware classification precision as high as 99.3%. Our evaluation results confirm that our approach and the feature set are logical and effective for Android malware detection.","PeriodicalId":123441,"journal":{"name":"2018 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131903767","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}

引用次数: 11

Observational Models for Linearizability Checking on Weak Memory Models 弱记忆模型线性化检验的观测模型

2018 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2018-08-01 DOI: 10.1109/TASE.2018.00021

Kirsten Winter, Graeme Smith, J. Derrick

引用次数: 4

Formalization and Verification of AUTOSAR OS Standard's Memory Protection AUTOSAR OS标准内存保护的形式化与验证

2018 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2018-08-01 DOI: 10.1109/TASE.2018.00017

Khanh Trinh Le, Yuki Chiba, Toshiaki Aoki

{"title":"Formalization and Verification of AUTOSAR OS Standard's Memory Protection","authors":"Khanh Trinh Le, Yuki Chiba, Toshiaki Aoki","doi":"10.1109/TASE.2018.00017","DOIUrl":"https://doi.org/10.1109/TASE.2018.00017","url":null,"abstract":"AUTOSAR OS is a standard for automotive operating systems, which provides a specification that consists of functionalities such as scheduling services, timing services, and memory protection. In this paper, we focus on memory protection features among them. As the AUTOSAR OS specification is described in natural language, its ambiguity may confuse developers as well as cause the contradiction of the specification, then eventually lead to serious problems of automotive systems such as bugs and errors. These problems in automotive systems relate directly to the safety of human being. Thus, it is very important to ensure the unambiguity and consistency of the specification. Our solution for the problems is formalizing the AUTOSAR OS specification using Event-B specification language which allows us to formally specify the functionalities of AUTOSAR OS and reduce the ambiguity of natural language. We developed a formal specification of the memory protection of AUTOSAR OS and verified its consistency. In this verification, we found the inconsistency of the specification during discharging proof obligations generated by RODIN which is a tool for Event-B. This inconsistency comes from the ambiguity of the original specification, and finding it by reviewing based on natural language description is very hard. In this paper, we explain how we found the inconsistency existed in the AUTOSAR OS standard after showing our approach to formalize and verify it with Event-B.","PeriodicalId":123441,"journal":{"name":"2018 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123334721","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}

引用次数: 4

Telling Lies in Process Algebra 在过程代数中说谎

2018 International Symposium on Theoretical Aspects of Software Engineering (TASE) Pub Date : 2018-08-01 DOI: 10.1109/TASE.2018.00023

M. Mousavi, M. Varshosaz

引用次数: 1