Eliyan, L., & Alshraideh, M. (2026). Boundary-Driven Path Diversity Heuristics for Improving Coverage of Difficult-to-Reach Program Paths in Search-Based Software Testing. IEEE Access, Access, IEEE, 14, 31086-31111. https://doi.org/10.1109/ACCESS.2026.3666095
Παραπομπή σε μορφή Chicago (17η εκδ.)Eliyan, L.F, και M.A Alshraideh. "Boundary-Driven Path Diversity Heuristics for Improving Coverage of Difficult-to-Reach Program Paths in Search-Based Software Testing." IEEE Access, Access, IEEE 14 (2026): 31086-31111. https://doi.org/10.1109/ACCESS.2026.3666095.
Παραπομπή σε μορφή MLA (9th εκδ.)Eliyan, L.F, και M.A Alshraideh. "Boundary-Driven Path Diversity Heuristics for Improving Coverage of Difficult-to-Reach Program Paths in Search-Based Software Testing." IEEE Access, Access, IEEE, vol. 14, 2026, pp. 31086-31111, https://doi.org/10.1109/ACCESS.2026.3666095.