J. Softw. Maintenance Res. Pract.最新文献_第4页

A quantitative framework for software restructuring 软件重构的定量框架

J. Softw. Maintenance Res. Pract. Pub Date : 1999-07-01 DOI: 10.1002/(SICI)1096-908X(199907/08)11:4%3C245::AID-SMR193%3E3.0.CO;2-8

Byung-Kyoo Kang, J. Bieman

引用次数: 47

Recovering software architecture from the names of source files 从源文件的名称中恢复软件架构

J. Softw. Maintenance Res. Pract. Pub Date : 1999-05-01 DOI: 10.1002/(SICI)1096-908X(199905/06)11:3%3C201::AID-SMR192%3E3.0.CO;2-1

N. Anquetil, T. Lethbridge

{"title":"Recovering software architecture from the names of source files","authors":"N. Anquetil, T. Lethbridge","doi":"10.1002/(SICI)1096-908X(199905/06)11:3%3C201::AID-SMR192%3E3.0.CO;2-1","DOIUrl":"https://doi.org/10.1002/(SICI)1096-908X(199905/06)11:3%3C201::AID-SMR192%3E3.0.CO;2-1","url":null,"abstract":"We discuss how to extract a useful set of subsystems from a set of existing source-code file names. This problem is challenging because many legacy systems use thousands of files names, including some that are very short and cryptic. At the same time the problem is important because software maintainers often find it difficult to understand such systems. We propose a general algorithm to cluster files based on their names, and a set of alternative methods for implementing the algorithm. One of the key tasks is picking candidate words to try to identify in file names. We do this by (a) iteratively decomposing file names, (b) finding common substrings, and (c) choosing words in routine names, in an English dictionary or in source-code comments. In addition, we investigate generating abbreviations from the candidate words in order to find matches in file names, as well as how to split file names into components given no word markers. To compare and evaluate our five approaches, we present two experiments. The first compares the ‘concepts’ found in each file name by each method with the results of manually decomposing file names. The second experiment compares automatically generated subsystems with subsystem examples proposed by experts. We conclude that two methods are most effective: extracting concepts using common substrings and extracting those concepts that relate to the names of routines in the files. Copyright © 1999 John Wiley & Sons, Ltd.","PeriodicalId":383619,"journal":{"name":"J. Softw. Maintenance Res. Pract.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133516363","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}

引用次数: 123

Isolating faults in complex COTS-based systems 在基于cots的复杂系统中隔离故障

J. Softw. Maintenance Res. Pract. Pub Date : 1999-05-01 DOI: 10.1002/(SICI)1096-908X(199905/06)11:3%3C183::AID-SMR191%3E3.0.CO;2-U

S. Hissam, D. Carney

引用次数: 19

Dynamic analysis methods for the year 2000 problem 2000年问题的动态分析方法

J. Softw. Maintenance Res. Pract. Pub Date : 1999-05-01 DOI: 10.1002/(SICI)1096-908X(199905/06)11:3%3C167::AID-SMR190%3E3.0.CO;2-N

N. Wilde, R. Justice, Kristin Blackwell, W. E. Wong

{"title":"Dynamic analysis methods for the year 2000 problem","authors":"N. Wilde, R. Justice, Kristin Blackwell, W. E. Wong","doi":"10.1002/(SICI)1096-908X(199905/06)11:3%3C167::AID-SMR190%3E3.0.CO;2-N","DOIUrl":"https://doi.org/10.1002/(SICI)1096-908X(199905/06)11:3%3C167::AID-SMR190%3E3.0.CO;2-N","url":null,"abstract":"Programmers working on the year 2000 problem need to locate and understand date sensitive code, that is, code whose execution depends on date inputs. This paper presents several dynamic analysis methods for addressing this problem. Date sensitive code can be located by running many test cases that are identical except for a change in one date value. An advanced test coverage tool can recover each test's execution count vector giving the number of times that each basic block was executed. Comparison of the vectors reveals the blocks whose execution is affected by the input date values. We present several methods of analysing the execution count data to locate date algorithms. One method identifies subdomains, that is, ranges of dates that are processed similarly. Another method involves graphical or Fourier analysis to identify common programming patterns such as leap-year computations. The last method exploits the 28-year regularity in dates to look for anomalies in processing. The methods are illustrated using Bellcore's ATAC testing tool on five C programs that use some of the date encodings that year 2000 maintainers may need to locate and understand. Copyright © 1999 John Wiley & Sons, Ltd.","PeriodicalId":383619,"journal":{"name":"J. Softw. Maintenance Res. Pract.","volume":"431 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131175865","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}

引用次数: 1

Automated regression testing using DBT and Sleuth 使用DBT和Sleuth进行自动化回归测试

J. Softw. Maintenance Res. Pract. Pub Date : 1999-03-01 DOI: 10.1002/(SICI)1096-908X(199903/04)11:2%3C93::AID-SMR188%3E3.0.CO;2-5

A. Andrews, Ning Zhang

引用次数: 39

Variable-precision reaching definitions analysis 变精度达到定义分析

J. Softw. Maintenance Res. Pract. Pub Date : 1999-03-01 DOI: 10.1002/(SICI)1096-908X(199903/04)11:2%3C117::AID-SMR185%3E3.0.CO;2-P

P. Tonella, G. Antoniol, R. Fiutem, E. Merlo

{"title":"Variable-precision reaching definitions analysis","authors":"P. Tonella, G. Antoniol, R. Fiutem, E. Merlo","doi":"10.1002/(SICI)1096-908X(199903/04)11:2%3C117::AID-SMR185%3E3.0.CO;2-P","DOIUrl":"https://doi.org/10.1002/(SICI)1096-908X(199903/04)11:2%3C117::AID-SMR185%3E3.0.CO;2-P","url":null,"abstract":"Ascertaining the reaching definitions from the source code can give views of the linkages in that source code. These views can aid source code analyses, such as impact analysis and program slicing, and can assist in the reverse engineering and re-engineering of large legacy systems. Maintainers like to do such activities interactively and value fast responses from program analysis tools. Therefore the control of the trade-off between accuracy and efficiency should be given to the maintainer. Since some real world programs, especially in languages like C, make much use of pointers, and efficient points-to analysis should be integrated within the computation of the data dependencies during the process of ascertaining the reaching definitions. \u0000 \u0000 \u0000 \u0000This paper proposes three different approaches to the analysis of the reaching definitions based on different levels of precision, reflecting differences in their sensitivity to the calling context and the control flow. The least precise approach produces an overestimate by an average of 41% of data dependencies compared to the approach with the highest degree of precision. The result for the least precise approach is conservative because all detectable data dependencies are included, and is far faster than the more precise approaches. Runs on a test suite show an almost 2000 to 1 reduction in execution time by the least precise approach compared with the most precise approach. The intermediate approach is more than 30 times faster than the most precise approach, and much more precise than the least precise one (an average of 2% extra dependencies compared to the most precise approach). Therefore, while on medium size systems the intermediate approach could be a good compromise, on large systems the least precise approach becomes extremely valuable, being the only one feasible. Copyright © 1999 John Wiley & Sons, Ltd.","PeriodicalId":383619,"journal":{"name":"J. Softw. Maintenance Res. Pract.","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133060790","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}

引用次数: 7

An evaluation of the cognitive processes of programmers engaged in software debugging 对从事软件调试的程序员的认知过程的评价

J. Softw. Maintenance Res. Pract. Pub Date : 1999-03-01 DOI: 10.1002/(SICI)1096-908X(199903/04)11:2%3C73::AID-SMR187%3E3.0.CO;2-A

J. Hale, S. Sharpe, D. Hale

引用次数: 20

A new algorithm for slicing unstructured programs 一种切片非结构化程序的新算法

J. Softw. Maintenance Res. Pract. Pub Date : 1998-11-01 DOI: 10.1002/(SICI)1096-908X(199811/12)10:6%3C415::AID-SMR180%3E3.0.CO;2-Z

M. Harman, S. Danicic

{"title":"A new algorithm for slicing unstructured programs","authors":"M. Harman, S. Danicic","doi":"10.1002/(SICI)1096-908X(199811/12)10:6%3C415::AID-SMR180%3E3.0.CO;2-Z","DOIUrl":"https://doi.org/10.1002/(SICI)1096-908X(199811/12)10:6%3C415::AID-SMR180%3E3.0.CO;2-Z","url":null,"abstract":"Program slicing is an automatic program abstraction technique whose many applications include software maintenance, re-engineering and comprehension, all of which rely crucially upon the precision of the slicing algorithm used. When slicing is applied to maintenance problems, the programs to be sliced are typically legacy systems, often written in older, 'unstructured' programming styles. For slicing to be a useful tool to the software maintainer it is therefore important to have precise algorithms for slicing unstructured programs.Unfortunately the standard algorithms for slicing structured programs do not extend correctly to the unstructured paradigm, and currently proposed modifications to these standard algorithms produce either unnecessarily large slices or slices which are not true subsets of the original program from which they are constructed.This paper introduces a modification of Agrawal's algorithm for slicing unstructured programs, which overcomes these difficulties. The new algorithm produces thinner slices than any previously published algorithm while respecting both the semantic and syntactic constraints of slicing, (C) 1998 John Wiley & Sons, Ltd.","PeriodicalId":383619,"journal":{"name":"J. Softw. Maintenance Res. Pract.","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116640180","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}

引用次数: 48

Knowledge base clustering for KBS maintenance 知识库聚类的KBS维护

J. Softw. Maintenance Res. Pract. Pub Date : 1998-11-01 DOI: 10.1002/(SICI)1096-908X(199811/12)10:6%3C395::AID-SMR179%3E3.0.CO;2-4

O. Lee, P. Gray

引用次数: 6

Training for software maintenance 软件维护培训

J. Softw. Maintenance Res. Pract. Pub Date : 1998-11-01 DOI: 10.1002/(SICI)1096-908X(199811/12)10:6%3C381::AID-SMR177%3E3.0.CO;2-N

M. Taylor, E. Moynihan, A. Laws

引用次数: 10