Pub Date : 2001-10-08DOI: 10.1109/CMPSAC.2001.960639
Sami Beydeda, V. Gruhn
In recent years, several techniques have been proposed for class-level regression testing. Most of these techniques focus either on white- or black-box testing, although an integrated approach can have several benefits. As similar tasks have to be carried out for both white- and black-box testing, an integrated approach can improve efficiency and cost effectiveness. The article explains an approach for class-level regression testing, integrating existing techniques. Particularly, those of Rothermel et al. (2000) and Hong et al. (1995) for white-box regression testing and black-box testing, respectively, have been integrated into a single technique. The benefits of the resulting technique are shown by example.
近年来，已经提出了几种用于类水平回归测试的技术。尽管集成的方法可以带来一些好处，但这些技术中的大多数都侧重于白盒测试或黑盒测试。由于必须为白盒和黑盒测试执行类似的任务，因此集成的方法可以提高效率和成本效益。本文解释了一种集成现有技术的类级回归测试方法。特别是，Rothermel et al.(2000)和Hong et al.(1995)分别对白盒回归测试和黑盒测试的研究已被整合为一种技术。通过实例说明了所得到的技术的优点。
{"title":"Integrating white- and black-box techniques for class-level regression testing","authors":"Sami Beydeda, V. Gruhn","doi":"10.1109/CMPSAC.2001.960639","DOIUrl":"https://doi.org/10.1109/CMPSAC.2001.960639","url":null,"abstract":"In recent years, several techniques have been proposed for class-level regression testing. Most of these techniques focus either on white- or black-box testing, although an integrated approach can have several benefits. As similar tasks have to be carried out for both white- and black-box testing, an integrated approach can improve efficiency and cost effectiveness. The article explains an approach for class-level regression testing, integrating existing techniques. Particularly, those of Rothermel et al. (2000) and Hong et al. (1995) for white-box regression testing and black-box testing, respectively, have been integrated into a single technique. The benefits of the resulting technique are shown by example.","PeriodicalId":269568,"journal":{"name":"25th Annual International Computer Software and Applications Conference. COMPSAC 2001","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132233672","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 : 2001-10-08DOI: 10.1109/CMPSAC.2001.960680
Yiyu Yao
This paper deals with the formal and mathematical modeling of data mining. A framework is proposed for rule mining based on granular computing. It is developed in the Tarski's style through the notions of a model and satisfiability. The model is a database consisting of a finite set of objects described by a finite set of attributes. Within this framework, a concept is defined as a pair consisting of the intension, an expression in a certain language over the set of attributes, and an extension of the concept, a subset of the universe. An object satisfies the expression of a concept if the object has the properties as specified by the expression, and the object belongs to the extension of the concepts. Rules are used to describe relationships between concepts. A rule is expressed in terms of the intentions of the two concepts and is interpreted in terms of the extensions of the concepts. Two interpretations of rules are examined in detail, one is based on the logical implication and the other on the conditional probability.
{"title":"On modeling data mining with granular computing","authors":"Yiyu Yao","doi":"10.1109/CMPSAC.2001.960680","DOIUrl":"https://doi.org/10.1109/CMPSAC.2001.960680","url":null,"abstract":"This paper deals with the formal and mathematical modeling of data mining. A framework is proposed for rule mining based on granular computing. It is developed in the Tarski's style through the notions of a model and satisfiability. The model is a database consisting of a finite set of objects described by a finite set of attributes. Within this framework, a concept is defined as a pair consisting of the intension, an expression in a certain language over the set of attributes, and an extension of the concept, a subset of the universe. An object satisfies the expression of a concept if the object has the properties as specified by the expression, and the object belongs to the extension of the concepts. Rules are used to describe relationships between concepts. A rule is expressed in terms of the intentions of the two concepts and is interpreted in terms of the extensions of the concepts. Two interpretations of rules are examined in detail, one is based on the logical implication and the other on the conditional probability.","PeriodicalId":269568,"journal":{"name":"25th Annual International Computer Software and Applications Conference. COMPSAC 2001","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115540284","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 : 2001-10-08DOI: 10.1109/CMPSAC.2001.960640
Hong Zhu, Xudong He
Integration testing plays a crucial role in component-based software development. Complementary to the existing works on the selection of test cases and measurement of test adequacy in integration testing, the paper focuses on questions about how to observe the behaviours of a large and complicated system during dynamic testing. We first analyse the structure of white-box integration testing and propose a family of integration testing methods. We then discuss and formalise the requirements of proper uses of test drivers and component stubs in incremental integration. Finally, we propose a set of axioms for integration testing of concurrent systems.
{"title":"An observational theory of integration testing for component-based software development","authors":"Hong Zhu, Xudong He","doi":"10.1109/CMPSAC.2001.960640","DOIUrl":"https://doi.org/10.1109/CMPSAC.2001.960640","url":null,"abstract":"Integration testing plays a crucial role in component-based software development. Complementary to the existing works on the selection of test cases and measurement of test adequacy in integration testing, the paper focuses on questions about how to observe the behaviours of a large and complicated system during dynamic testing. We first analyse the structure of white-box integration testing and propose a family of integration testing methods. We then discuss and formalise the requirements of proper uses of test drivers and component stubs in incremental integration. Finally, we propose a set of axioms for integration testing of concurrent systems.","PeriodicalId":269568,"journal":{"name":"25th Annual International Computer Software and Applications Conference. COMPSAC 2001","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126674073","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 : 2001-10-08DOI: 10.1109/CMPSAC.2001.960636
Yin-Shinn Chen, Feng-Jian Wang
Business processes are often complex and varying. Workflow technologies help people minimize errors and delays in the progress of a process within an enterprise. Within a workflow management system (WFMS), a process or even a project can be specified and interpreted to work directly. In this paper, we present an editing system and its two major components, PDE (Process Definition Editor) and FormDesigner, for the specification of a process. PDE is a graphical editor for constructing /modifying process definitions. FormDesigner assumes the responsibility of integrating software components for building/modifying active application forms. With PDE and FormDesigner, a workflow application system can be constructed/modified rapidly and easily so that the WFMS is allowed to run smoothly.
{"title":"An editing system for working processes","authors":"Yin-Shinn Chen, Feng-Jian Wang","doi":"10.1109/CMPSAC.2001.960636","DOIUrl":"https://doi.org/10.1109/CMPSAC.2001.960636","url":null,"abstract":"Business processes are often complex and varying. Workflow technologies help people minimize errors and delays in the progress of a process within an enterprise. Within a workflow management system (WFMS), a process or even a project can be specified and interpreted to work directly. In this paper, we present an editing system and its two major components, PDE (Process Definition Editor) and FormDesigner, for the specification of a process. PDE is a graphical editor for constructing /modifying process definitions. FormDesigner assumes the responsibility of integrating software components for building/modifying active application forms. With PDE and FormDesigner, a workflow application system can be constructed/modified rapidly and easily so that the WFMS is allowed to run smoothly.","PeriodicalId":269568,"journal":{"name":"25th Annual International Computer Software and Applications Conference. COMPSAC 2001","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132785566","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 : 2001-10-08DOI: 10.1109/CMPSAC.2001.960635
S. Baranov, V. Kotlyarov
A technique for a complete cycle of automated design and development of embedded software in accordance with a strictly defined architecture is presented. Its characteristic feature is a tool and technology support for software development on the basis of the selected platform architecture and product specifications.
{"title":"Automation of design and development of embedded software on the basis of a strictly defined software architecture","authors":"S. Baranov, V. Kotlyarov","doi":"10.1109/CMPSAC.2001.960635","DOIUrl":"https://doi.org/10.1109/CMPSAC.2001.960635","url":null,"abstract":"A technique for a complete cycle of automated design and development of embedded software in accordance with a strictly defined architecture is presented. Its characteristic feature is a tool and technology support for software development on the basis of the selected platform architecture and product specifications.","PeriodicalId":269568,"journal":{"name":"25th Annual International Computer Software and Applications Conference. COMPSAC 2001","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133401520","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 : 2001-10-08DOI: 10.1109/CMPSAC.2001.960667
P. O'Connell, R. McCrindle
Software products have become increasingly complicated over the past decade. For example, software is no longer restricted to a single binary file constructed from a small number of source files residing at a single location. Products today are frequently split across client and server architectures with further complications arising through the need for the client and the server to be built and run on different platforms, developed and deployed in multiple physical locations and by workers spanning several different time zones. These factors contribute to making modern software configuration management (CM) a vital but extremely complex process. In this paper we describe a new method for managing the configuration management of evolving modern day distributed systems based on the use of emerging web technologies, specifically XML (Extended Markup Language) XML-RPC (XML-Remote Procedure Call) and SOAP (Simple Object Access Protocol).
{"title":"Using SOAP to clean up configuration management","authors":"P. O'Connell, R. McCrindle","doi":"10.1109/CMPSAC.2001.960667","DOIUrl":"https://doi.org/10.1109/CMPSAC.2001.960667","url":null,"abstract":"Software products have become increasingly complicated over the past decade. For example, software is no longer restricted to a single binary file constructed from a small number of source files residing at a single location. Products today are frequently split across client and server architectures with further complications arising through the need for the client and the server to be built and run on different platforms, developed and deployed in multiple physical locations and by workers spanning several different time zones. These factors contribute to making modern software configuration management (CM) a vital but extremely complex process. In this paper we describe a new method for managing the configuration management of evolving modern day distributed systems based on the use of emerging web technologies, specifically XML (Extended Markup Language) XML-RPC (XML-Remote Procedure Call) and SOAP (Simple Object Access Protocol).","PeriodicalId":269568,"journal":{"name":"25th Annual International Computer Software and Applications Conference. COMPSAC 2001","volume":" 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113951962","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 : 2001-10-08DOI: 10.1109/CMPSAC.2001.960665
C. Ma, Carl K. Chang, J. Cleland-Huang
Software metrics increase our ability to understand the behavior of software systems. An accurate measurement provides us with solid understanding of the entity we are measuring. In Object Oriented software, most current metrics quantify a class's coupling complexity by simply counting the number of connections with other classes but such metrics are unable to capture the underlying complexity or tension of individual connections. In this paper we propose a technique for measuring the strength of interclass relationships that takes into account both the number of statements participating in the connection, as well as the complexity of those statements. Our approach introduces a new concept for measuring Object Oriented coupling complexity and provides a more sensitive measurement than traditional approaches. We present examples in C++ to support our method.
{"title":"Measuring the intensity of object coupling in C++ programs","authors":"C. Ma, Carl K. Chang, J. Cleland-Huang","doi":"10.1109/CMPSAC.2001.960665","DOIUrl":"https://doi.org/10.1109/CMPSAC.2001.960665","url":null,"abstract":"Software metrics increase our ability to understand the behavior of software systems. An accurate measurement provides us with solid understanding of the entity we are measuring. In Object Oriented software, most current metrics quantify a class's coupling complexity by simply counting the number of connections with other classes but such metrics are unable to capture the underlying complexity or tension of individual connections. In this paper we propose a technique for measuring the strength of interclass relationships that takes into account both the number of statements participating in the connection, as well as the complexity of those statements. Our approach introduces a new concept for measuring Object Oriented coupling complexity and provides a more sensitive measurement than traditional approaches. We present examples in C++ to support our method.","PeriodicalId":269568,"journal":{"name":"25th Annual International Computer Software and Applications Conference. COMPSAC 2001","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124560858","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 : 2001-10-08DOI: 10.1109/CMPSAC.2001.960619
Xiaoshan Li, Zhiming Liu, Jifeng He
We have recently proposed a formalization of the use of UML in requirement analysis. This paper applies that formalization to a library system as a case study. We intend to show how the approach supports a use case-driven, step-wised and incremental development in building models for requirement analysis. The actual process of building the models shows the importance and feasibility of the formalization itself.
{"title":"Formal and use-case driven requirement analysis in UML","authors":"Xiaoshan Li, Zhiming Liu, Jifeng He","doi":"10.1109/CMPSAC.2001.960619","DOIUrl":"https://doi.org/10.1109/CMPSAC.2001.960619","url":null,"abstract":"We have recently proposed a formalization of the use of UML in requirement analysis. This paper applies that formalization to a library system as a case study. We intend to show how the approach supports a use case-driven, step-wised and incremental development in building models for requirement analysis. The actual process of building the models shows the importance and feasibility of the formalization itself.","PeriodicalId":269568,"journal":{"name":"25th Annual International Computer Software and Applications Conference. COMPSAC 2001","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114360456","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 : 2001-10-08DOI: 10.1109/CMPSAC.2001.960623
M. Pong
We describe the motivation, the concept, and the architecture of our electronic contract signing gateway (EC-SignGate) that lets e-merchants without public key infrastructure installation employ digital signatures in their web-based e-business.
{"title":"EC-SignGate: electronic contract signing gateway","authors":"M. Pong","doi":"10.1109/CMPSAC.2001.960623","DOIUrl":"https://doi.org/10.1109/CMPSAC.2001.960623","url":null,"abstract":"We describe the motivation, the concept, and the architecture of our electronic contract signing gateway (EC-SignGate) that lets e-merchants without public key infrastructure installation employ digital signatures in their web-based e-business.","PeriodicalId":269568,"journal":{"name":"25th Annual International Computer Software and Applications Conference. COMPSAC 2001","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125431660","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 : 2001-10-08DOI: 10.1109/CMPSAC.2001.960664
Jianjun Zhao, Jingde Cheng, K. Ushijima
In this paper we describe a program analysis system called CLPKIDS, that is based on program dependence analysis, to support development of software engineering tools for understanding, testing, debugging, maintenance and complexity measurement of concurrent logic programs.
{"title":"CLPKIDS: a program analysis system for concurrent logic programs","authors":"Jianjun Zhao, Jingde Cheng, K. Ushijima","doi":"10.1109/CMPSAC.2001.960664","DOIUrl":"https://doi.org/10.1109/CMPSAC.2001.960664","url":null,"abstract":"In this paper we describe a program analysis system called CLPKIDS, that is based on program dependence analysis, to support development of software engineering tools for understanding, testing, debugging, maintenance and complexity measurement of concurrent logic programs.","PeriodicalId":269568,"journal":{"name":"25th Annual International Computer Software and Applications Conference. COMPSAC 2001","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130377130","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
扫码关注我们
求助内容：
应助结果提醒方式：