{"title":"A Three-Dimensional Model for Software Security Evaluation","authors":"Zhuobing Han, Xiaohong Li, Ruitao Feng, Jing Hu, Guangquan Xu, Zhiyong Feng","doi":"10.1109/TASE.2014.31","DOIUrl":"https://doi.org/10.1109/TASE.2014.31","url":null,"abstract":"Software security evaluation is considered as a significant and indispensible activity in all phases of software development lifecycle, and there are also many factors that should be taken into account such as the environment, risks, and development documents. Despite the achievements of the past several decades, there is still a lack of methodology in evaluating software security systematically. In this paper, we propose a comprehensive model for evaluating the software security from three different but complementary points of view: technology, management and engineering. The technological dimension is 7 security levels based on Evaluation Assurance Levels (EALs) from ISO/IEC15408, the management dimension mainly concerns the management of software infrastructures, development documents and risks, and the engineering dimension focuses on 5 stages of software development lifecycle. Experts evaluate software security through the evidence items which are collected from these three dimensions and provide their assessments. Relying on Analytic Hierarchy Process (AHP) and Dempster-Shafer Evidence Theory, assessments obtained from the experts can be combined and merged to get a score which presents the security degree of software. A case study illustrates how the evaluators may use the proposed approach to evaluate security of their system.","PeriodicalId":371040,"journal":{"name":"2014 Theoretical Aspects of Software Engineering Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131223632","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":"Mixed Simulation of Multi-valued Models","authors":"Ou Wei, Juanjuan Chen","doi":"10.1109/TASE.2014.18","DOIUrl":"https://doi.org/10.1109/TASE.2014.18","url":null,"abstract":"Multi-valued models, with additional logic values to capture the degree of uncertainty, support modeling and reasoning about systems with partial and inconsistent information. A mixed simulation, often used in abstract model checking, describes the connection between behaviors of two models and defines a precision order. In this paper, we derive a new notion of mixed simulation of multi-valued models such that the precision order is logically characterized by multi-valued semantics of propositional μ-calculus, it generalizes previous notion of mixed simulation for any multi-valued logic. Our work is based on bilattices, consisting of both a truth ordering and an information ordering. We first define the mixed simulation of multi-valued models over world-based bilattices using a model reduction approach, show the logical characterization result, and discuss three stronger variants of our notion. We then extend the result for any multi-valued logic through lattice embedding.","PeriodicalId":371040,"journal":{"name":"2014 Theoretical Aspects of Software Engineering Conference","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121217094","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 Formal Development Approach for Self-Organising Systems","authors":"Qin Li, Graeme Smith","doi":"10.1109/TASE.2014.11","DOIUrl":"https://doi.org/10.1109/TASE.2014.11","url":null,"abstract":"Self-organising systems are distributed systems which achieve an ordered global state without centralised control. They include adaptive sensor networks, swarm robotic systems and mobile ad-hoc networks. Designing such systems is difficult and often based on a trial-and-error approach. In this paper, we provide an approach which is both systematic and formal. Our approach builds on the formalism of Object-Z and the refinement approach of action systems. It follows an intuitive approach to development which breaks a refinement proof into three steps which the designer may iterate through on the way to the final design.","PeriodicalId":371040,"journal":{"name":"2014 Theoretical Aspects of Software Engineering Conference","volume":"253 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122535638","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}
Kai Ma, Jin Wang, Hongli Yang, Jun Yan, Jian Zhang, S. Qin
{"title":"Choreography Scenario-Based Test Data Generation","authors":"Kai Ma, Jin Wang, Hongli Yang, Jun Yan, Jian Zhang, S. Qin","doi":"10.1109/TASE.2014.25","DOIUrl":"https://doi.org/10.1109/TASE.2014.25","url":null,"abstract":"Web service choreography specifies a sequence of interactions among multiple services. How to test if a Web service conforms with given choreography specification is a challenging question. It is important to generate test data (i.e. XML instance) based on the choreography. Since choreography scenarios describe expected interactions among multiple participants, it is possible to generate test data based on those scenarios. This paper presents a set of test data generating rules and algorithms based on refined type trees, which are obtained from choreography scenario and corresponding XML Schema type document. We have built a prototype tool to support automatic test data generation and illustrate the process of generating XML instances via a purchase order choreography scenario example.","PeriodicalId":371040,"journal":{"name":"2014 Theoretical Aspects of Software Engineering Conference","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124747554","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}
Han Liu, Hehua Zhang, Yu Jiang, Xiaoyu Song, M. Gu, Jiaguang Sun
{"title":"iDola: Bridge Modeling to Verification and Implementation of Interrupt-Driven Systems","authors":"Han Liu, Hehua Zhang, Yu Jiang, Xiaoyu Song, M. Gu, Jiaguang Sun","doi":"10.1109/TASE.2014.33","DOIUrl":"https://doi.org/10.1109/TASE.2014.33","url":null,"abstract":"In real-time embedded applications, interrupt-driven systems are widely adopted due to strict timing requirements. However, development of interrupt-driven systems is time-consuming and error-prone. To conveniently ensure a trustworthy system design and implementation is a challenging problem, especially in complex applications. In this paper, we present a novel domain-specific language called iDola to model interrupt-driven systems declaratively and concisely. A major strength of iDola is the feasibility to capture complex interrupt handling mechanism in real-time operating systems and target platforms, such as delayed service and buffered processing. We also propose the formal operational semantics and code generation algorithm of iDola, so that iDola models can be transformed to timed automata for verification and loaded to generate platform-specific codes. We apply iDola on the modeling of an industrial interrupt-driven system, multifunction vehicle bus controller which runs in an embedded environment with eCos operating system. Based on iDola, the system is modeled with a dispatcher which embodies advanced interrupt handling in eCos, including buffered interrupt service routine and deferred service routine. Through transformation, the system design is verified and design bugs are detected. Code generation is also executed using the proposed algorithm. Generated codes display comparatively equal performance in the real system. We believe iDola can facilitate building a trustworthy interrupt-driven system.","PeriodicalId":371040,"journal":{"name":"2014 Theoretical Aspects of Software Engineering Conference","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114507810","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":"Data Resources in Dynamic Environments","authors":"W. Zeng, M. Koutny","doi":"10.1109/TASE.2014.9","DOIUrl":"https://doi.org/10.1109/TASE.2014.9","url":null,"abstract":"New technologies influence and change social attitudes by making electronic data easy to use and easy to carry, and this capability impacts data security in business organizations. Therefore, organizations have to define appropriate controls aimed at preventing the loss or leaking of data. Having said that, the effectiveness of security controls in complex dynamic environments has not yet been systematically analyzed. In this paper, we propose a formal system model for data resources in a dynamic environment, which can represent the location of different classes of data resources as well as their users. Using such a model, the concurrent and probabilistic behaviour of the system can be analyzed. This study provides a systematic way of exploring the efficiency of a given security policy, or access control technology, in the business process context. The proposed approach can help a technical expert to develop a deeper analysis of the specific security measures required by a business organization.","PeriodicalId":371040,"journal":{"name":"2014 Theoretical Aspects of Software Engineering Conference","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132284069","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":"Combining Syntactic and Semantic Encoding for LTL Bounded Model Checking","authors":"Wanwei Liu, Xiaoguang Mao, G. Pu, Rui Wang","doi":"10.1109/TASE.2014.13","DOIUrl":"https://doi.org/10.1109/TASE.2014.13","url":null,"abstract":"Bounded model checking (BMC, for short) is a successful application of SAT technique in model checking. In a broad sense, BMC encoding approaches could be categorised into the syntactic fashion and semantic fashion. In this paper, we present a new BMC encoding approach specially tailored for LTL model checking. The key observation is that syntactic encoding and semantic encoding respectively have the superiority in dealing with \"next\" operator and \"until\" operator in the specification. The proposed encoding could be implemented in an \"on-the-fly\" manner, and finally results in a linear scale blow-up. To justify it, the approach is experimentally evaluated by comparing with some of the best known existing encodings.","PeriodicalId":371040,"journal":{"name":"2014 Theoretical Aspects of Software Engineering Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131154437","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":"Towards a Stochastic Occurrence-Based Modeling Approach for Stochastic CPSs","authors":"B. Cheng, Dehui Du","doi":"10.1109/TASE.2014.35","DOIUrl":"https://doi.org/10.1109/TASE.2014.35","url":null,"abstract":"Cyber-Physical Systems (CPSs) face many challenges, one of which is the complexity of our world full of a variety of stochastic behavior. Due to the excess complexity the increasing number of need for autonomous long running components appears and gives rise to a special concern for energy so that a great challenge becomes open to us that how to model, analyze and make effective evaluation for either one or both of stochastic behavior and energy consumption. To solve the problem, we present a Stochastic Occurrence Hybrid Automata (SOHA) which unify all stochastic behavior into triggers among probabilistic events and use a unified way to describe both stochastic and deterministic events occurrence, besides introduce the energy function with time to model energy harvesting or consumption. In this paper, we give the formal syntax and semantics of SOHA based on labeled transition system and then propose a SOHA-based modeling approach that provides a more reasonable way to concisely model stochastic hybrid systems with the use of refinement and stochastic abstraction. This approach helps build a better model with hiding the details we may not concern, which is useful to the analysis in the future. To illustrate our approach and its benefit, we discuss a benchmark of hybrid systems Energy Aware Buildings as case study.","PeriodicalId":371040,"journal":{"name":"2014 Theoretical Aspects of Software Engineering Conference","volume":"301 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134446295","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":"Bayesian Model-Based Prediction of Service Level Agreement Violations for Cloud Services","authors":"B. Tang, Mingdong Tang","doi":"10.1109/TASE.2014.34","DOIUrl":"https://doi.org/10.1109/TASE.2014.34","url":null,"abstract":"Cloud SLAs are contractually binding agreements between cloud service providers and cloud consumers. For cloud service providers, it is essential to prevent SLA violations as much as possible to enhance customer satisfaction and avoid penalty payments. Therefore, it is desirable for providers to predict possible violations before they happen. We propose an approach for predicting SLA violations, which uses measured datasets (QoS of used services) as input for a prediction model. As a feature of cloud service, we consider response-time to predict violations of SLA. The prediction model is based on Naive Bayesian Classifier, and trained using historical SLA datasets. We present the basics of our prediction approach, and also determine the most effective combinations of features for prediction, and briefly validate our approach, using a detailed real SLA datasets of cloud services. Experiments result show that the Bayesian method achieves higher accuracy compared with other prediction methods.","PeriodicalId":371040,"journal":{"name":"2014 Theoretical Aspects of Software Engineering Conference","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123789164","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}
Han Liu, Hehua Zhang, Yu Jiang, Xiaoyu Song, M. Gu, Jiaguang Sun
{"title":"Application-Specific Architecture Selection for Embedded Systems via Schedulability Analysis","authors":"Han Liu, Hehua Zhang, Yu Jiang, Xiaoyu Song, M. Gu, Jiaguang Sun","doi":"10.1109/TASE.2014.32","DOIUrl":"https://doi.org/10.1109/TASE.2014.32","url":null,"abstract":"Architecting real-time embedded systems is of the top significance during the design phase, especially in complex applications. Due to limited time and resource, to guarantee scheduling eminence without violating application-specific constraints is a challenging problem in architecture level. In this paper, we firstly present an enhanced transformation from AADL models to Cheddar input for schedulability analysis. With subprogram and delayed connection, this transformation is feasible for complex system designs. Based on schedulability analysis, we further propose a novel architecture selection engine, which evaluates scheduling performance through selection standards and application-specific constraints via satisfaction functions. With the proposed selection engine, information from both schedulability and real-time constraints are captured to pick up an optimal architecture. We apply the proposed approach on the architecture selection of an industrial control system in railway applications. Four candidate AADL architectures are transformed and analyzed for schedulability. Then in the selection engine, candidates are ranked within two application constraints. Compared to the selection of general criteria and traditional AHP, our engine excels at better schedulability and satisfaction on real-time application-specific constraints. Moreover, with adjustment on constraints, our engine shows delicate sensitivity by generating a modified selection. We believe the proposed approach can facilitate architecture design of real-time embedded systems.","PeriodicalId":371040,"journal":{"name":"2014 Theoretical Aspects of Software Engineering Conference","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126632934","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}