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

筛选
英文 中文
Towards Conformance Testing of Choreography Based on Scenario 基于场景的编排一致性测试研究
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.23
Hongli Yang, Kai Ma, Chen Deng, Husheng Liao, Jun Yan, Jian Zhang
{"title":"Towards Conformance Testing of Choreography Based on Scenario","authors":"Hongli Yang, Kai Ma, Chen Deng, Husheng Liao, Jun Yan, Jian Zhang","doi":"10.1109/TASE.2013.23","DOIUrl":"https://doi.org/10.1109/TASE.2013.23","url":null,"abstract":"Web service choreography specifies the interaction among multiple participant, aiming to achieve common business goals. An issue is to check for the conformance of the implementation with reference to the choreography specification. To achieve that, we seek to develop software tools and a methodology to enable conformance testing of choreography. In this paper, we present our first step in that direction. Particularly, we reduce choreography scenario in order to obtain effective testing scenarios, which will greatly decrease the cost of testing. Concretely, based on XML Schema type definition of a choreography scenario, we partition XML Schema type into subtypes, which will be transformed into the input model of combinatorial tool Cascade for generating a set of combinations of variable values. The output of Cascade will be transformed to generate reduced scenarios for testing. Moreover, a purchase order choreography example is presented to demonstrate the reduction process of choreography scenarios, and a tool has been developed for supporting automatic implementation of the testing scenarios reduction.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121667295","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
Algebraic Framework for Synchronous Language Semantics 同步语言语义的代数框架
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.15
D. Gaffé, Annie Ressouche
{"title":"Algebraic Framework for Synchronous Language Semantics","authors":"D. Gaffé, Annie Ressouche","doi":"10.1109/TASE.2013.15","DOIUrl":"https://doi.org/10.1109/TASE.2013.15","url":null,"abstract":"In this article, we study several relevant algebraic frameworks to define synchronous language semantics. Synchronous languages are quite dedicated to design critical embedded applications. Thus, verification and compilation is challenging and should rely on mathematical semantics. We study multi-valued algebras as foundation for semantics definition and we show that a 4-valued algebra with a bilattice structure is well suited to our concern. With this approach we can define semantics offering both the generation of models where verification techniques apply, and separated compilation means.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121921735","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
Aspect Orientation Based Test Case Selection Strategy for Service Composition 基于面向方面的服务组合测试用例选择策略
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.21
Guisheng Fan, Huiqun Yu, Liqiong Chen, Dongmei Liu
{"title":"Aspect Orientation Based Test Case Selection Strategy for Service Composition","authors":"Guisheng Fan, Huiqun Yu, Liqiong Chen, Dongmei Liu","doi":"10.1109/TASE.2013.21","DOIUrl":"https://doi.org/10.1109/TASE.2013.21","url":null,"abstract":"Software testing is an important part of software maintenance, but it can also be very expensive. To reduce this expense, software testers may select part of their test cases so that those that are more important are run earlier in the testing process. However, the methods that can be used to select test cases for service composition and its analysis are still lacking at present. This paper proposes an aspect orientation based test case selection strategy for service composition. Aspect-orientation is used to weave testing crosscutting concerns of service composition, which includes component testing concern and testing concern of service composition, the weaving mechanism dynamically integrates these schemas into a testing enforcement model. Based on this, the test cases selection strategy for service composition is given, and abstract it as a crosscutting concern to weave into testing model, the corresponding enforcement algorithm is also given, the operation semantics and related theories of Petri nets help prove its effectiveness and feasibility. A case study explains the testing process of service composition, and a series of experiments are done to explain that the use of aspects for testing Web service is more efficient than conventional techniques, which can improve the testing quality and efficiency.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128888250","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
On Denotational Semantics of Spatial-Temporal Consistency Language -- STeC 论时空一致性语言的指称语义
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.16
Hengyang Wu, Yixiang Chen, Min Zhang
{"title":"On Denotational Semantics of Spatial-Temporal Consistency Language -- STeC","authors":"Hengyang Wu, Yixiang Chen, Min Zhang","doi":"10.1109/TASE.2013.16","DOIUrl":"https://doi.org/10.1109/TASE.2013.16","url":null,"abstract":"In order to describe the requirement of spatial and temporal consistency of cyber-physical systems, a specification language called as STeC was proposed by Chen in [1]. In this paper, we focus on the theory of semantics of STeC. After simply restating the syntax and operational semantics, we mainly establish the denotational semantics of STeC. To investigate the reasonability of the denotational semantics, an abstract theorem is given to show the soundness and completeness of the denotational semantics. Finally, a simple case about China Gaotie (which means High-speed train) is given to show how to compute the operational and denotational semantics.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117220811","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}
引用次数: 15
An Operational Approach to Happens-Before Memory Model “先发生”内存模型的操作方法
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.24
Y. Zhang, Xinyu Feng
{"title":"An Operational Approach to Happens-Before Memory Model","authors":"Y. Zhang, Xinyu Feng","doi":"10.1109/TASE.2013.24","DOIUrl":"https://doi.org/10.1109/TASE.2013.24","url":null,"abstract":"Happens-before memory model (HMM) is used as the basis of Java memory model (JMM). Although HMM itself is simple, some complex axioms have to be introduced in JMM to prevent the causality loop, which causes absurd out-of-thin-air reads that may break the type safety and security guarantee of Java. The resulting JMM is complex and difficult to understand. It also has many anti-intuitive behaviors, as demonstrated by the \"ugly examples\" by Aspinall and ?Sev?c'ik [3]. Furthermore, HMM (and JMM) specify only what execution traces are acceptable, but say nothing about how these traces are generated. This gap makes it difficult for static reasoning about programs. In this paper we present OHMM, an operational variation of HMM. The model is specified by giving an operational semantics to a language running on an abstract machine designed to simulate HMM. Thanks to its generative nature, the model naturally prevents out-of-thin-air reads. On the other hand, it uses a novel replay mechanism to allow instructions to be executed multiple times, which can be used to model many useful speculations and optimizations. The model is weaker than JMM for lockless programs, thus can accommodate more optimizations, such as the reordering of independent memory accesses that is not valid in JMM. Program behaviors are more natural in this model than in JMM, and many of the anti-intuitive examples in JMM are no longer valid here. We hope OHMM can serve as the basis for new memory models for Java-like languages.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131431495","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
Computing Repairs from Active Integrity Constraints 从活动完整性约束计算修复
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.32
L. Cruz-Filipe, G. Gaspar, P. Engrácia, I. Nunes
{"title":"Computing Repairs from Active Integrity Constraints","authors":"L. Cruz-Filipe, G. Gaspar, P. Engrácia, I. Nunes","doi":"10.1109/TASE.2013.32","DOIUrl":"https://doi.org/10.1109/TASE.2013.32","url":null,"abstract":"Repairing an inconsistent knowledge base is a well known problem for which several solutions have been proposed and implemented in the past. In this paper, we start by looking at databases with active integrity constraints - consistency requirements that also indicate how the database should be updated when they are not met - as introduced by Caroprese et al.We show that the different kinds of repairs considered by those authors can be effectively computed by searching for leaves of specific kinds of trees. Although these computations are in general not very efficient (deciding the existence of a repair for a given database with active integrity constraints is NP-complete), on average the algorithms we present make significant reductions on the number of nodes in the search tree. Finally, these algorithms also give an operational characterization of different kinds of repairs that can be used when we extend the concept of active integrity constraints to the more general setting of knowledge bases.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131202132","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}
引用次数: 18
Congruent Bisimulation Equivalence of Ambient Calculus Based on Contextual Transition System 基于上下文转换系统的环境微积分的同余双模拟等价
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.28
M. Murakami
{"title":"Congruent Bisimulation Equivalence of Ambient Calculus Based on Contextual Transition System","authors":"M. Murakami","doi":"10.1109/TASE.2013.28","DOIUrl":"https://doi.org/10.1109/TASE.2013.28","url":null,"abstract":"This paper presents a labeled transition system (LTS) for mobile ambients. We define labels for transitions using contexts of processes. We present a set of rules that derives transitions with contextual labels. We define bisimulation equivalence relation based on the LTS. We also show that the bisimulation equivalence is a congruence relation.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121669617","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
A Programming Language Approach to Fault Tolerance for Fork-Join Parallelism 叉连接并行容错的编程语言方法
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.22
M. Zengin, Viktor Vafeiadis
{"title":"A Programming Language Approach to Fault Tolerance for Fork-Join Parallelism","authors":"M. Zengin, Viktor Vafeiadis","doi":"10.1109/TASE.2013.22","DOIUrl":"https://doi.org/10.1109/TASE.2013.22","url":null,"abstract":"When running big parallel computations on thousands of processors, the probability that an individual processor will fail during the execution cannot be ignored. Computations should be replicated, or else failures should be detected at runtime and failed subcomputations reexecuted. We follow the latter approach and propose a high-level operational semantics that detects computation failures, and allows failed computations to be restarted from the point of failure. We implement this high-level semantics with a lower-level operational semantics that provides a more accurate account of processor failures, and prove in Coq the correspondence between the high- and low-level semantics.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131189653","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
When Even the Interface Evolves... 当连界面都在进化……
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.19
A. Madeira, Renato Neves, M. Martins, L. Barbosa
{"title":"When Even the Interface Evolves...","authors":"A. Madeira, Renato Neves, M. Martins, L. Barbosa","doi":"10.1109/TASE.2013.19","DOIUrl":"https://doi.org/10.1109/TASE.2013.19","url":null,"abstract":"This paper extends the authors' previous work on a formal approach to the specification of reconfigurable systems, introduced in [7], in which configurations are taken as local states in a suitable transition structure. The novelty is the explicit consideration that not only the realisation of a service may change from a configuration to another, but also the set of services provided and even their functionality, may themselves vary. In other words, interfaces may evolve, as well.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134116990","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
Modeling and Analyzing Self-Adaptive Systems with Context Petri Nets 基于上下文Petri网的自适应系统建模与分析
2013 International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2013-07-01 DOI: 10.1109/TASE.2013.33
Nicolás Cardozo, Sebastián González, K. Mens, Ragnhild Van Der Straeten, T. D'Hondt
{"title":"Modeling and Analyzing Self-Adaptive Systems with Context Petri Nets","authors":"Nicolás Cardozo, Sebastián González, K. Mens, Ragnhild Van Der Straeten, T. D'Hondt","doi":"10.1109/TASE.2013.33","DOIUrl":"https://doi.org/10.1109/TASE.2013.33","url":null,"abstract":"The development of self-adaptive systems requires the definition of the parts of the system that will be adapted, when such adaptations will take place, and how these adaptations will interact with each other. However, foreseeing all possible adaptations and their interactions is a difficult task, opening the possibility to inconsistencies or erroneous system behavior. To avoid inconsistencies, self adaptive systems require a sound programming model that allows to reason about the correctness of the system in spite of its dynamic reconfigurations. This paper presents context Petri nets, a Petri net-based programming model for self-adaptive systems. This model provides a formal definition of adaptations and their interaction, as well as a consistent process for their inclusion in the system. Besides serving as an underlying run-time model to ensure that adaptations and their constraints remain consistent, context Petri nets allow to analyze properties such as reachability, and liveness in the configuration of self-adaptive systems. Context Petri nets thus are a convenient tool to model and analyze the dynamics of self-adaptive systems, both formally and computationally.","PeriodicalId":346899,"journal":{"name":"2013 International Symposium on Theoretical Aspects of Software Engineering","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114125325","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}
引用次数: 24
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学术文献互助群
群 号:604180095
Book学术官方微信