Search-based software engineering: Difference between revisions

Revision as of 08:33, 22 July 2020

Revision as of 03:28, 13 September 2020

Line 74:

| issue = 3

| pages = 223–226

| lastlast1 = Miller

| firstfirst1 = Webb

| last2 = Spooner

| first2 = David L.

Line 81:

| journal = IEEE Transactions on Software Engineering

| year = 1976

| s2cid = 18875300

}}</ref> In 1992, S. Xanthakis and his colleagues applied a search technique to a [[software engineering]] problem for the first time.<ref>S. Xanthakis, C. Ellis, C. Skourlas, A. Le Gall, S. Katsikas and K. Karapoulios, "Application of genetic algorithms to software testing," in ''Proceedings of the 5th International Conference on Software Engineering and its Applications'', Toulouse, France, 1992, pp.&nbsp;625–636</ref> The term SBSE was first used in 2001 by [[Mark Harman (computer scientist)|Harman]] and Jones.<ref>

{{Cite journal

Line 88 ⟶ 89:

| issue = 14

| pages = 833–839

| lastlast1 = Harman

| firstfirst1 = Mark

| last2 = Jones

| first2 = Bryan F.

Line 96 ⟶ 97:

| date = 2001-12-15

| citeseerx = 10.1.1.143.9716

}}</ref> The research community grew to include more than 800 authors by 2013, spanning approximately 270 institutions in 40 countries.<ref>{{Cite journal|lastlast1=Harman|firstfirst1=Mark|last2=Mansouri|first2=S. Afshin|last3=Zhang|first3=Yuanyuan|date=2012-11-01|title=Search-based software engineering: Trends, techniques and applications|journal=ACM Computing Surveys|language=en|volume=45|issue=1|pages=1–61|doi=10.1145/2379776.2379787|s2cid=207198163|url=http://bura.brunel.ac.uk/handle/2438/8811}}</ref>

==Application areas==

Line 120 ⟶ 121:

| issue = 4

| pages = 243–253

| lastlast1 = Greer

| firstfirst1 = Des

| last2 = Ruhe

| first2 = Guenther

Line 132 ⟶ 133:

| conference = XXIII Brazilian Symposium on Software Engineering, 2009. SBES '09

| pages = 207–215

| lastlast1 = Colares

| firstfirst1 = Felipe

| last2 = Souza

| first2 = Jerffeson

Line 152 ⟶ 153:

| issue = 14

| pages = 891–904

| lastlast1 = Clark

| firstfirst1 = John A.

| last2 = Jacob

| first2 = Jeremy L.

Line 160 ⟶ 161:

| date = 2001-12-15

| citeseerx = 10.1.1.102.6016

}}</ref><ref>{{Cite journal|last=Räihä|first=Outi|date=2010-11-01|title=A survey on search-based software design|journal=Computer Science Review|volume=4|issue=4|pages=203–249|doi=10.1016/j.cosrev.2010.06.001|issn=1574-0137|url=https://trepo.tuni.fi/bitstream/10024/65330/1/D-2009-1.pdf}}</ref> [[Code refactoring|refactoring]],<ref>{{Cite journal|lastlast1=Mariani|firstfirst1=Thainá|last2=Vergilio|first2=Silvia Regina|date=2017-03-01|title=A systematic review on search-based refactoring|journal=Information and Software Technology|volume=83|pages=14–34|doi=10.1016/j.infsof.2016.11.009|issn=0950-5849}}</ref> [[software development|development]],<ref>

{{Cite journal

| doi = 10.1016/j.ins.2006.12.020

Line 167 ⟶ 168:

| issue = 11

| pages = 2380–2401

| lastlast1 = Alba

| firstfirst1 = Enrique

| last2 = Chicano

| first2 = J. Francisco

Line 181 ⟶ 182:

| conference = Proceedings of the 21st IEEE International Conference on Software Maintenance, 2005. ICSM'05

| pages = 240–249

| lastlast1 = Antoniol

| firstfirst1 = Giuliano

| last2 = Di Penta

| first2 = Massimiliano

Line 207 ⟶ 208:

Y.&nbsp;Zhang and M.&nbsp;Harman and S.&nbsp;L.&nbsp;Lim, "[http://www.cs.ucl.ac.uk/fileadmin/UCL-CS/images/Research_Student_Information/RN_11_12.pdf Search Based Optimization of Requirements Interaction Management]," Department of Computer Science, University College London, Research Note RN/11/12, 2011.

</ref>

<ref>{{cite book|last1=Li|first1=Lingbo|last2=Harman|first2=Mark|last3=Letier|first3=Emmanuel|last4=Zhang|first4=Yuanyuan|title=Robust Next Release Problem: Handling Uncertainty During Optimization|journal=Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation|date=2014|pages=1247–1254|doi=10.1145/2576768.2598334|isbn=9781450326629|series=Gecco '14|s2cid=8423690}}</ref><ref>{{cite journal|last1=Li|first1=L.|last2=Harman|first2=M.|last3=Wu|first3=F.|last4=Zhang|first4=Y.|title=The Value of Exact Analysis in Requirements Selection|journal=IEEE Transactions on Software Engineering|date=2017|volume=43|issue=6|pages=580–596|doi=10.1109/TSE.2016.2615100|s2cid=8398275|issn=0098-5589|url=https://discovery.ucl.ac.uk/id/eprint/1554255/1/Harman_07582553.pdf}}</ref>

===Debugging and maintenance===

Line 216 ⟶ 217:

| conference = 2012 34th International Conference on Software Engineering (ICSE)

| pages = 3–13

| lastlast1 = Le Goues

| firstfirst1 = Claire

| last2 = Dewey-Vogt

| first2 = Michael

Line 233 ⟶ 234:

| conference = IEEE Congress on Evolutionary Computation, 2008. CEC 2008. (IEEE World Congress on Computational Intelligence)

| pages = 162–168

| lastlast1 = Arcuri

| firstfirst1 = Andrea

| last2 = Yao

| first2 = Xin

Line 243 ⟶ 244:

===Testing===

Search-based software engineering has been applied to software testing, including automatic generation of test cases (test data), test case minimization and test case prioritization.<ref>{{Cite journal|lastlast1=Harman|firstfirst1=Mark|last2=Jia|first2=Yue|last3=Zhang|first3=Yuanyuan|date=April 2015|title=Achievements, Open Problems and Challenges for Search Based Software Testing|journal=2015 IEEE 8th International Conference on Software Testing, Verification and Validation (ICST)|___location=Graz, Austria|publisher=IEEE|pages=1–12|doi=10.1109/ICST.2015.7102580|citeseerx=10.1.1.686.7418|isbn=978-1-4799-7125-1|s2cid=15272060}}</ref> [[Regression testing]] has also received some attention.

===Optimizing software===

The use of SBSE in [[program optimization]], or modifying a piece of software to make it more efficient in terms of speed and resource use, has been the object of successful research.<ref>{{cite journal |last1=Memeti |first1=Suejb |last2=Pllana |first2=Sabri |last3=Binotto |first3=Alecio |last4=Kolodziej |first4=Joanna |last5=Brandic |first5=Ivona |author5-link= Ivona Brandić |title=Using meta-heuristics and machine learning for software optimization of parallel computing systems: a systematic literature review |journal=Computing |volume=101 |issue=8 |date=2018 |pages=893–936 |doi=10.1007/s00607-018-0614-9 |arxiv=1801.09444 |bibcode=2018arXiv180109444M |s2cid=13868111 }}</ref> In one instance, a 50,000 line program was genetically improved, resulting in a program 70 times faster on average.<ref>

{{Cite journal

| lastlast1 = Langdon

| firstfirst1 = William B.

| last2 = Harman

| first2 = Mark

Line 265 ⟶ 266:

| isbn = 978-1-4503-1177-9

| pages = 1221–1228

| lastlast1 = Minku

| firstfirst1 = Leandro L.

| last2 = Sudholt

| first2 = Dirk

Line 322 ⟶ 323:

| issue = 3

| pages = 421–443

| lastlast1 = Le Goues

| firstfirst1 = Claire

| last2 = Forrest

| first2 = Stephanie

Line 332 ⟶ 333:

| date = 2013-09-01

| citeseerx = 10.1.1.371.5784

| s2cid = 16435531

}}

</ref>