Please use this identifier to cite or link to this item:
|Title:||Path exploration based on symbolic output||Authors:||Qi, D.
Relevant slice condition
|Issue Date:||2011||Citation:||Qi, D.,Nguyen, H.D.T.,Roychoudhury, A. (2011). Path exploration based on symbolic output. Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering : 278-288. ScholarBank@NUS Repository. https://doi.org/10.1145/2025113.2025152||Abstract:||Efficient program path exploration is important for many software engineering activities such as testing, debugging and verification. However, enumerating all paths of a program is prohibitively expensive. In this paper, we develop a partitioning of program paths based on the program output. Two program paths are placed in the same partition if they derive the output similarly, that is, the symbolic expression connecting the output with the inputs is the same in both paths. Our grouping of paths is gradually created by a smart path exploration. Our experiments show the benefits of the proposed pathexploration in test-suite construction. Our path partitioning produces a semantic signature of a program - describing all the different symbolic expressions that the output can assume along different program paths. To reason about changes between program versions, we can therefore analyze their semantic signatures. In particular, we demonstrate the applications of our path partitioning in debugging of software regressions © 2011 ACM.||Source Title:||Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering||URI:||http://scholarbank.nus.edu.sg/handle/10635/41999||ISBN:||9781450304436||DOI:||10.1145/2025113.2025152|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 21, 2020
checked on Dec 30, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.