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) -
CodeHow: Effective Code Search Based on API Understanding and Extended Boolean Model (E)
by: LV, Fei, et al.
Published: (2015) -
Viz: A visual analysis suite for explaining local search behavior
by: Halim, S., et al.
Published: (2013) -
KAPE: kNN-based performance testing for deep code search
by: GUO, Yuejun, et al.
Published: (2023) -
A Comparison Study of Adjoint-Based Gradient Search Technique and Mathematical Programming for Optimal Well-Placement
by: Toh, R.Y., et al.
Published: (2014)