发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
Integrating Model-Based Testing and Analysis Tools via Test Case Exchange 通过测试用例交换集成基于模型的测试和分析工具
2012 Sixth International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2012-07-04 DOI: 10.1109/TASE.2012.20
B. Aichernig, Florian Lorber, Stefan Tiran
{"title":"Integrating Model-Based Testing and Analysis Tools via Test Case Exchange","authors":"B. Aichernig, Florian Lorber, Stefan Tiran","doi":"10.1109/TASE.2012.20","DOIUrl":"https://doi.org/10.1109/TASE.2012.20","url":null,"abstract":"Europe's industry in embedded system design is currently aiming for a better integration of tools that support their development, validation and verification processes. The idea is to combine model-driven development with model-based testing and model-based analysis. The interoperability of tools shall be achieved with the help of meta-models that facilitate the mapping between different modelling notations. However, the syntactic and semantic integration of tools is a complex and costly task. A common problem is that different tools support different subsets of a language. Furthermore, semantic differences are a major obstacle to sound integration efforts. In this paper we advocate an alternative, more pragmatic approach. We propose the exchange of test cases generated from the models instead of exchanging the models themselves. The advantage is that test cases have a much simpler syntax and semantics, and hence, the mapping between different tools is easier to implement and to maintain. With a formal testing approach with adequate testing criteria a set of test cases can be viewed as partial models that can be formally analysed. We demonstrate an integration of our test case generator Ulysses with the CADP toolbox by means of test case exchange. We generate test cases in Ulysses and verify properties in CADP. We also generate test cases in CADP and perform a mutation analysis in Ulysses.","PeriodicalId":417979,"journal":{"name":"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering","volume":"288 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130020639","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
Statement-Coverage Testing for Nondeterministic Concurrent Programs 不确定并发程序的语句覆盖测试
2012 Sixth International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2012-07-04 DOI: 10.1109/TASE.2012.21
Gwan-Hwan Hwang, Heng-Yi Lin, Shao-Yan Lin, Che-Sheng Lin
{"title":"Statement-Coverage Testing for Nondeterministic Concurrent Programs","authors":"Gwan-Hwan Hwang, Heng-Yi Lin, Shao-Yan Lin, Che-Sheng Lin","doi":"10.1109/TASE.2012.21","DOIUrl":"https://doi.org/10.1109/TASE.2012.21","url":null,"abstract":"In this paper we propose a scheme for reachability testing to obtain statement coverage in the dynamic testing of concurrent programs. The proposed scheme derives inputs from SYN-sequences obtained in reachability testing and uses these inputs to perform reachability testing multiple times in order to achieve statement-coverage testing for a concurrent program.","PeriodicalId":417979,"journal":{"name":"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132760730","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
An Improved Full Abstraction Approach to Analyzing Locality Semantics 一种改进的局部语义全抽象分析方法
2012 Sixth International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2012-07-04 DOI: 10.1109/TASE.2012.32
Jianxin Xue, Huan Long, Guoqiang Li
{"title":"An Improved Full Abstraction Approach to Analyzing Locality Semantics","authors":"Jianxin Xue, Huan Long, Guoqiang Li","doi":"10.1109/TASE.2012.32","DOIUrl":"https://doi.org/10.1109/TASE.2012.32","url":null,"abstract":"Concurrency semantics plays an important role in both concurrency theory and software engineering. Although many results on various concurrency semantics have been proposed, there is still room for improvement. This paper focuses on the locality semantics, an important non-interleaving semantics, based on studying the relationship between the located CCS and the π-calculus. We present a practical full abstraction result for the locality semantics, and reduce the location bisimulation of the located CCS to the observation bisimulation of the π-calculus. The full abstraction result respects process finiteness, i.e., finite processes of the located CCS are mapped onto finite π-processes. As a result, the location bisimulation on finite processes of the located CCS can be proved by an existing proof system on finite π-processes, which is not achieved in [31].","PeriodicalId":417979,"journal":{"name":"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering","volume":"27 23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124604533","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
Dataflow Weaknesses Analysis of Scientific Workflow Based on Fault Tree 基于故障树的科学工作流数据流弱点分析
2012 Sixth International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2012-07-04 DOI: 10.1109/TASE.2012.18
Xiaodong Fu, Feng Wang, Xiaoyan Liu, Kaifan Ji, P. Zou
{"title":"Dataflow Weaknesses Analysis of Scientific Workflow Based on Fault Tree","authors":"Xiaodong Fu, Feng Wang, Xiaoyan Liu, Kaifan Ji, P. Zou","doi":"10.1109/TASE.2012.18","DOIUrl":"https://doi.org/10.1109/TASE.2012.18","url":null,"abstract":"If potential contributors leading to system failure can be identified when a scientific workflow is modeled, a lot of system weaknesses may thus be revealed and improved. In this paper, we first identify a number of data dependency patterns in scientific workflows and their corresponding state functions. Then, a method to transform the state functions into fault tree symbols is presented. We use fault tree analysis method to identify critical elements and elements combinations that lead to the incorrect state of a final output and calculate the probability of the incorrect state of a final output based on the probabilities of the basic events in the analyzed workflow. Moreover, an importance measure is designed to prioritize the contributors leading to the incorrect state of a final output. Finally, the feasibility and effectiveness of the proposed methods are proved by example and experiments.","PeriodicalId":417979,"journal":{"name":"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127820099","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
A Logic for Accumulated-Weight Reasoning on Multiweighted Modal Automata 一种多加权模态自动机的累积权推理逻辑
2012 Sixth International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2012-07-04 DOI: 10.1109/TASE.2012.9
Sebastian S. Bauer, Line Juhl, K. Larsen, J. Srba, Axel Legay
{"title":"A Logic for Accumulated-Weight Reasoning on Multiweighted Modal Automata","authors":"Sebastian S. Bauer, Line Juhl, K. Larsen, J. Srba, Axel Legay","doi":"10.1109/TASE.2012.9","DOIUrl":"https://doi.org/10.1109/TASE.2012.9","url":null,"abstract":"Multiweighted modal automata provide a specification theory for multiweighted transition systems that have recently attracted interest in the context of energy games. We propose a simple fragment of CTL that is able to express properties about accumulated weights along maximal runs of multiweighted modal automata. Our logic is equipped with a game-based semantics and guarantees both soundness (formula satisfaction is propagated to the modal refinements) as well as completeness (formula non-satisfaction is propagated to at least one of its implementations). We augment our theory with a summary of decidability and complexity results of the generalized model checking problem, asking whether a specification-abstracting the whole set of its implementations-satisfies a given formula.","PeriodicalId":417979,"journal":{"name":"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121175181","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
Formal Verification of Netlog Protocols Netlog协议的正式验证
2012 Sixth International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2012-07-04 DOI: 10.1109/TASE.2012.19
Meixian Chen, J. Monin
{"title":"Formal Verification of Netlog Protocols","authors":"Meixian Chen, J. Monin","doi":"10.1109/TASE.2012.19","DOIUrl":"https://doi.org/10.1109/TASE.2012.19","url":null,"abstract":"Data centric languages, such as recursive rule based languages, have been proposed to program distributed applications over networks. They greatly simplify the code, while still admitting efficient distributed execution, including on sensor networks. From previous work [1], we know that they also provide a promising approach to another tough issue about distributed protocols: their formal verification. Indeed, we can take advantage of their data centric orientation, which allows us to explicitly handle global structures such as the topology of the network. We illustrate here our approach on two non-trivial protocols and discuss its Coq implementation.","PeriodicalId":417979,"journal":{"name":"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127114344","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
Categorical Reasoning about Meta-models 元模型的范畴推理
2012 Sixth International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2012-07-04 DOI: 10.1109/TASE.2012.23
Laurent Thiry, Frédéric Fondement, Pierre-Alain Muller
{"title":"Categorical Reasoning about Meta-models","authors":"Laurent Thiry, Frédéric Fondement, Pierre-Alain Muller","doi":"10.1109/TASE.2012.23","DOIUrl":"https://doi.org/10.1109/TASE.2012.23","url":null,"abstract":"Category theory is a field of mathematics that studies relationships between structures. Meta Object Facility (MOF) is a language for designing metamodels whose structures are made of classes and relationships. This paper examines how key categorical concepts such as functors and natural transformations can be used for equational reasoning about modeling artifacts (models, metamodels, transformations). This leads to a formal way of specifying equivalence between models, and offers many practical applications including refactoring and reasoning.","PeriodicalId":417979,"journal":{"name":"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132118971","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
An Approach for Process Variability Control in Business Process Management 业务流程管理中的过程可变性控制方法
2012 Sixth International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2012-07-04 DOI: 10.1109/TASE.2012.25
Qing Yao, Yuqing Sun
{"title":"An Approach for Process Variability Control in Business Process Management","authors":"Qing Yao, Yuqing Sun","doi":"10.1109/TASE.2012.25","DOIUrl":"https://doi.org/10.1109/TASE.2012.25","url":null,"abstract":"To adapt to the demand of agile reengineering of business process in Business Process Management System, a kind of software model which based on message computing is proposed. Aiming at conducting varied modeling of the business process variation type through the message transferred between functional activity and connector, the model is made up by business functional activities and logic calculation modules (connector). The process structure is controlled by the logic calculation between messages and connectors. Process change and stability can be limited through defining the replaceable and restrictive relations between functional activities or process structure. A demonstration of a partial process applied to insurance management information system illustrates the above-mentioned model's support for business process convenient adjustive.","PeriodicalId":417979,"journal":{"name":"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131828217","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
Verifying OO Programs by Linking Algebraic and Abstract Specifications 通过连接代数和抽象规范验证OO程序
2012 Sixth International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2012-07-04 DOI: 10.1109/TASE.2012.41
Qin Shu, Shuling Wang, Yijing Liu
{"title":"Verifying OO Programs by Linking Algebraic and Abstract Specifications","authors":"Qin Shu, Shuling Wang, Yijing Liu","doi":"10.1109/TASE.2012.41","DOIUrl":"https://doi.org/10.1109/TASE.2012.41","url":null,"abstract":"In this paper, we propose an approach for verifying the correctness of object-oriented (OO) programs with respect to the algebraic specifications. Compared to the functional specification that emphasizes on specifying what a single operation does, algebraic specification, which was proposed originally for specifying abstract data types, specifies what different operations of a class are related to each other. We first extend the algebraic specification of abstract data types to OO programs, and then prove the conformance of the implementation of programs to the algebraic specifications by taking functional specification as a bridge.","PeriodicalId":417979,"journal":{"name":"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124403746","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
On model construction for modal mu-calculus 模态微积分的模型构造
2012 Sixth International Symposium on Theoretical Aspects of Software Engineering Pub Date : 2012-07-04 DOI: 10.1109/TASE.2012.49
Nan Qu
{"title":"On model construction for modal mu-calculus","authors":"Nan Qu","doi":"10.1109/TASE.2012.49","DOIUrl":"https://doi.org/10.1109/TASE.2012.49","url":null,"abstract":"This paper presents a tableau system for checking satisfiability of modal μ-calculus formulas. When a formula F is satisfiable, a model with size bounded by 2[F] can be extracted from the tableau. We also show that the asymptotic lower bound for the model size of formulas is greater than any polynomial function of the size of formulas.","PeriodicalId":417979,"journal":{"name":"2012 Sixth International Symposium on Theoretical Aspects of Software Engineering","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121704267","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
首页 上一页 下一页 尾页
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学术官方微信