Tobias is a combinatorial testing tool that was used succesfully on several case studies. Currently, the evolution of the tool goes through a significant redevelopment effort. A first step is the production of an executable specification of the Tobias Test Generator. The goal of this specification effort is to provide a synthetic and precise description of Tobias to the developers of the new tool. The specification is expressed in the Z language, supported by the Jaza animator. The executable character of the specification is exploited (1) to assess non-regression of the specification with respect to the existing tool, and (2) to explore new functionalities for the tool.
Tobias是一个组合测试工具，已成功地用于几个案例研究。目前，该工具的发展经历了重大的再开发工作。第一步是生成Tobias Test Generator的可执行规范。该规范工作的目标是为新工具的开发人员提供Tobias的综合而精确的描述。该规范用Z语言表示，由Jaza动画器支持。规范的可执行特性被用于(1)评估与现有工具相关的规范的非回归性，以及(2)探索工具的新功能。
{"title":"Tobias-Z: An executable formal specification of a test generator","authors":"Y. Ledru, L. D. Bousquet","doi":"10.1109/ASE.2006.67","DOIUrl":"https://doi.org/10.1109/ASE.2006.67","url":null,"abstract":"Tobias is a combinatorial testing tool that was used succesfully on several case studies. Currently, the evolution of the tool goes through a significant redevelopment effort. A first step is the production of an executable specification of the Tobias Test Generator. The goal of this specification effort is to provide a synthetic and precise description of Tobias to the developers of the new tool. The specification is expressed in the Z language, supported by the Jaza animator. The executable character of the specification is exploited (1) to assess non-regression of the specification with respect to the existing tool, and (2) to explore new functionalities for the tool.","PeriodicalId":90522,"journal":{"name":"IEEE/ACM International Conference on Automated Software Engineering workshops. IEEE/ACM International Conference on Automated Software Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84104002","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}
The DARPA Grand Challenge has been the most significant challenge to the mobile robotics community in more than a decade. The challenge was to build an autonomous robot capable of traversing 132 miles of unrehearsed desert terrain in less than 10 hours. In 2004, the best robot only made 7.3 miles. In 2005, Stanford won the challenge and the $2M prize money by successfully traversing the course in less than 7 hours. This talk, delivered by the leader of the Stanford Racing Team, will provide insights in the software architecture of Stanford's winning robot. The robot massively relied on machine learning and probabilistic modeling for sensor interpretation, and robot motion planning algorithms for vehicle guidance and control. The speaker will explain some of the basic algorithms and share some of the excitement characterizing this historic event. He will also discuss the implications of this work for the future of the transportation.
{"title":"Winning the DARPA Grand Challenge: A Robot Race through the Mojave Desert","authors":"","doi":"10.1109/ASE.2006.74","DOIUrl":"https://doi.org/10.1109/ASE.2006.74","url":null,"abstract":"The DARPA Grand Challenge has been the most significant challenge to the mobile robotics community in more than a decade. The challenge was to build an autonomous robot capable of traversing 132 miles of unrehearsed desert terrain in less than 10 hours. In 2004, the best robot only made 7.3 miles. In 2005, Stanford won the challenge and the $2M prize money by successfully traversing the course in less than 7 hours. This talk, delivered by the leader of the Stanford Racing Team, will provide insights in the software architecture of Stanford's winning robot. The robot massively relied on machine learning and probabilistic modeling for sensor interpretation, and robot motion planning algorithms for vehicle guidance and control. The speaker will explain some of the basic algorithms and share some of the excitement characterizing this historic event. He will also discuss the implications of this work for the future of the transportation.","PeriodicalId":90522,"journal":{"name":"IEEE/ACM International Conference on Automated Software Engineering workshops. IEEE/ACM International Conference on Automated Software Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79007186","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}
Ji Wu, Xiao-xia Jia, Chang Liu, Hai-yan Yang, Chao Liu, Maozhong Jin
{"title":"A Statistical Model to Locate Faults at Input Level","authors":"Ji Wu, Xiao-xia Jia, Chang Liu, Hai-yan Yang, Chao Liu, Maozhong Jin","doi":"10.1109/ASE.2004.10008","DOIUrl":"https://doi.org/10.1109/ASE.2004.10008","url":null,"abstract":"","PeriodicalId":90522,"journal":{"name":"IEEE/ACM International Conference on Automated Software Engineering workshops. IEEE/ACM International Conference on Automated Software Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78199896","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}
P. Graunke, R. Findler, S. Krishnamurthi, M. Felleisen
{"title":"Automatically Restructuring Programs for the We","authors":"P. Graunke, R. Findler, S. Krishnamurthi, M. Felleisen","doi":"10.1109/ASE.2001.989807","DOIUrl":"https://doi.org/10.1109/ASE.2001.989807","url":null,"abstract":"","PeriodicalId":90522,"journal":{"name":"IEEE/ACM International Conference on Automated Software Engineering workshops. IEEE/ACM International Conference on Automated Software Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2001-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76228846","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}
Distributed information systems for decision support and e-commerce applications require coordination of multiple autonomous components and their services to accomplish a set of global goals. In such systems, a global and often distributed coordination policy actively governs the coordination among the distributed components. The policies are used to interpret messages or events (e.g., job assignments, changes in data) from the cooperating components, in order to generate tasks with sequencing constraints. The generated tasks and their sequencing are then used as a basis for coordination of the services provided and required by the components. This paper presents the SWAP architecture that addresses the problem of dynamic changes in the needs or context of the autonomous components via change in the coordination policy at run-time. We present a method in the context of SWAP for the systematic generation of change coordination plans supporting the automated switching of coordination policies.
{"title":"Systematic Generation of Dependable Change Coordination Plans for Automated Switching of Coordination Policies","authors":"P. Bose, Mark G. Matthews","doi":"10.1109/ASE.2000.873689","DOIUrl":"https://doi.org/10.1109/ASE.2000.873689","url":null,"abstract":"Distributed information systems for decision support and e-commerce applications require coordination of multiple autonomous components and their services to accomplish a set of global goals. In such systems, a global and often distributed coordination policy actively governs the coordination among the distributed components. The policies are used to interpret messages or events (e.g., job assignments, changes in data) from the cooperating components, in order to generate tasks with sequencing constraints. The generated tasks and their sequencing are then used as a basis for coordination of the services provided and required by the components. This paper presents the SWAP architecture that addresses the problem of dynamic changes in the needs or context of the autonomous components via change in the coordination policy at run-time. We present a method in the context of SWAP for the systematic generation of change coordination plans supporting the automated switching of coordination policies.","PeriodicalId":90522,"journal":{"name":"IEEE/ACM International Conference on Automated Software Engineering workshops. IEEE/ACM International Conference on Automated Software Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2000-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78190893","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":"Evaluation of Automated Software Engineering Systems? (Panel)","authors":"J. Penix","doi":"10.1109/ASE.1999.10005","DOIUrl":"https://doi.org/10.1109/ASE.1999.10005","url":null,"abstract":"","PeriodicalId":90522,"journal":{"name":"IEEE/ACM International Conference on Automated Software Engineering workshops. IEEE/ACM International Conference on Automated Software Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84314956","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":"Can Model Checking Scale to Software? (Panel)","authors":"D. Redmiles","doi":"10.1109/ASE.1999.10006","DOIUrl":"https://doi.org/10.1109/ASE.1999.10006","url":null,"abstract":"","PeriodicalId":90522,"journal":{"name":"IEEE/ACM International Conference on Automated Software Engineering workshops. IEEE/ACM International Conference on Automated Software Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79643530","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":"Modular and Incremental Analysis of Concurrent Software Systems","authors":"Hassen Saïdi","doi":"10.1109/ASE.1999.802128","DOIUrl":"https://doi.org/10.1109/ASE.1999.802128","url":null,"abstract":"","PeriodicalId":90522,"journal":{"name":"IEEE/ACM International Conference on Automated Software Engineering workshops. IEEE/ACM International Conference on Automated Software Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74637198","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：