Lucas Bang, Abdulbaki Aydin, Tevfik Bultan. Automatically computing path complexity of programs. In Elisabetta Di Nitto, Mark Harman, Patrick Heymans, editors, Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering, ESEC/FSE 2015, Bergamo, Italy, August 30 - September 4, 2015. pages 61-72, ACM, 2015. [doi]
@inproceedings{BangAB15,
title = {Automatically computing path complexity of programs},
author = {Lucas Bang and Abdulbaki Aydin and Tevfik Bultan},
year = {2015},
doi = {10.1145/2786805.2786863},
url = {http://doi.acm.org/10.1145/2786805.2786863},
researchr = {https://researchr.org/publication/BangAB15},
cites = {0},
citedby = {0},
pages = {61-72},
booktitle = {Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering, ESEC/FSE 2015, Bergamo, Italy, August 30 - September 4, 2015},
editor = {Elisabetta Di Nitto and Mark Harman and Patrick Heymans},
publisher = {ACM},
isbn = {978-1-4503-3675-8},
}