Pub Date : 2003-11-06DOI: 10.1109/QSIC.2003.1319129
W. Tsai, A. Saimi, Lian Yu, R. Paul
This paper presents a scenario-based object-oriented test framework (SOOTF) for adaptive and rapid testing. The framework takes test scenario specification as input, prepares data for test execution, performs test execution, and evaluates test results with a database support. The framework also has several built-in regression testing strategies that can be used to test the modified software. The framework is implemented in Java using many OO design patterns such as template method, strategy, and composite. The framework is implemented using a 3-tiered architecture with GUI front end, and test management in the middle, and a database at the backend. Whenever there is a change to the system/application under test, SOOTF identifies all the potentially affected scenarios, and perform regression testing using existing test cases stored in the database. A tester may also reuse the existing test scripts to perform stress testing. This paper uses a banking system example to illustrate the framework.
{"title":"Scenario-based object-oriented testing framework","authors":"W. Tsai, A. Saimi, Lian Yu, R. Paul","doi":"10.1109/QSIC.2003.1319129","DOIUrl":"https://doi.org/10.1109/QSIC.2003.1319129","url":null,"abstract":"This paper presents a scenario-based object-oriented test framework (SOOTF) for adaptive and rapid testing. The framework takes test scenario specification as input, prepares data for test execution, performs test execution, and evaluates test results with a database support. The framework also has several built-in regression testing strategies that can be used to test the modified software. The framework is implemented in Java using many OO design patterns such as template method, strategy, and composite. The framework is implemented using a 3-tiered architecture with GUI front end, and test management in the middle, and a database at the backend. Whenever there is a change to the system/application under test, SOOTF identifies all the potentially affected scenarios, and perform regression testing using existing test cases stored in the database. A tester may also reuse the existing test scripts to perform stress testing. This paper uses a banking system example to illustrate the framework.","PeriodicalId":145980,"journal":{"name":"Third International Conference on Quality Software, 2003. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2003-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121823754","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}
Pub Date : 2003-11-06DOI: 10.1109/QSIC.2003.1319111
P. Dybjer, Qiao Haiyan, M. Takeyama
We propose a method for improving confidence in the correctness of Haskell programs by combining testing and proving. Testing is used for debugging programs and specification before a costly proof attempt. During a proof development, testing also quickly eliminates wrong conjectures. Proving helps us to decompose a testing task in a way that is guaranteed to be correct. To demonstrate the method, we have extended the Agda/Alfa proof assistant for dependent type theory with a tool for random testing. As an example, we show how the correctness of a BDD-algorithm written in Haskell is verified by testing properties of component functions. We also discuss faithful translations from Haskell to type theory.
{"title":"Verifying Haskell programs by combining testing and proving","authors":"P. Dybjer, Qiao Haiyan, M. Takeyama","doi":"10.1109/QSIC.2003.1319111","DOIUrl":"https://doi.org/10.1109/QSIC.2003.1319111","url":null,"abstract":"We propose a method for improving confidence in the correctness of Haskell programs by combining testing and proving. Testing is used for debugging programs and specification before a costly proof attempt. During a proof development, testing also quickly eliminates wrong conjectures. Proving helps us to decompose a testing task in a way that is guaranteed to be correct. To demonstrate the method, we have extended the Agda/Alfa proof assistant for dependent type theory with a tool for random testing. As an example, we show how the correctness of a BDD-algorithm written in Haskell is verified by testing properties of component functions. We also discuss faithful translations from Haskell to type theory.","PeriodicalId":145980,"journal":{"name":"Third International Conference on Quality Software, 2003. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2003-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116901417","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}
Pub Date : 2003-11-06DOI: 10.1109/QSIC.2003.1319127
Shaohua Liu, Jun Wei, Wei Xu
Emerging service oriented business process management (BPM) systems require efficient middleware infrastructure. However, current techniques for middleware are not optimal for that because they all do not have service-oriented natures themselves. This paper introduces a novel service cooperation middleware (SCM), which is designed to meet such requirements. It improves the development and integration of loosely coupled service oriented BPM system by applying several concepts such as control flow semantic and projection operation, etc. Furthermore, based on the SCM architecture, the related process integration suit viz. ISProcessIntegration (PI) can be widely applied into all kinds of scenes, for example EAI, B2B, B2C, P2P, cluster, with different topologies.
{"title":"Diversifying and improving business process management systems by service cooperation middleware","authors":"Shaohua Liu, Jun Wei, Wei Xu","doi":"10.1109/QSIC.2003.1319127","DOIUrl":"https://doi.org/10.1109/QSIC.2003.1319127","url":null,"abstract":"Emerging service oriented business process management (BPM) systems require efficient middleware infrastructure. However, current techniques for middleware are not optimal for that because they all do not have service-oriented natures themselves. This paper introduces a novel service cooperation middleware (SCM), which is designed to meet such requirements. It improves the development and integration of loosely coupled service oriented BPM system by applying several concepts such as control flow semantic and projection operation, etc. Furthermore, based on the SCM architecture, the related process integration suit viz. ISProcessIntegration (PI) can be widely applied into all kinds of scenes, for example EAI, B2B, B2C, P2P, cluster, with different topologies.","PeriodicalId":145980,"journal":{"name":"Third International Conference on Quality Software, 2003. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2003-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120858562","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}
Pub Date : 2003-11-06DOI: 10.1109/QSIC.2003.1319086
Jennifer Pérez, I. Ramos, J. Martínez, P. Letelier, Elena Navarro
The development of software systems must be done using platforms that allow the description of quality, complex, distributed, dynamic and reusable architectural models. We present in this paper PRISMA, an architectural modelling approach based on aspects and components that uses a component definition language (components, connectors and systems) to define architectural types at a high abstraction level and a configuration language to design the architecture of software systems. The component definition language increases reuse allowing importation of COTS and reduces complexity by integrating two modern software development approaches: component-based software development and aspect-oriented software development. The configuration language designs the architecture of software systems by creating and interconnecting instances of the defined types including possible imported COTS. PRISMA has a metalevel with reflexive properties for these two languages. For this reason, the types of PRISMA may evolve and the topologies of PRISMA may be reconfigured dynamically.
{"title":"PRISMA: towards quality, aspect oriented and dynamic software architectures","authors":"Jennifer Pérez, I. Ramos, J. Martínez, P. Letelier, Elena Navarro","doi":"10.1109/QSIC.2003.1319086","DOIUrl":"https://doi.org/10.1109/QSIC.2003.1319086","url":null,"abstract":"The development of software systems must be done using platforms that allow the description of quality, complex, distributed, dynamic and reusable architectural models. We present in this paper PRISMA, an architectural modelling approach based on aspects and components that uses a component definition language (components, connectors and systems) to define architectural types at a high abstraction level and a configuration language to design the architecture of software systems. The component definition language increases reuse allowing importation of COTS and reduces complexity by integrating two modern software development approaches: component-based software development and aspect-oriented software development. The configuration language designs the architecture of software systems by creating and interconnecting instances of the defined types including possible imported COTS. PRISMA has a metalevel with reflexive properties for these two languages. For this reason, the types of PRISMA may evolve and the topologies of PRISMA may be reconfigured dynamically.","PeriodicalId":145980,"journal":{"name":"Third International Conference on Quality Software, 2003. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2003-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130543322","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}
Pub Date : 2003-11-06DOI: 10.1109/QSIC.2003.1319091
Sirin Bekbay, Shaoying Liu
The goal of this paper is to examine the Japanese experience with the software development process, the challenges they face and how formal engineering methods, in particular SOFL (structured object-oriented formal language), can help overcome these problems. We also recommend additional management tools and documents that can aid organizations in achieving a higher CMM rating through the use of SOFL.
{"title":"A study of Japanese software process practices and a potential for improvement using SOFL","authors":"Sirin Bekbay, Shaoying Liu","doi":"10.1109/QSIC.2003.1319091","DOIUrl":"https://doi.org/10.1109/QSIC.2003.1319091","url":null,"abstract":"The goal of this paper is to examine the Japanese experience with the software development process, the challenges they face and how formal engineering methods, in particular SOFL (structured object-oriented formal language), can help overcome these problems. We also recommend additional management tools and documents that can aid organizations in achieving a higher CMM rating through the use of SOFL.","PeriodicalId":145980,"journal":{"name":"Third International Conference on Quality Software, 2003. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2003-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134549097","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}
Pub Date : 2003-11-06DOI: 10.1109/QSIC.2003.1319114
R. Ibrahim, Marlene Lu
Formal notations and mathematics are used in several areas to capture the requirements and express the functionalities of the software. This paper focuses on the use of formal methods to model the real world environment in a Malaysian plywood production manufacturing industry. The formal methods are used to describe abstractly the plywood production system in the aspect of its behavior but not precisely the way the system is programmed. Other informal description does the same, but with a formal description, we can determine (in theory) whether or not a real system satisfies its description and functionalities. Because of this, precise analysis on the description itself can be performed and it exposes design decisions which otherwise might not be identified until the system prototype is being developed.
{"title":"Formal methods applied to plywood production","authors":"R. Ibrahim, Marlene Lu","doi":"10.1109/QSIC.2003.1319114","DOIUrl":"https://doi.org/10.1109/QSIC.2003.1319114","url":null,"abstract":"Formal notations and mathematics are used in several areas to capture the requirements and express the functionalities of the software. This paper focuses on the use of formal methods to model the real world environment in a Malaysian plywood production manufacturing industry. The formal methods are used to describe abstractly the plywood production system in the aspect of its behavior but not precisely the way the system is programmed. Other informal description does the same, but with a formal description, we can determine (in theory) whether or not a real system satisfies its description and functionalities. Because of this, precise analysis on the description itself can be performed and it exposes design decisions which otherwise might not be identified until the system prototype is being developed.","PeriodicalId":145980,"journal":{"name":"Third International Conference on Quality Software, 2003. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2003-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131064208","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}
Pub Date : 2003-11-06DOI: 10.1109/QSIC.2003.1319110
Yuen-Tak Yu, M. Lau, T. Chen
With the increasing complexity of software systems, the set of testing requirements can become very large. If the set of testing requirements can be naturally decomposed into smaller subsets, one may construct a test set separately to satisfy each subset of testing requirements, and then combine the test sets to form the complete test set. Such an approach is referred to as the union approach. On the other hand, the incremental approach attempts to incrementally expand a test set to satisfy the subsets of testing requirements, one at a time. This paper investigates empirically the effect of the incremental approach as compared to the union approach. Our case study indicates that the incremental approach can result in a significantly smaller test set, particularly when supplemented with the greedy heuristics.
{"title":"Using the incremental approach to generate test sets: a case study","authors":"Yuen-Tak Yu, M. Lau, T. Chen","doi":"10.1109/QSIC.2003.1319110","DOIUrl":"https://doi.org/10.1109/QSIC.2003.1319110","url":null,"abstract":"With the increasing complexity of software systems, the set of testing requirements can become very large. If the set of testing requirements can be naturally decomposed into smaller subsets, one may construct a test set separately to satisfy each subset of testing requirements, and then combine the test sets to form the complete test set. Such an approach is referred to as the union approach. On the other hand, the incremental approach attempts to incrementally expand a test set to satisfy the subsets of testing requirements, one at a time. This paper investigates empirically the effect of the incremental approach as compared to the union approach. Our case study indicates that the incremental approach can result in a significantly smaller test set, particularly when supplemented with the greedy heuristics.","PeriodicalId":145980,"journal":{"name":"Third International Conference on Quality Software, 2003. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2003-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133530858","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}
Pub Date : 2003-11-06DOI: 10.1109/QSIC.2003.1319092
Daniel Amyot, Xiangyang He, Yong He, Dae Yong Cho
The use case map (UCM) notation is being standardized as part of the user requirements notation (URN), the most recent addition to ITU-T's family of languages. UCM models describe functional requirements and high-level designs with causal paths superimposed on a structure of components. The generation of individual scenarios from UCM specifications enables the validation of requirements and facilitates the transition from requirements to design. In this paper, we address the challenges faced during the automated generation of such scenarios. Scenario definitions and traversal algorithms are first used to extract individual scenarios from UCMs and to store them as XML files. Transformations to other scenario languages (for instance, message sequence charts) are then achieved using XSLT. Possible applications of this two-step generation process include early validation and synthesis of design models. Illustrative examples are given based on our current tools and recent experiments.
{"title":"Generating scenarios from use case map specifications","authors":"Daniel Amyot, Xiangyang He, Yong He, Dae Yong Cho","doi":"10.1109/QSIC.2003.1319092","DOIUrl":"https://doi.org/10.1109/QSIC.2003.1319092","url":null,"abstract":"The use case map (UCM) notation is being standardized as part of the user requirements notation (URN), the most recent addition to ITU-T's family of languages. UCM models describe functional requirements and high-level designs with causal paths superimposed on a structure of components. The generation of individual scenarios from UCM specifications enables the validation of requirements and facilitates the transition from requirements to design. In this paper, we address the challenges faced during the automated generation of such scenarios. Scenario definitions and traversal algorithms are first used to extract individual scenarios from UCMs and to store them as XML files. Transformations to other scenario languages (for instance, message sequence charts) are then achieved using XSLT. Possible applications of this two-step generation process include early validation and synthesis of design models. Illustrative examples are given based on our current tools and recent experiments.","PeriodicalId":145980,"journal":{"name":"Third International Conference on Quality Software, 2003. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2003-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132200992","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}
Pub Date : 2003-11-06DOI: 10.1109/QSIC.2003.1319078
B. Thuraisingham
Data mining is the process of posing queries and extracting patterns, often previously unknown from large quantities of data using pattern matching or other reasoning techniques. Cyber security is the area that deals with protecting from cyber terrorism. Cyber attacks include access control violations, unauthorized intrusions, and denial of service as well as insider threat. The presentation provides an overview of data mining techniques and cyber threats and discusses developments in applying data mining for cyber security.
{"title":"Data mining and cyber security","authors":"B. Thuraisingham","doi":"10.1109/QSIC.2003.1319078","DOIUrl":"https://doi.org/10.1109/QSIC.2003.1319078","url":null,"abstract":"Data mining is the process of posing queries and extracting patterns, often previously unknown from large quantities of data using pattern matching or other reasoning techniques. Cyber security is the area that deals with protecting from cyber terrorism. Cyber attacks include access control violations, unauthorized intrusions, and denial of service as well as insider threat. The presentation provides an overview of data mining techniques and cyber threats and discusses developments in applying data mining for cyber security.","PeriodicalId":145980,"journal":{"name":"Third International Conference on Quality Software, 2003. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2003-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117315278","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}
Pub Date : 2003-11-06DOI: 10.1109/QSIC.2003.1319093
Kazutaka Maruyama, M. Terada
Many programmers have had to deal with an overwritten variable resulting for example from an aliasing problem. The culprit is obviously the last write-access to that memory location before the manifestation of the bug. The usual technique for removing such bugs starts with the debugger by (1) finding the last write and (2) moving the control point of execution back to that time by re-executing the program from the beginning. We call the feature to implement this process "reverse watchpoint" and believe automating it is important. In this paper we propose a new concept, "position ", that is, a point in the program execution trace, as needed for step (2) above. The position enables debuggers to automate the control of program execution to support common debugging activities. We have implemented position in Java with a bytecode transformer. Measurements show that position can be provided with an acceptable amount of overhead.
{"title":"Debugging with reverse watchpoint","authors":"Kazutaka Maruyama, M. Terada","doi":"10.1109/QSIC.2003.1319093","DOIUrl":"https://doi.org/10.1109/QSIC.2003.1319093","url":null,"abstract":"Many programmers have had to deal with an overwritten variable resulting for example from an aliasing problem. The culprit is obviously the last write-access to that memory location before the manifestation of the bug. The usual technique for removing such bugs starts with the debugger by (1) finding the last write and (2) moving the control point of execution back to that time by re-executing the program from the beginning. We call the feature to implement this process \"reverse watchpoint\" and believe automating it is important. In this paper we propose a new concept, \"position \", that is, a point in the program execution trace, as needed for step (2) above. The position enables debuggers to automate the control of program execution to support common debugging activities. We have implemented position in Java with a bytecode transformer. Measurements show that position can be provided with an acceptable amount of overhead.","PeriodicalId":145980,"journal":{"name":"Third International Conference on Quality Software, 2003. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2003-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132270541","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
扫码关注我们
求助内容：
应助结果提醒方式：