Jaffar, J.Murali, V.Navas, J.A.COMPUTER SCIENCE2014-07-042014-07-042013Jaffar, J.,Murali, V.,Navas, J.A. (2013). Boosting concolic testing via interpolation. 2013 9th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, ESEC/FSE 2013 - Proceedings : 48-58. ScholarBank@NUS Repository. <a href="https://doi.org/10.1145/2491411.2491425" target="_blank">https://doi.org/10.1145/2491411.2491425</a>9781450322379https://scholarbank.nus.edu.sg/handle/10635/78046Concolic testing has been very successful in automatically generating test inputs for programs. However one of its major limitations is path-explosion that limits the generation of high coverage inputs. Since its inception several ideas have been proposed to attack this problem from various angles: defining search heuristics that increase coverage, caching of function summaries, pruning of paths using static/dynamic information etc. We propose a new and complementary method based on interpolation, that greatly mitigates pathexplosion by subsuming paths that can be guaranteed to not hit a bug. We discuss new challenges in using interpolation that arise specifically in the context of concolic testing. We experimentally evaluate our method with different search heuristics using Crest, a publicly available concolic tester. Copyright 2013 ACM.Concolic testingInterpolationSymbolic executionConference PaperNOT_IN_WOS