Pub Date : 2003-11-17DOI: 10.1109/CMPSAC.2003.1245331
D. Zubrow
This paper examines the current stage of adoption of the Capability Maturity Model Integration (CMMI) Product Suite. It is based on appraisal reports submitted to and processed by the Software Engineering Institute (SEI/sup SM/) as of July 10, 2003. Relevant appraisal data-including organization type, geographic distribution, and appraisal history-are used to describe CMMI adoption and use patterns. This paper also explains some characteristics of the appraisal process and obtained results.
{"title":"Current trends in adoption of the CMMI/spl reg/ Product Suite","authors":"D. Zubrow","doi":"10.1109/CMPSAC.2003.1245331","DOIUrl":"https://doi.org/10.1109/CMPSAC.2003.1245331","url":null,"abstract":"This paper examines the current stage of adoption of the Capability Maturity Model Integration (CMMI) Product Suite. It is based on appraisal reports submitted to and processed by the Software Engineering Institute (SEI/sup SM/) as of July 10, 2003. Relevant appraisal data-including organization type, geographic distribution, and appraisal history-are used to describe CMMI adoption and use patterns. This paper also explains some characteristics of the appraisal process and obtained results.","PeriodicalId":173397,"journal":{"name":"Proceedings 27th Annual International Computer Software and Applications Conference. COMPAC 2003","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116601115","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-17DOI: 10.1109/CMPSAC.2003.1245382
Luqi, X. Liang, L. Zhang, V. Berzins
'Manufacturing in the Computer' denotes the virtual manufacturing vision that fabrication/assembly of any product can be simulated in a computer by a powerful modeling and simulation environment. This paper presents the DDM approach, documentation-driven manufacturing to address the problem of engineering such an environment. The key to DDM is the creation and application of the engineering repository (ER) that supports multiple views for modeling and simulating virtual production in the computer and model control of physical production in the factory, respectively. Both virtual view and physical view are heeded for manufacturing under the support of the ER. The ER tangibly documents virtual parts and make them well organized for use by 'iteration-to-maturity' in the computer. It also provides a means for driving the virtual production from one stage to another throughout the manufacturing process, and for converting documents between virtual view and physical view representation to manage and control the physical production.
{"title":"Software documentation-driven manufacturing: viaduct between software engineering and virtual engineering","authors":"Luqi, X. Liang, L. Zhang, V. Berzins","doi":"10.1109/CMPSAC.2003.1245382","DOIUrl":"https://doi.org/10.1109/CMPSAC.2003.1245382","url":null,"abstract":"'Manufacturing in the Computer' denotes the virtual manufacturing vision that fabrication/assembly of any product can be simulated in a computer by a powerful modeling and simulation environment. This paper presents the DDM approach, documentation-driven manufacturing to address the problem of engineering such an environment. The key to DDM is the creation and application of the engineering repository (ER) that supports multiple views for modeling and simulating virtual production in the computer and model control of physical production in the factory, respectively. Both virtual view and physical view are heeded for manufacturing under the support of the ER. The ER tangibly documents virtual parts and make them well organized for use by 'iteration-to-maturity' in the computer. It also provides a means for driving the virtual production from one stage to another throughout the manufacturing process, and for converting documents between virtual view and physical view representation to manage and control the physical production.","PeriodicalId":173397,"journal":{"name":"Proceedings 27th Annual International Computer Software and Applications Conference. COMPAC 2003","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128458991","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-17DOI: 10.1109/CMPSAC.2003.1245318
Sami Beydeda, V. Gruhn
One of the important tasks during software testing is the generation of test cases. Various approaches have been proposed to automate this task. The approaches available, however, often have problems limiting their use. A problem of dynamic test case generation approaches, for instance, is that a large number of iterations can be necessary to obtain test cases. This article proposes a novel algorithm for path-oriented test case generation based on binary search and describes a possible implementation.
{"title":"BINTEST - search-based test case generation","authors":"Sami Beydeda, V. Gruhn","doi":"10.1109/CMPSAC.2003.1245318","DOIUrl":"https://doi.org/10.1109/CMPSAC.2003.1245318","url":null,"abstract":"One of the important tasks during software testing is the generation of test cases. Various approaches have been proposed to automate this task. The approaches available, however, often have problems limiting their use. A problem of dynamic test case generation approaches, for instance, is that a large number of iterations can be necessary to obtain test cases. This article proposes a novel algorithm for path-oriented test case generation based on binary search and describes a possible implementation.","PeriodicalId":173397,"journal":{"name":"Proceedings 27th Annual International Computer Software and Applications Conference. COMPAC 2003","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115006077","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-03DOI: 10.1109/CMPSAC.2003.1245356
Ying Zou, K. Kontogiannis
Over the past years, the reengineering of legacy software systems to object oriented platforms has received significant attention. In this paper, we present a generic re-engineering source code transformation framework to support the incremental migration of such procedural legacy systems to object oriented platforms. First, a source code representation framework that uses a generic domain model for procedural languages allows for the representation of abstract syntax trees as XML documents. Second, a set of transformations allow for the identification of object models in specific parts of the legacy source code. In this way, the migration process is applied incrementally on different parts of the system. A clustering technique is used to decompose a program into a set of smaller components that are suitable for the incremental migration process. Finally, the migration process gradually composes the object models obtained at every stage to generate an amalgamated object model for the whole system. . A case study for the migration of a medium size C system to C++ is discussed as a proof of concept.
{"title":"Incremental transformation of procedural systems to object oriented platforms","authors":"Ying Zou, K. Kontogiannis","doi":"10.1109/CMPSAC.2003.1245356","DOIUrl":"https://doi.org/10.1109/CMPSAC.2003.1245356","url":null,"abstract":"Over the past years, the reengineering of legacy software systems to object oriented platforms has received significant attention. In this paper, we present a generic re-engineering source code transformation framework to support the incremental migration of such procedural legacy systems to object oriented platforms. First, a source code representation framework that uses a generic domain model for procedural languages allows for the representation of abstract syntax trees as XML documents. Second, a set of transformations allow for the identification of object models in specific parts of the legacy source code. In this way, the migration process is applied incrementally on different parts of the system. A clustering technique is used to decompose a program into a set of smaller components that are suitable for the incremental migration process. Finally, the migration process gradually composes the object models obtained at every stage to generate an amalgamated object model for the whole system. . A case study for the migration of a medium size C system to C++ is discussed as a proof of concept.","PeriodicalId":173397,"journal":{"name":"Proceedings 27th Annual International Computer Software and Applications Conference. COMPAC 2003","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116928407","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-03DOI: 10.1109/CMPSAC.2003.1245389
P. Bailes, Colin J. M. Kemp
An inherent incomputability in the specification of a functional language extension that combines assertions with dynamic type checking is isolated in an explicit derivation from mathematical specifications. The combination of types and assertions (into "dynamic assertion-types" - DATs) is a significant issue since, because the two are congruent means for program correctness, benefit arises from their better integration in contrast to the harm resulting from their unnecessary separation. However, projecting the "set membership" view of assertion-checking into dynamic types results in some incomputable combinations. Refinement of the specification of DAT checking into an implementation by rigorous application of mathematical identities becomes feasible through the addition of a "best-approximate" pseudo-equality that isolates the incomputable component of the specification. This formal treatment leads to an improved, more maintainable outcome with further development potential.
{"title":"Integrating runtime assertions with dynamic types: structuring a derivation from an incomputable specification","authors":"P. Bailes, Colin J. M. Kemp","doi":"10.1109/CMPSAC.2003.1245389","DOIUrl":"https://doi.org/10.1109/CMPSAC.2003.1245389","url":null,"abstract":"An inherent incomputability in the specification of a functional language extension that combines assertions with dynamic type checking is isolated in an explicit derivation from mathematical specifications. The combination of types and assertions (into \"dynamic assertion-types\" - DATs) is a significant issue since, because the two are congruent means for program correctness, benefit arises from their better integration in contrast to the harm resulting from their unnecessary separation. However, projecting the \"set membership\" view of assertion-checking into dynamic types results in some incomputable combinations. Refinement of the specification of DAT checking into an implementation by rigorous application of mathematical identities becomes feasible through the addition of a \"best-approximate\" pseudo-equality that isolates the incomputable component of the specification. This formal treatment leads to an improved, more maintainable outcome with further development potential.","PeriodicalId":173397,"journal":{"name":"Proceedings 27th Annual International Computer Software and Applications Conference. COMPAC 2003","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124807858","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-03DOI: 10.1109/CMPSAC.2003.1245326
E. Y. Wong, A. Chan, H. Leong
XML (eXtensible Markup Language) has been developed and deployed by domain-specific standardization bodies and commercial companies. We investigate the possibilities and issues encompassing the use of generalized XML in a wireless computing environment. Current approaches of fragmenting data do not take into account of the semantics and structure of the data, therefore ignoring the specific needs of individual application. We propose a middleware, Xstream (XML Streaming) for augmenting XML contents by leveraging on the rich semantics and structural characteristics of the XML document into autonomous units, which are known as XDU (Xstream Data Unit). In this paper we describe the framework and the techniques involved and study the performance of the techniques.
XML(可扩展标记语言)是由特定于领域的标准化组织和商业公司开发和部署的。我们研究了在无线计算环境中使用通用XML的可能性和问题。目前的数据分片方法没有考虑到数据的语义和结构，因此忽略了单个应用程序的特定需求。我们提出了一种中间件Xstream (XML Streaming)，通过利用XML文档丰富的语义和结构特征，将XML内容扩展为自治单元(称为XDU (Xstream Data Unit))。本文描述了该系统的框架和所涉及的技术，并研究了这些技术的性能。
{"title":"Semantic-based approach to streaming XML contents using Xstream","authors":"E. Y. Wong, A. Chan, H. Leong","doi":"10.1109/CMPSAC.2003.1245326","DOIUrl":"https://doi.org/10.1109/CMPSAC.2003.1245326","url":null,"abstract":"XML (eXtensible Markup Language) has been developed and deployed by domain-specific standardization bodies and commercial companies. We investigate the possibilities and issues encompassing the use of generalized XML in a wireless computing environment. Current approaches of fragmenting data do not take into account of the semantics and structure of the data, therefore ignoring the specific needs of individual application. We propose a middleware, Xstream (XML Streaming) for augmenting XML contents by leveraging on the rich semantics and structural characteristics of the XML document into autonomous units, which are known as XDU (Xstream Data Unit). In this paper we describe the framework and the techniques involved and study the performance of the techniques.","PeriodicalId":173397,"journal":{"name":"Proceedings 27th Annual International Computer Software and Applications Conference. COMPAC 2003","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122374178","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-03DOI: 10.1109/CMPSAC.2003.1245392
P. Maheshwari, I. Gorton, Anna Liu
The first Workshop on Architectures for Complex Application Integration (WACAI 2003) was held in Dallas, Texas on 5 November 2003. This was a joint workshop with COMPSAC 2003. The major aim of the workshop was to bring together key research ideas and practices in the field of evolving architectures for application integration, with the goal of assessing the state of the art and of identifying the fundamental open issues in the research field. Six papers are accepted for formal presentation. In the last section, a summary is outlined for each paper.
{"title":"Workshop on Architectures for Complex Application Integration (WACAI 2003)","authors":"P. Maheshwari, I. Gorton, Anna Liu","doi":"10.1109/CMPSAC.2003.1245392","DOIUrl":"https://doi.org/10.1109/CMPSAC.2003.1245392","url":null,"abstract":"The first Workshop on Architectures for Complex Application Integration (WACAI 2003) was held in Dallas, Texas on 5 November 2003. This was a joint workshop with COMPSAC 2003. The major aim of the workshop was to bring together key research ideas and practices in the field of evolving architectures for application integration, with the goal of assessing the state of the art and of identifying the fundamental open issues in the research field. Six papers are accepted for formal presentation. In the last section, a summary is outlined for each paper.","PeriodicalId":173397,"journal":{"name":"Proceedings 27th Annual International Computer Software and Applications Conference. COMPAC 2003","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122866599","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-03DOI: 10.1109/CMPSAC.2003.1245340
Jianjun Zhao
The current research so far in aspect-oriented software development is focused on problem analysis, software design, and implementation techniques. Even though the importance of software testing is known, it has received little attention in the aspect-oriented paradigm. In this paper, we propose a data-flow-based unit testing approach for aspect oriented programs. Our approach tests two types of units for an aspect-oriented program, i.e., aspects that are modular units of crosscutting implementation of the program, and those classes whose behavior may be affected by one or more aspects. For each aspect or class, our approach performs three levels of testing, i.e., intra-module, inter-module, and intra-aspect or intra-class testing. For an individual module such as apiece of advice, a piece of introduction, and a method, we perform intra-module testing. For a public module along with other modules it calls in an aspect or class, we perform inter-module testing. For modules that can be accessed outside the aspect or class and can be invoked in any order by users of the aspect or class, we perform intra-aspect or intra-class testing. Our approach can handle unit testing problems that are unique to aspect-oriented programs. We use control flow graphs to compute def-use pairs of an aspect or class being tested and use such information to guide the selection of test for the aspect or class.
{"title":"Data-flow-based unit testing of aspect-oriented programs","authors":"Jianjun Zhao","doi":"10.1109/CMPSAC.2003.1245340","DOIUrl":"https://doi.org/10.1109/CMPSAC.2003.1245340","url":null,"abstract":"The current research so far in aspect-oriented software development is focused on problem analysis, software design, and implementation techniques. Even though the importance of software testing is known, it has received little attention in the aspect-oriented paradigm. In this paper, we propose a data-flow-based unit testing approach for aspect oriented programs. Our approach tests two types of units for an aspect-oriented program, i.e., aspects that are modular units of crosscutting implementation of the program, and those classes whose behavior may be affected by one or more aspects. For each aspect or class, our approach performs three levels of testing, i.e., intra-module, inter-module, and intra-aspect or intra-class testing. For an individual module such as apiece of advice, a piece of introduction, and a method, we perform intra-module testing. For a public module along with other modules it calls in an aspect or class, we perform inter-module testing. For modules that can be accessed outside the aspect or class and can be invoked in any order by users of the aspect or class, we perform intra-aspect or intra-class testing. Our approach can handle unit testing problems that are unique to aspect-oriented programs. We use control flow graphs to compute def-use pairs of an aspect or class being tested and use such information to guide the selection of test for the aspect or class.","PeriodicalId":173397,"journal":{"name":"Proceedings 27th Annual International Computer Software and Applications Conference. COMPAC 2003","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129637665","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-03DOI: 10.1109/CMPSAC.2003.1245339
S. Vilkomir, K. Kapoor, Jonathan P. Bowen
Effectiveness of testing criteria is the ability to detect failure in a software program. We consider not only effectiveness of some testing criterion in itself but a variance of effectiveness of different test sets satisfied the same testing criterion. We name this property "tolerance" of a testing criterion and show that, for practical using a criterion, a high tolerance is as well important as high effectiveness. The results of empirical evaluation of tolerance for different criteria, types of faults and decisions are presented. As well as quite simple and well-known control-flow criteria, we study more complicated criteria: full predicate coverage, modified condition/decision coverage and reinforced condition/decision coverage criteria.
{"title":"Tolerance of control-flow testing criteria","authors":"S. Vilkomir, K. Kapoor, Jonathan P. Bowen","doi":"10.1109/CMPSAC.2003.1245339","DOIUrl":"https://doi.org/10.1109/CMPSAC.2003.1245339","url":null,"abstract":"Effectiveness of testing criteria is the ability to detect failure in a software program. We consider not only effectiveness of some testing criterion in itself but a variance of effectiveness of different test sets satisfied the same testing criterion. We name this property \"tolerance\" of a testing criterion and show that, for practical using a criterion, a high tolerance is as well important as high effectiveness. The results of empirical evaluation of tolerance for different criteria, types of faults and decisions are presented. As well as quite simple and well-known control-flow criteria, we study more complicated criteria: full predicate coverage, modified condition/decision coverage and reinforced condition/decision coverage criteria.","PeriodicalId":173397,"journal":{"name":"Proceedings 27th Annual International Computer Software and Applications Conference. COMPAC 2003","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126894311","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-03DOI: 10.1109/CMPSAC.2003.1245383
Masataro Shiroiwa, T. Miura, I. Shioya
In this work, we discuss how to interpret traditional Data Flow Diagram (DFD) by Unified Modeling Language (UML) for the purpose of integrating legacy systems with modern systems. To do that we introduce DFD meta model by using UML class diagrams and Object Constraint Language (OCL). We utilize the meta model to capture DFD semantics and establish close correspondence between DFD expressions and the expressions that can be derived by instantiating the meta framework. At the same time we describe procedures to generate UML descriptions from DFD based on the correspondence.
{"title":"Meta model approach for mediation","authors":"Masataro Shiroiwa, T. Miura, I. Shioya","doi":"10.1109/CMPSAC.2003.1245383","DOIUrl":"https://doi.org/10.1109/CMPSAC.2003.1245383","url":null,"abstract":"In this work, we discuss how to interpret traditional Data Flow Diagram (DFD) by Unified Modeling Language (UML) for the purpose of integrating legacy systems with modern systems. To do that we introduce DFD meta model by using UML class diagrams and Object Constraint Language (OCL). We utilize the meta model to capture DFD semantics and establish close correspondence between DFD expressions and the expressions that can be derived by instantiating the meta framework. At the same time we describe procedures to generate UML descriptions from DFD based on the correspondence.","PeriodicalId":173397,"journal":{"name":"Proceedings 27th Annual International Computer Software and Applications Conference. COMPAC 2003","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123894115","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
扫码关注我们
求助内容：
应助结果提醒方式：