External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Automatically computing path complexity of programs

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]

Authors

Lucas Bang

This author has not been identified. Look up 'Lucas Bang' in Google

Abdulbaki Aydin

This author has not been identified. Look up 'Abdulbaki Aydin' in Google

Tevfik Bultan

This author has not been identified. Look up 'Tevfik Bultan' in Google
runs on