Path Exploration based on Symbolic Output
| dc.contributor.author | QI, Dawei | en_US |
| dc.contributor.author | NGUYEN, Hoang D. T. | en_US |
| dc.contributor.author | ROYCHOUDHURY, Abhik | en_US |
| dc.date.accessioned | 2011-03-17T06:36:18Z | en_US |
| dc.date.accessioned | 2017-01-23T07:00:16Z | |
| dc.date.available | 2011-03-17T06:36:18Z | en_US |
| dc.date.available | 2017-01-23T07:00:16Z | |
| dc.date.issued | 2011-03-17T06:36:18Z | en_US |
| dc.description.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 path exploration 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. | en_US |
| dc.format.extent | 443073 bytes | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/3347 | en_US |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | TRC3/11 | en_US |
| dc.title | Path Exploration based on Symbolic Output | en_US |
| dc.type | Technical Report | en_US |