2017 22nd International Conference on Engineering of Complex Computer Systems (ICECCS)最新文献

筛选
英文 中文
Integrating Tools: Co-simulation in UPPAAL Using FMI-FMU 集成工具:基于FMI-FMU的UPPAAL联合仿真
P. G. Jensen, K. Larsen, Axel Legay, Ulrik Nyman
{"title":"Integrating Tools: Co-simulation in UPPAAL Using FMI-FMU","authors":"P. G. Jensen, K. Larsen, Axel Legay, Ulrik Nyman","doi":"10.1109/ICECCS.2017.33","DOIUrl":"https://doi.org/10.1109/ICECCS.2017.33","url":null,"abstract":"While standalone tools for verification and modeling have proven useful, their chosen formalism and description-language can at times be restrictive. We demonstrate how to use U PPAAL SMC to analyze controller systems consisting of Function Mockup Units (FMU) modeled in other tools, such as Matlab and Modelica. Apart from supporting FMI-FMU modules the newly added C interface can call any external function. The only requirement for sound analysis is statelessness and determinism of the external function. We demonstrate the expressive power by implementing the FMI-FMU master algorithm as a timed automata, interfacing with external, non-native and non-trivial Function Mockup Units (FMU). We also model two components in U PPAAL SMC exporting one of them as an FMU while keeping the other as a native component. Furthermore we demonstrate the first simulation environment for the Function Mockup Units, capable of checking bounded MITL properties.","PeriodicalId":114056,"journal":{"name":"2017 22nd International Conference on Engineering of Complex Computer Systems (ICECCS)","volume":"3 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128695791","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}
引用次数: 9
Reachability Analysis of Self Modifying Code 自修改代码的可达性分析
Tayssir Touili, Xin Ye
{"title":"Reachability Analysis of Self Modifying Code","authors":"Tayssir Touili, Xin Ye","doi":"10.1109/ICECCS.2017.19","DOIUrl":"https://doi.org/10.1109/ICECCS.2017.19","url":null,"abstract":"Self modifying code is code that modifies its own instructions during execution time. It is nowadays widely used, especially in malware to make the code hard to analyse and to detect by anti-viruses. Thus, the analysis of such self modifying programs is a big challenge. Pushdown systems (PDSs) is a natural model that is extensively used for the analysis of sequential programs because they allow to accurately model procedure calls and mimic the program’s stack. In this work, we propose to extend the PushDown System model with selfmodifying rules. We call the new model Self-Modifying Push- Down System (SM-PDS). A SM-PDS is a PDS that can modify its own set of transitions during execution. We show how SMPDSs can be used to naturally represent self-modifying programs and provide efficient algorithms to compute the backward and forward reachable configurations of SM-PDSs. We implemented our techniques in a tool and obtained encouraging results. In particular, we successfully applied our tool for the detection of self-modifying malware.","PeriodicalId":114056,"journal":{"name":"2017 22nd International Conference on Engineering of Complex Computer Systems (ICECCS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128367682","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}
引用次数: 7
Evaluating Suitability of Applying Blockchain 评估应用区块链的适用性
Sin Kuang Lo, Xiwei Xu, Yin Kia Chiam, Q. Lu
{"title":"Evaluating Suitability of Applying Blockchain","authors":"Sin Kuang Lo, Xiwei Xu, Yin Kia Chiam, Q. Lu","doi":"10.1109/ICECCS.2017.26","DOIUrl":"https://doi.org/10.1109/ICECCS.2017.26","url":null,"abstract":"Blockchain is an emerging technology for decentralized and transactional data sharing across a large network of untrusted participants. It enables new forms of distributed software architectures, where agreement on shared states can be established without trusting a central integration point. As a database and computational platform, blockchain has both advantages and disadvantages compared with conventional techniques. Blockchain may be an appropriate choice for some use cases while conventional technologies will be more appropriate for other use cases. A major difficulty for practitioners to decide whether or not to use blockchain is that limited product data or reliable technology evaluation available to assess the suitability of blockchains. In this paper, we propose an evaluation framework that comprises a list of criteria and a typical process for practitioners to assess the suitability of applying blockchain using these criteria based on the characteristics of the use cases. We then use several existing industrial trails to evaluate the feasibility of our framework.","PeriodicalId":114056,"journal":{"name":"2017 22nd International Conference on Engineering of Complex Computer Systems (ICECCS)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133531558","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}
引用次数: 129
Search-Based Uncertainty-Wise Requirements Prioritization 基于搜索的不确定性明智的需求优先级
Yan Li, Man Zhang, T. Yue, Shaukat Ali, Li Zhang
{"title":"Search-Based Uncertainty-Wise Requirements Prioritization","authors":"Yan Li, Man Zhang, T. Yue, Shaukat Ali, Li Zhang","doi":"10.1109/ICECCS.2017.11","DOIUrl":"https://doi.org/10.1109/ICECCS.2017.11","url":null,"abstract":"To ensure the quality of requirements, a common practice, especially in critical domains, is to review requirements within a limited time and monetary budgets. A requirement with higher importance, larger number of dependencies with other requirements, and higher implementation cost should be reviewed with the highest priority. However, requirements are inherently uncertain in terms of their impact on the requirements implementation cost. Such cost is typically estimated by stakeholders as an interval, though an exact value is often used in the literature for requirements optimization (e.g., prioritization). Such a practice, therefore, ignores uncertainty inherent in the estimation of requirements implementation cost. This paper explicitly takes into account such uncertainty for requirement prioritization and formulates four objectives for uncertainty-wise requirements prioritization with the aim of maximizing 1) the importance of requirements, 2) requirements dependencies, 3) the implementation cost of requirements, and 4) cost over-run probability. We evaluated the multi-objective search algorithm NSGA-II together with Random Search (RS) using the RALIC dataset and 19 artificial problems. Results show that NSGA-II can solve the requirements prioritization problem with a significantly better performance than RS. Moreover, NSGA-II can prioritize requirements with higher priority earlier in the prioritization sequence. For example, in the case of the RALIC dataset, the first 10% of prioritized requirements in the prioritization sequence are on average 50% better than RS in terms of prioritization effectiveness.","PeriodicalId":114056,"journal":{"name":"2017 22nd International Conference on Engineering of Complex Computer Systems (ICECCS)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121180014","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
Speeding Up Type-Specific Instrumentation for the Analysis of Complex Systems 加速用于复杂系统分析的特定类型仪器
Andrea Rosà, Walter Binder
{"title":"Speeding Up Type-Specific Instrumentation for the Analysis of Complex Systems","authors":"Andrea Rosà, Walter Binder","doi":"10.1109/ICECCS.2017.14","DOIUrl":"https://doi.org/10.1109/ICECCS.2017.14","url":null,"abstract":"Dynamic analysis is crucial for understanding and improving the performance of complex systems. Our work focuses on dynamic analyses on the Java Virtual Machine (JVM). Such analyses often rely on bytecode instrumentation to weave monitoring code into selected methods, so as to collect the desired metrics at runtime. Unfortunately, existing instrumentation frameworks offer limited capabilities. On the one hand, frameworks such as AspectJ that perform the weaving within the observed JVM cannot weave monitoring code within the Java class library, considerably limiting completeness of AspectJ-based analyses. On the other hand, frameworks such as DiSL that perform the weaving in a separate process offer full bytecode coverage, but cannot access certain reflective information that is available in AspectJ. Here, we present an extension of DiSL to expose reflective supertype information within the instrumentation process. This is challenging, because the observed application may make use of custom classloaders and the loaded classes are generally only known upon termination of the application. Our framework guarantees full bytecode coverage, while providing reflective supertype information. We show that our framework can significantly speed up dynamic analyses wrt. the current DiSL release.","PeriodicalId":114056,"journal":{"name":"2017 22nd International Conference on Engineering of Complex Computer Systems (ICECCS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127686312","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
Efficient Parameter Synthesis Using Optimized State Exploration Strategies 基于优化状态探索策略的高效参数综合
É. André, H. G. Nguyen, L. Petrucci
{"title":"Efficient Parameter Synthesis Using Optimized State Exploration Strategies","authors":"É. André, H. G. Nguyen, L. Petrucci","doi":"10.1109/ICECCS.2017.28","DOIUrl":"https://doi.org/10.1109/ICECCS.2017.28","url":null,"abstract":"Parametric timed automata are a powerful formalism to reason about, model and verify real-time systems in which some constraints are unknown, or subject to uncertainty. Parameter synthesis using parametric timed automata is very sensitive to the state space explosion problem. To mitigate this problem, we propose two new exploration orders, i. e., the \"ranking strategy\" and the \"priority based strategy\", and compare them with existing strategies. We consider both complete parameter synthesis, and counterexample synthesis where the analysis stops as soon as some parameter valuations are found. Experimental results using IMITATOR show that our new strategies significantly outperform existing approaches, especially in the counterexample synthesis.","PeriodicalId":114056,"journal":{"name":"2017 22nd International Conference on Engineering of Complex Computer Systems (ICECCS)","volume":"5 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114134485","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
Formal Modeling and Automatic Code Synthesis for Robot System 机器人系统形式化建模与自动代码合成
Xinxin Li, Rui Wang, Yu Jiang, Yong Guan, Xiaojuan Li, Xiaoyu Song
{"title":"Formal Modeling and Automatic Code Synthesis for Robot System","authors":"Xinxin Li, Rui Wang, Yu Jiang, Yong Guan, Xiaojuan Li, Xiaoyu Song","doi":"10.1109/ICECCS.2017.17","DOIUrl":"https://doi.org/10.1109/ICECCS.2017.17","url":null,"abstract":"Robot control systems are complex cyber-physical systems which are difficult to develop. In this paper, we present a formal model-based automatic code synthesis method which can generate executable C++ code running on the world-wide used Robot Operating System (ROS). The internal interaction behaviors of robot systems are modeled as a network of timed automata. The safety requirements and specifications related to the model are formalized as CTL formulas and verified by Uppaal. We design a code synthesis method to generate the executable C++ code from the verified model. Compared to existing code generators based on timed automata, our method supports more complex structures and advanced features such as timer and committed location, and provides the important abstraction and mapping of ROS instructions, which realize the seamless connection between the generated code and ROS. A case study of grasping a cup by a robot with seven degrees of freedom manipulator is conducted and the generated codes are successfully applied to a ROS development environment.","PeriodicalId":114056,"journal":{"name":"2017 22nd International Conference on Engineering of Complex Computer Systems (ICECCS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127702466","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
Extending ERS for Modelling Dynamic Workflows in Event-B 扩展ERS在Event-B中的动态工作流建模
Dana Dghaym, M. Butler, Asieh Salehi Fathabadi
{"title":"Extending ERS for Modelling Dynamic Workflows in Event-B","authors":"Dana Dghaym, M. Butler, Asieh Salehi Fathabadi","doi":"10.1109/ICECCS.2017.29","DOIUrl":"https://doi.org/10.1109/ICECCS.2017.29","url":null,"abstract":"Event-B is a state-based formal method for modelling and verifying the consistency of discrete systems. Event refinement structures (ERS) augment Event-B with hierarchical diagrams, providing explicit support for workflows and refinement relationships. Despite the variety of ERS combinators, ERS still lacks the flexibility to model dynamic workflows that support dynamic changes in the degree of concurrency. Specifically in the cases where the degree of parallelism is data dependent and data values can change during execution. In this paper, we propose two types of extensions in ERS to support dynamic modelling using Event-B. The first extension is supporting data-dependent workflows where data changes are possible. The second extension improves ERS by providing exception handling support. Semantics are given to an ERS diagram by generating an Event-B model from it. We demonstrate the Event-B encodings of the proposed ERS extensions by modelling a concurrent emergency dispatch case study.","PeriodicalId":114056,"journal":{"name":"2017 22nd International Conference on Engineering of Complex Computer Systems (ICECCS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133798088","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
A Model Driven Method to Design and Analyze Secure Architectures of Systems-of-Systems 一种模型驱动的系统的安全体系结构设计与分析方法
Jamal El Hachem, T. A. Khalil, Vanea Chiprianov, M. Babar, P. Aniorté
{"title":"A Model Driven Method to Design and Analyze Secure Architectures of Systems-of-Systems","authors":"Jamal El Hachem, T. A. Khalil, Vanea Chiprianov, M. Babar, P. Aniorté","doi":"10.1109/ICECCS.2017.31","DOIUrl":"https://doi.org/10.1109/ICECCS.2017.31","url":null,"abstract":"Context: Systems-of-Systems (SoS) is becoming the major paradigm for engineering next generation solutions such as smart cities, health-care and emergency response. However, SoS differentiating characteristics, such as emergent behavior, may introduce specific issues that make ensuring their security a critical challenge. Objective: the aim of this study is to investigate how Software Engineering approaches can be extended to model and analyze secure SoS solutions for discovering high impact cascading attacks at the architecture stage. Method: in order to achieve our objective, we followed the guidelines of Model Driven Engineering to propose a method, Systems-of-Systems Security (SoSSec), that comprises: (1) an architectural description language for modeling SoS and its vulnerabilities and (2) a MultiAgent System for security analysis of SoS architectures.","PeriodicalId":114056,"journal":{"name":"2017 22nd International Conference on Engineering of Complex Computer Systems (ICECCS)","volume":"10 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133491043","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
BigrTiMo-A Process Algebra for Structure-Aware Mobile Systems 面向结构感知移动系统的过程代数
Wanling Xie, Huibiao Zhu, Qiwen Xu
{"title":"BigrTiMo-A Process Algebra for Structure-Aware Mobile Systems","authors":"Wanling Xie, Huibiao Zhu, Qiwen Xu","doi":"10.1109/ICECCS.2017.13","DOIUrl":"https://doi.org/10.1109/ICECCS.2017.13","url":null,"abstract":"In this paper, we present a process algebra for structure-aware mobile systems called BigrTiMo by combining rTiMo process algebra and Bigraph model. Compared with rTiMo model, our BigrTiMo calculus can model not only the location of components but also the connectivity of components. Thus, our BigrTiMo process can communicate not only locally with other process, but also remotely with other process (If they share a communication link). In addition, a BigrTiMo process can migrate from one location to another location, observe the bigraph and change the bigraph. We also investigate the operational semantics and algebraic semantics of the BigrTiMo calculus.","PeriodicalId":114056,"journal":{"name":"2017 22nd International Conference on Engineering of Complex Computer Systems (ICECCS)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121108915","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}
引用次数: 3
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信