Embargo
The post-print (if available) will be made available to the public after 05/24/2019.
Department
Computer Science
Rights
Published articles are subject to copyright, contact the publisher or reprint author for further use of this material. Post-prints will be made available for public use after a 48 month embargo.
Citation
Lin, C.T., Tang, K.W., Wang, J.S., and Kapfhammer, G.M. (2017). Empirically evaluating Greedy-based test suite reduction methods at different levels of test suite complexity. Science of Computer Programming 150(1): 1-25. doi: 10.1016/j.scico.2017.05.004
Version
Published article
Published As
https://doi.org/10.1016/j.scico.2017.05.004
Journal
Science of Computer Programming
Publisher
Elsevier