Recovering fitness gradients for interprocedural Boolean flags in search-based testing
In Search-based Software Testing (SBST), test generation is guided by fitness functions that estimate how close a test case is to reach an uncovered test goal (e.g., branch). A popular fitness function estimates how close conditional statements are to evaluating to true or false, i.e., the branch di...
Saved in:
Main Authors: | LIN, Yun, SUN, Jun, FRASER, Gordon, XIU, Ziheng, LIU, Ting, DONG, Jin Song |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2020
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/5960 https://ink.library.smu.edu.sg/context/sis_research/article/6963/viewcontent/issta20.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Graph-based seed object synthesis for search-based unit testing
by: LIN, Yun, et al.
Published: (2021) -
An investigation on evolutionary gradient search for multi-objective optimization
by: Goh, C.K., et al.
Published: (2014) -
CodeHow: Effective Code Search Based on API Understanding and Extended Boolean Model (E)
by: LV, Fei, et al.
Published: (2015) -
Interprocedural placement-aware configuration prefetching for FPGA-based systems
by: Sim, J.E., et al.
Published: (2013) -
Web search
by: J. Mackenzie Owen, Amanda Spink, Michael Zimmer.
Published: (2017)