Pub Date : 1993-09-01DOI: 10.1109/ICSM.1993.366946
H. Edwards, M. Munro
The reverse engineering into CASE technology method (RECAST) takes the source code for an existing COBOL system and derives a no-loss representation of the system documented in a structured systems analysis and design method (SSADM) format. One key element of the method is the abstraction of logical processing that affects the individual entities of the system. For each entity this processing is extracted from the physical implementation of the system using a program slicing technique and is then transformed into a logical representation (as an entity life history) using a set of translation and transformation rules. How the abstraction is achieved is described, and an example derived from an existing operational system that has been used as a case study for the method is given.<>
{"title":"Abstracting the logical processing life cycle for entities using the RECAST method","authors":"H. Edwards, M. Munro","doi":"10.1109/ICSM.1993.366946","DOIUrl":"https://doi.org/10.1109/ICSM.1993.366946","url":null,"abstract":"The reverse engineering into CASE technology method (RECAST) takes the source code for an existing COBOL system and derives a no-loss representation of the system documented in a structured systems analysis and design method (SSADM) format. One key element of the method is the abstraction of logical processing that affects the individual entities of the system. For each entity this processing is extracted from the physical implementation of the system using a program slicing technique and is then transformed into a logical representation (as an entity life history) using a set of translation and transformation rules. How the abstraction is achieved is described, and an example derived from an existing operational system that has been used as a case study for the method is given.<<ETX>>","PeriodicalId":228379,"journal":{"name":"1993 Conference on Software Maintenance","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123326510","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 : 1993-09-01DOI: 10.1109/ICSM.1993.366961
T. Biggerstaff
Development environments are entering a period of dramatic change. A major component of this change is a reorientation toward domain driven environments including an integration of domain-oriented support tools. This reorientation will bring about a decline in the role of conventional programming languages and at the same time force an evolution toward more abstract programming representations more abstract in the sense that most of the implementation details (as they are currently known) will be abstracted away. Thus, development is moving farther away from conventional software engineering models and closer to the problem.<>
{"title":"Directions in software development and maintenance","authors":"T. Biggerstaff","doi":"10.1109/ICSM.1993.366961","DOIUrl":"https://doi.org/10.1109/ICSM.1993.366961","url":null,"abstract":"Development environments are entering a period of dramatic change. A major component of this change is a reorientation toward domain driven environments including an integration of domain-oriented support tools. This reorientation will bring about a decline in the role of conventional programming languages and at the same time force an evolution toward more abstract programming representations more abstract in the sense that most of the implementation details (as they are currently known) will be abstracted away. Thus, development is moving farther away from conventional software engineering models and closer to the problem.<<ETX>>","PeriodicalId":228379,"journal":{"name":"1993 Conference on Software Maintenance","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114893506","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 : 1993-09-01DOI: 10.1109/ICSM.1993.366924
Mariam Kamkar, P. Fritzson, N. Shahmehri
During the past ten years several variants of an analysis technique called program slicing have been developed. Program slicing has applications in maintenance tasks such as debugging, testing, program integration, program verification, etc. and can be characterized as a type of dependence analysis. A program slice can loosely be defined as the subset of a program needed to compute a certain variable value at a certain program position. A novel method for interprocedural dynamic slicing which is more precise than interprocedural static slicing methods and is useful for dependence analysis at the procedural abstraction level was given by M. Kamkar et al. (1992, 1993). It is demonstrated here how interprocedural dynamic slicing can be used to increase the reliability and precision of interprocedural data flow testing. The work on data flow testing reported by E. Duesterwald et al. (1992), which is a novel method for data flow testing through output influences, is generalized.<>
{"title":"Interprocedural dynamic slicing applied to interprocedural data flow testing","authors":"Mariam Kamkar, P. Fritzson, N. Shahmehri","doi":"10.1109/ICSM.1993.366924","DOIUrl":"https://doi.org/10.1109/ICSM.1993.366924","url":null,"abstract":"During the past ten years several variants of an analysis technique called program slicing have been developed. Program slicing has applications in maintenance tasks such as debugging, testing, program integration, program verification, etc. and can be characterized as a type of dependence analysis. A program slice can loosely be defined as the subset of a program needed to compute a certain variable value at a certain program position. A novel method for interprocedural dynamic slicing which is more precise than interprocedural static slicing methods and is useful for dependence analysis at the procedural abstraction level was given by M. Kamkar et al. (1992, 1993). It is demonstrated here how interprocedural dynamic slicing can be used to increase the reliability and precision of interprocedural data flow testing. The work on data flow testing reported by E. Duesterwald et al. (1992), which is a novel method for data flow testing through output influences, is generalized.<<ETX>>","PeriodicalId":228379,"journal":{"name":"1993 Conference on Software Maintenance","volume":"193 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116898301","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 : 1993-09-01DOI: 10.1109/ICSM.1993.366934
Joseph P. Loyall, Susan A. Mathisen
Dependence analysis is useful for software maintenance because it indicates the possible effects of a software modification on the rest of a program. This helps the software maintainer evaluate the appropriateness of a software modification, drive regression testing, and determine the vulnerability of critical sections of code. A definition of interprocedural dependence analysis is given, and its implementation in a prototype tool that supports software maintenance is described.<>
{"title":"Using dependence analysis to support the software maintenance process","authors":"Joseph P. Loyall, Susan A. Mathisen","doi":"10.1109/ICSM.1993.366934","DOIUrl":"https://doi.org/10.1109/ICSM.1993.366934","url":null,"abstract":"Dependence analysis is useful for software maintenance because it indicates the possible effects of a software modification on the rest of a program. This helps the software maintainer evaluate the appropriateness of a software modification, drive regression testing, and determine the vulnerability of critical sections of code. A definition of interprocedural dependence analysis is given, and its implementation in a prototype tool that supports software maintenance is described.<<ETX>>","PeriodicalId":228379,"journal":{"name":"1993 Conference on Software Maintenance","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127121743","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 : 1993-09-01DOI: 10.1109/ICSM.1993.366948
S. Tilley, H. Müller, Michael J. Whitney, Kenny Wong
A user programmable approach to reverse engineering is described. The approach uses a scripting language that enables users to write their own routines for these activities, making the system domain-retargetable. The environment supported by this programmable approach subsumes existing reverse engineering systems by being able to simulate facets of each one and provides a smooth transition from semi-automatic to automatic reverse engineering.<>
{"title":"Domain-retargetable reverse engineering","authors":"S. Tilley, H. Müller, Michael J. Whitney, Kenny Wong","doi":"10.1109/ICSM.1993.366948","DOIUrl":"https://doi.org/10.1109/ICSM.1993.366948","url":null,"abstract":"A user programmable approach to reverse engineering is described. The approach uses a scripting language that enables users to write their own routines for these activities, making the system domain-retargetable. The environment supported by this programmable approach subsumes existing reverse engineering systems by being able to simulate facets of each one and provides a smooth transition from semi-automatic to automatic reverse engineering.<<ETX>>","PeriodicalId":228379,"journal":{"name":"1993 Conference on Software Maintenance","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131852284","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 : 1993-09-01DOI: 10.1109/ICSM.1993.366943
Norio Kurishima, H. Oikawa, Jun-ichi Nakamura, Kazuo Amari, M. Fujioka
The results from applying the NHPP (non-homogeneous Poisson process) reliability growth model, for estimation of residual errors, to the online processing software which was developed for provision of new telecommunications services are presented. It is disclosed that the NHPP model can very well be applied to the real online processing telecommunications software not only in the testing phase but also in the operation phase. How the modeling method can be used in the life-cycle of software development, including design, development, and maintenance phases, is also discussed.<>
{"title":"Quantitative analysis of errors in telecommunications software","authors":"Norio Kurishima, H. Oikawa, Jun-ichi Nakamura, Kazuo Amari, M. Fujioka","doi":"10.1109/ICSM.1993.366943","DOIUrl":"https://doi.org/10.1109/ICSM.1993.366943","url":null,"abstract":"The results from applying the NHPP (non-homogeneous Poisson process) reliability growth model, for estimation of residual errors, to the online processing software which was developed for provision of new telecommunications services are presented. It is disclosed that the NHPP model can very well be applied to the real online processing telecommunications software not only in the testing phase but also in the operation phase. How the modeling method can be used in the life-cycle of software development, including design, development, and maintenance phases, is also discussed.<<ETX>>","PeriodicalId":228379,"journal":{"name":"1993 Conference on Software Maintenance","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132301616","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 : 1993-09-01DOI: 10.1109/ICSM.1993.366926
G. Rothermel, M. J. Harrold
Regression testing is a necessary but costly maintenance activity aimed at demonstrating that code has not been adversely affected by changes. A selective approach to regression testing selects tests for a modified program from an existing test suite. A new technique for selective regression testing is presented. The proposed algorithm constructs control dependence graphs for program versions and uses these graphs to determine which tests from the existing test suite may exhibit changed behavior on the new version. Unlike most previous techniques for selective retest, the algorithm selects every test from the original test suite that might expose errors in the modified program, and does this without prior knowledge of program modifications. The algorithm handles all language constructs and program modifications and is easily automated.<>
{"title":"A safe, efficient algorithm for regression test selection","authors":"G. Rothermel, M. J. Harrold","doi":"10.1109/ICSM.1993.366926","DOIUrl":"https://doi.org/10.1109/ICSM.1993.366926","url":null,"abstract":"Regression testing is a necessary but costly maintenance activity aimed at demonstrating that code has not been adversely affected by changes. A selective approach to regression testing selects tests for a modified program from an existing test suite. A new technique for selective regression testing is presented. The proposed algorithm constructs control dependence graphs for program versions and uses these graphs to determine which tests from the existing test suite may exhibit changed behavior on the new version. Unlike most previous techniques for selective retest, the algorithm selects every test from the original test suite that might expose errors in the modified program, and does this without prior knowledge of program modifications. The algorithm handles all language constructs and program modifications and is easily automated.<<ETX>>","PeriodicalId":228379,"journal":{"name":"1993 Conference on Software Maintenance","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130577028","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 : 1993-09-01DOI: 10.1109/ICSM.1993.366957
W. Chu
A reengineering approach to program translation that helps to improve the quality of translated code is described. A detailed discussion of the major components of this approach is presented. The benefits of applying reengineering technologies to existing software systems are mainly from cost savings on reuse and maintenance. For example, reusing existing C codes in new Ada systems with minimal reimplementation or porting effort yields substantial cost savings. Applying reengineering tools to convert languages to Ada automatically has been beneficial. In addition, manually managing and analyzing a software system is very difficult due to the high complexity and large scale of software systems. The reengineering tool reduces the time spent on the labor-intensive task of code searching because it automatically identifies the software components and their dependency relationships. It then enforces good software engineering practices such as information hiding, localization, and abstraction in the new representation.<>
{"title":"A re-engineering approach to program translation","authors":"W. Chu","doi":"10.1109/ICSM.1993.366957","DOIUrl":"https://doi.org/10.1109/ICSM.1993.366957","url":null,"abstract":"A reengineering approach to program translation that helps to improve the quality of translated code is described. A detailed discussion of the major components of this approach is presented. The benefits of applying reengineering technologies to existing software systems are mainly from cost savings on reuse and maintenance. For example, reusing existing C codes in new Ada systems with minimal reimplementation or porting effort yields substantial cost savings. Applying reengineering tools to convert languages to Ada automatically has been beneficial. In addition, manually managing and analyzing a software system is very difficult due to the high complexity and large scale of software systems. The reengineering tool reduces the time spent on the labor-intensive task of code searching because it automatically identifies the software components and their dependency relationships. It then enforces good software engineering practices such as information hiding, localization, and abstraction in the new representation.<<ETX>>","PeriodicalId":228379,"journal":{"name":"1993 Conference on Software Maintenance","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121700582","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 : 1993-09-01DOI: 10.1109/ICSM.1993.366936
Anir Chowdhury, S. Meyers
CCEL, a language that allows programmers to formally express constraints on their software systems and to automatically detect violations of these constraints, is introduced. The power, flexibility, and overall utility of CCEL are demonstrated by examples showing how it can express real constraints from real software developers for real systems.<>
{"title":"Facilitating software maintenance by automated detection of constraint violations","authors":"Anir Chowdhury, S. Meyers","doi":"10.1109/ICSM.1993.366936","DOIUrl":"https://doi.org/10.1109/ICSM.1993.366936","url":null,"abstract":"CCEL, a language that allows programmers to formally express constraints on their software systems and to automatically detect violations of these constraints, is introduced. The power, flexibility, and overall utility of CCEL are demonstrated by examples showing how it can express real constraints from real software developers for real systems.<<ETX>>","PeriodicalId":228379,"journal":{"name":"1993 Conference on Software Maintenance","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127962918","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 : 1993-09-01DOI: 10.1109/ICSM.1993.366935
J. Newton, K. Bennett
A novel method is described for perfective maintenance of software which has been developed from specifications using formal transformations. The list of applied transformations provides a suitable derivation history to use when changes are made to the software. A comparison is made between sequential transformations and standard proof-based refinement techniques for providing this derivation history, based upon the case study of a library system. When using criteria such as scaleability, speed, ease, design improvements and software quality, transformations are a more favorable basis of refinement. The method produces software which is well structured and highly maintainable.<>
{"title":"Designing systems for future maintainability: A case study","authors":"J. Newton, K. Bennett","doi":"10.1109/ICSM.1993.366935","DOIUrl":"https://doi.org/10.1109/ICSM.1993.366935","url":null,"abstract":"A novel method is described for perfective maintenance of software which has been developed from specifications using formal transformations. The list of applied transformations provides a suitable derivation history to use when changes are made to the software. A comparison is made between sequential transformations and standard proof-based refinement techniques for providing this derivation history, based upon the case study of a library system. When using criteria such as scaleability, speed, ease, design improvements and software quality, transformations are a more favorable basis of refinement. The method produces software which is well structured and highly maintainable.<<ETX>>","PeriodicalId":228379,"journal":{"name":"1993 Conference on Software Maintenance","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131051440","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
扫码关注我们
求助内容：
应助结果提醒方式：