2015 International Symposium on Theoretical Aspects of Software Engineering最新文献

{"title":"Polychronous Automata","authors":"P. Guernic, T. Gautier, J. Talpin, L. Besnard","doi":"10.1109/TASE.2015.21","DOIUrl":"https://doi.org/10.1109/TASE.2015.21","url":null,"abstract":"This paper investigates the way state diagrams can be best represented in the polychronous model of computation. In this relational model, the basic objects are signals, which are related through data-flow equations. Signals are associated with logical clocks, which provide the capability to describe systems in which componentsobey to multiple clock rates. We propose a model of finite-state automata, called polychronous automata, which is based on clock relations. A specificity of this model is that an automaton is submitted to clock constraints. This allows one to specify a wide range of control-related configurations, either reactive, or restrictivewith respect to their control environment. A semantic model is defined for these polychronous automata, that relies on a Boolean algebra of clocks.","PeriodicalId":257414,"journal":{"name":"2015 International Symposium on Theoretical Aspects of Software Engineering","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126328311","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":"QaSten: Integrating Quantitative Verification with Safety Analysis for AADL Model","authors":"Xiaomin Wei, Yunwei Dong, Hong Ye","doi":"10.1109/TASE.2015.10","DOIUrl":"https://doi.org/10.1109/TASE.2015.10","url":null,"abstract":"Quantitative verification is an effective technique for analyzing quantitative aspects of a safety critical system's design, and safety analysis is a significant aspect of safety critical system. However, they are often conducted separately. In this paper, we propose a new methodology, QaSten, fastens quantitative verification to safety analysis for Architecture Analysis and Design Language (AADL) model (including error model). QaSten formalizes a set of rigorous transformation rules that transform AADL model to PRISM model using formal method. In addition, QaSten can generate two safety property formulas automatically to check against the PRISM model for each hazardous state. Therefore, the occurrence probability of hazardous states can be calculated, which can help system designers understand the impact of parameters in the model. Furthermore, combining the probability and the severity of potential consequence of a hazardous state, QaSten determines the hazard risk acceptance level that can help engineers to identify critical hazard and modify or redesign architecture model to control it in an acceptable level. Two case studies, based on the Gas Leakage Alarm systems, are utilized to demonstrate QaSten's feasibility and effectiveness.","PeriodicalId":257414,"journal":{"name":"2015 International Symposium on Theoretical Aspects of Software Engineering","volume":"2010 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133542974","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":"On Various Abstract Understandings of Abstract Interpretation","authors":"P. Cousot","doi":"10.1109/TASE.2015.29","DOIUrl":"https://doi.org/10.1109/TASE.2015.29","url":null,"abstract":"We discuss several possible understandings and misunderstandings of Abstract Interpretation theory and practice at various levels of abstraction.","PeriodicalId":257414,"journal":{"name":"2015 International Symposium on Theoretical Aspects of Software Engineering","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129278543","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":"Formally Modeling and Analyzing the Reliability of Composite Service Evolution","authors":"Guisheng Fan, Liqiong Chen, Huiqun Yu, Dongmei Liu","doi":"10.1109/TASE.2015.17","DOIUrl":"https://doi.org/10.1109/TASE.2015.17","url":null,"abstract":"Service composition is an important means for integrating the individual Web services for creating new value added systems. However, Web service exists in the heterogeneous environments on the Internet, thus it is challenging to guarantee the reliability of composite service evolution. To address this problem, we propose the approach to modeling and analyzing the reliability of composite service evolution. First, we present a formal description language to model the different components of service composition, and use it to analyze the reliability of composite service evolution. Second, we propose an evolution mechanism to ensure that service composition can dynamically meet the required reliability. Third, we present the operational semantics and related theories of Petri nets for establishing the consistency in the evolution process. We have also performed a series of simulations to evaluate our proposed method. Results show that it can help reveal the structural and behavioral characteristics of service composition, and improve the reliability of composite service evolution.","PeriodicalId":257414,"journal":{"name":"2015 International Symposium on Theoretical Aspects of Software Engineering","volume":"466 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120884303","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":"Formal Analysis of MAC in IEEE 802.11p with Probabilistic Model Checking","authors":"Conghua Zhou, Yong Wang, Meiling Cao, Jianqi Shi, Yang Liu","doi":"10.1109/TASE.2015.22","DOIUrl":"https://doi.org/10.1109/TASE.2015.22","url":null,"abstract":"In vehicular ad-hoc network, Media AccessControl (MAC) is one of the technologies which determinewhether the information is transferred reliably and timely or not. It is also a key to the quality of service of self organizationnetworks. Some behaviors of the MAC protocol can be estimatedby experiment and simulation. But the main drawback of thesemethods is that the estimation can not be accurate to support theenough confidence. In this paper, we complete the preciseanalysis of the MAC protocol by probabilistic model checking. First, based on the nature of MAC, its dynamic behavior isabstracted into a probabilistic timed automata which candescribe non-deterministic, continuous time and the probabilityselection of MAC. Then we calculate the probability of the datasent successfully and the probability of the backoff counterreaching the maximum value. The analysis result shows that theprobability of conflict in 802.11p is much smaller than the 802.11standard. Therefore the waiting time in 802.11p is significantlyreduced and in the case of fast-moving, the data can be senttimely. Further we calculate the maximum expect conflictnumber under the different values of maximum backoff and thelongest time to complete the data transmission. The result showsthat when the value of maximum backoff increases, the numberof collisions that occurred in 802.11p tends to be stable, which isless than the 802.11 standard's collisions, and the average speedof the data transmission in 802.11p is as four times faster as the802.11 standard.","PeriodicalId":257414,"journal":{"name":"2015 International Symposium on Theoretical Aspects of Software Engineering","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121059946","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":"Event and Strategy Analytics","authors":"J. Dong, Jun Sun, Yang Liu, Yuan-Fang Li, Jing Sun, Ling Shi","doi":"10.1109/TASE.2015.28","DOIUrl":"https://doi.org/10.1109/TASE.2015.28","url":null,"abstract":"Model checking has been pervasive and successful in finding bugs in hardware and software systems, including real-time and probabilistic systems. Applying model checking to decision making is relative new and has an excellent potential to be compliment to data analytics and other Artificial Intelligent (AI) or Operational Research (OR) based decision making techniques. Our last 8 years research has focused on the development of PAT (Process Analysis Toolkit) [18] whichsupports modelling languages that combine the expressiveness of event, state, time and probability based modeling techniques to which model checking can be directly applied. The next direction for PAT is to move from verification to analytics, we call it \"Event Analytics\" with a special focus on \"Strategy Analytics\".","PeriodicalId":257414,"journal":{"name":"2015 International Symposium on Theoretical Aspects of Software Engineering","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125105173","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 Framework for Off-Line Conformance Testing of Timed Connectors","authors":"Shaodong Li, Xiaohong Chen, Yiwu Wang, Meng Sun","doi":"10.1109/TASE.2015.9","DOIUrl":"https://doi.org/10.1109/TASE.2015.9","url":null,"abstract":"Coordination is playing a key role in complex cyber-physicalsystems (CPSs). The complexity and importance of coordination models and languages for CPSs necessarily lead to a higher relevance of testing during development of CPSs. Model-based testing is a promising technology to test the conformance or non-conformance relation between the implementation-under-test (IUT) and its specification. In this paper, we present an approach to test the conformance relation tiococ(Timed Input-Output Conformance) between the implementation of a timed Reo connector and its specification given by a timed constraint automaton (TCA). An algorithm to generate test cases from a TCA is proposed and the testing approach is implemented in UPPAAL.","PeriodicalId":257414,"journal":{"name":"2015 International Symposium on Theoretical Aspects of Software Engineering","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126165396","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":"Modeling and Reasoning about Software Systems Containing Uncertainty and Variability","authors":"M. Chechik","doi":"10.1109/TASE.2015.26","DOIUrl":"https://doi.org/10.1109/TASE.2015.26","url":null,"abstract":"Summary form only given. When building large software-intensive systems, engineers need to express and reason about at least two different types of choices. One type concerns uncertainty - choosing between different design alternatives, resolving inconsistencies, or resolving conflicting stakeholder requirements. Another type deals with variability - supporting different variants of software that serve multiple customers or market segments. Partial modeling has been proposed as a technique for managing uncertainty within a software model. A partial model explicates points of uncertainty and represents the set of possible models that could be obtained by making decisions and resolving the uncertainty. Methods for reasoning about the entire set of possibilities, transforming the entire set and uncertainty-reducing refinements have recently been developed. Software product line engineering approaches propose techniques for managing the variability within sets of related software product variants. Such approaches explicate points of variability (a.k.a.features) and relationships between them in an artifact usually referred to as a feature model. A selection of features from this model guides the derivation of a specific product of a software product line (SPL). Techniques for reasoning about sets of SPL products, transforming the entire SPL and supporting their partial configuration have recently been developed. Partial models and SPL representations are naturally quite similar - both provide ways of encoding and managing sets of artifacts. The techniques for representing, reasoning with and manipulating these sets, naturally, have much in common. Yet, the goals for creating these product sets are quite different, and thus the two techniques lead to distinct methodological considerations. Uncertainty is an aspect of the development process itself; it is transient and must be reduced and eventually eliminated as knowledge is gathered and decisions are made. Thus, the ultimate goal of resolving uncertainty is to produce only one desired artifact. On the other hand, variability is an aspect of the artifacts simultaneously managed through the entire development process; it is to be preserved and carefully engineered to represent the desired range of product variants required. Thus, product lines aim to produce and simultaneously manage multiple artifacts. In this talk, I will survey approaches to representing, reasoning with and transforming models with uncertainty and variability, separately, as well as discuss current work on trying to combine the two approaches.","PeriodicalId":257414,"journal":{"name":"2015 International Symposium on Theoretical Aspects of Software Engineering","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124930180","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":"Formal Semantics of Runtime Monitoring, Verification, Enforcement and Control","authors":"Zhe Chen, Ou Wei, Zhiqiu Huang, H. Xi","doi":"10.1109/TASE.2015.11","DOIUrl":"https://doi.org/10.1109/TASE.2015.11","url":null,"abstract":"Runtime monitoring can be used to verify, enforce and control the dynamic execution of a target program at runtime to detect property violations, enforce desired properties and actively correct the execution, respectively. However, the state-of-the-art study lacks an appropriate formal program semantics of runtime monitoring. In this paper, we propose a theory of runtime control at an appropriate level of formalization to provide a formal program semantics of instrumented target programs under the control of controlling programs. Our theory provides a complete formal semantics for real implementations of runtime monitoring and control, but still retains a good balance between implementation and generality. Indeed, the theory encompasses the formalization of key implementation techniques, such as program instrumentation, synchronization on passively monitored actions, and synthesis of controlling programs from specifications. On the other hand, the theory is so generic and expressive that many existing formalisms about runtime monitoring can be considered as special cases of our theory.","PeriodicalId":257414,"journal":{"name":"2015 International Symposium on Theoretical Aspects of Software Engineering","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121898024","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":"Formal Verification of PKMv3 Protocol Using DT-Spin","authors":"Xiaoran Zhu, Yuanmin Xu, Jian Guo, Xi Wu, Huibiao Zhu, Weikai Miao","doi":"10.1109/TASE.2015.20","DOIUrl":"https://doi.org/10.1109/TASE.2015.20","url":null,"abstract":"WiMax (Worldwide Interoperability for Microwave Access, IEEE 802.16) is a standard-based wireless technology, which uses Privacy Key Management (PKM) protocol to provide authentication and key management. Three versions of PKM protocol have been released and the third version (PKMv3) strengthens the security by enhancing the message management. In this paper, a formal analysis of PKMv3 protocol is presented. Both the subscriber station (SS) and the base station (BS) are modeled as processes in our framework. Discrete time describes the lifetime of the Authorization Key (AK) and the Transmission Encryption Key (TEK), which are produced by BS. Moreover, the PKMv3 model is constructed through the discrete-time PROMELA (DT-PROMELA) language and the tool DT-Spin implements the PKMv3 model with lifetime. Finally, we simulate communications between SS and BS and some properties are verified, i.e. liveness, succession and message consistency, which are extracted from PKMv3 and specified using Linear Temporal Logic (LTL) formulae and assertions. Our model provides a basis for further verification of PKMv3 protocol with time characteristic.","PeriodicalId":257414,"journal":{"name":"2015 International Symposium on Theoretical Aspects of Software Engineering","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116465030","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}