The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Reformulating software engineering as a search problem
Open accessAbstract
Metaheuristic techniques such as genetic algorithms, simulated annealing and tabu search have found wide application in most areas of engineering. These techniques have also been applied in business, financial and economic modelling. Metaheuristics have been applied to three areas of software engineering: test data generation, module clustering and cost/effort prediction, yet there remain many software engineering problems which have yet to be tackled using metaheuristics. It is surprising that metaheuristics have not been more widely applied to software engineering; many problems in software engineering are characterised by precisely the features which make metaheuristics search applicable. In the paper it is argued that the features which make metaheuristics applicable for engineering and business applications outside software engineering also suggest that there is great potential for the exploitation of metaheuristics within software engineering. The paper briefly reviews the principal metaheuristic search techniques and surveys existing work on the application of metaheuristics to the three software engineering areas of test data generation, module clustering and cost/effort prediction. It also shows how metaheuristic search techniques can be applied to three additional areas of software engineering: maintenance/evolution system integration and requirements scheduling. The software engineering problem areas considered thus span the range of the software development process, from initial planning, cost estimation and requirements analysis through to integration, maintenance and evolution of legacy systems. The aim is to justify the claim that many problems in software engineering can be reformulated as search problems, to which metaheuristic techniques can be applied. The goal of the paper is to stimulate greater interest in metaheuristic search as a tool of optimisation of software engineering problems and to encourage the investigation and exploitation of these technologies in finding near optimal solutions to the complex constraint-based scenarios which arise so frequently in software engineering.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
(1979) · Cited by 43,841
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Genetic Programming: On the Programming of Computers by Means of Natural Selection
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 13,082
An Introduction to Genetic Algorithms
Mitchell, M. (1996) · doi:10.7551/mitpress/3927.001.0001 · Cited by 11,340
Compilers: Principles, Techniques, and Tools
Aho, A. V., Sethi, R., & Ullman, J. D. (1986) · Cited by 8,448
Bäck, T. (1996) · Oxford University Press eBooks · doi:10.1093/oso/9780195099713.001.0001 · Cited by 5,113
Software architecture: perspectives on an emerging discipline
Shaw, M., & Garlan, D. (1996) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,910
Multiple Criteria Decision Analysis: An Integrated Approach
Belton, V., & Stewart, T. J. (2001) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,724
Modern heuristic techniques for combinatorial problems
Reeves, C. R. (1993) · Medical Entomology and Zoology · Cited by 2,580
Simulated Annealing: Theory and Applications
van Laarhoven, P. J. M., & Aarts, E. H. L. (1987) · Springer eBooks · doi:10.1007/978-94-015-7744-1 · Cited by 2,385
Genetic Algorithms in Search, Optimization & Machine Learning
Goldberg, D. E. (1989) · Medical Entomology and Zoology · Cited by 2,304
A Transformation System for Developing Recursive Programs
Burstall, R. M., & Darlington, J. (1977) · Journal of the ACM · doi:10.1145/321992.321996 · Cited by 1,300
Glover, F. (1990) · Interfaces · doi:10.1287/inte.20.4.74 · Cited by 1,092
Software Metrics. A Rigorous Approach
(1991) · Journal of Information Technology · doi:10.1177/0268396291006003-421 · Cited by 843
A cost-value approach for prioritizing requirements
Karlsson, J., & Ryan, K. (1997) · IEEE Software · doi:10.1109/52.605933 · Cited by 726
Test-data generation using genetic algorithms
Pargas, R. P., Harrold, M. J., & Peck, R. R. (1999) · Software Testing, Verification and Reliability · doi:10.1002/(sici)1099-1689(199912)9:4<263::aid-stvr190>3.0.co;2-y · Cited by 582
Evolutionary test environment for automatic structural testing
Wegener, J., Baresel, A., & Sthamer, H. (2001) · Information and Software Technology · doi:10.1016/s0950-5849(01)00190-2 · Cited by 519
The Theory and Practice of Simulated Annealing
Henderson, D., Jacobson, S. H., & Johnson, A. W. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_10 · Cited by 514
Genetic Algorithms in Engineering and Computer Science
Winter, G., Périaux, J., Galan, M., et al. (1996) · Cited by 495
A reverse‐engineering approach to subsystem structure identification
Müller, H. A., Orgun, M. A., Tilley, S. R., & Uhl, J. S. (1993) · Journal of Software Maintenance: Research and Practice · doi:10.1002/smr.4360050402 · Cited by 353
Can genetic programming improve software effort estimation? A comparative evaluation
Burgess, C. J., & Lefley, M. (2001) · Information and Software Technology · doi:10.1016/s0950-5849(01)00192-6 · Cited by 300
Sait, S. M., & Youssef, H. (2000) · Medical Entomology and Zoology · Cited by 279
System Structure Analysis: Clustering with Data Bindings
Hutchens, D. H., & Basili, V. R. (1985) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1985.232524 · Cited by 265
Identifying objects using cluster and concept analysis
van Deursen, A., & Kuipers, T. (1999) · Proceedings of the 21st international conference on Software engineering · doi:10.1145/302405.302629 · Cited by 236
Assessing modular structure of legacy code based on mathematical concept analysis
Lindig, C., & Snelting, G. (1997) · Proceedings of the 19th international conference on Software engineering - ICSE '97 · doi:10.1145/253228.253354 · Cited by 213
Automated program flaw finding using simulated annealing
Tracey, N., Clark, J., & Mander, K. (1998) · Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis · doi:10.1145/271771.271792 · Cited by 204
On the problem of the software cost function
Dolado, J. J. (2001) · Information and Software Technology · doi:10.1016/s0950-5849(00)00137-3 · Cited by 185
Self-citationA validation of the component-based method for software size estimation
Dolado, J. J. (2000) · IEEE Transactions on Software Engineering · doi:10.1109/32.879821 · Cited by 166
Self-citationAn intelligent tool for re-engineering software modularity
Schwanke, R. W. (2002) · [1991 Proceedings] 13th International Conference on Software Engineering · doi:10.1109/icse.1991.130626 · Cited by 163
A heuristic approach to solving the software clustering problem
Mitchell, B. S. (2004) · International Conference on Software Maintenance · doi:10.1109/icsm.2003.1235432 · Cited by 146
Self-citationWile, D. S. (1983) · Communications of the ACM · doi:10.1145/182.358443 · Cited by 128
A Strategy for using Genetic Algorithms to Automate Branch and Fault-based Testing
Jones, B. F. (1998) · The Computer Journal · doi:10.1093/comjnl/41.2.98 · Cited by 112
Self-citationThe Maintainer's Assistant (software tool)
Ward, W., Calliss, F. W., & Munro, M. (2003) · IEEE International Conference on Software Maintenance (ICSM) · doi:10.1109/icsm.1989.65225 · Cited by 56
Cited by
Search‐based software test data generation: a survey
McMinn, P. (2004) · Software Testing, Verification and Reliability · doi:10.1002/stvr.294 · Cited by 1,368
Search-based software engineering: Trends, techniques and applications
Harman, M., Mansouri, S. A., & Zhang, Y. (2012) · ACM Computing Surveys · doi:10.1145/2379776.2379787 · Cited by 777
Self-citationThe Current State and Future of Search Based Software Engineering
Harman, M. (2007) · Future of Software Engineering (FOSE '07) · doi:10.1109/fose.2007.29 · Cited by 631
Self-citationOn the automatic modularization of software systems using the Bunch tool
Mitchell, B. S., & Mancoridis, S. (2006) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2006.31 · Cited by 479
Self-citationAli, S., Briand, L. C., Hemmati, H., & Panesar-Walawege, R. K. (2010) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2009.52 · Cited by 452
Metadata
- Authors
- Clarke, J., Dolado, J. J., Harman, M., Hierons, R., Jones, B., Lumkin, M., Mitchell, B., Mancoridis, S., Rees, K., Roper, M., & Shepperd, M.
- Venue
- IEE Proceedings - Software
- Published
- 2003
- Volume
- 150
- Issue
- 3
- Pages
- 161
- ISSN
- 1462-5970 (ISSN-L)
- OpenAlex
- W2056820901
- Cited by
- 286
- References
- 35
- FWCI
- 28.20
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.