Loading...
Please wait, while we are loading the content...
Similar Documents
A path-sensitively sliced control flow graph.
| Content Provider | CiteSeerX |
|---|---|
| Author | Jaffar, Joxan Murali, Vijayaraghavan |
| Abstract | Abstract. We present a new intermediate graph representation for programs with specified target variables. These programs are intended to be processed by thirdparty applications such as verifiers, testers and analysers. The representation embodies two concepts. First, it is path-sensitive in the sense that there may be multiple nodes representing one program point so that infeasible symbolic execution paths can be excluded. Second, and more importantly, the graph is sliced with respect to the target variables. This key step is founded on the fact that slicing is more effective when there is path sensitivity. Compared to the traditional representation of Control Flow Graph, the new graph may be bigger (due to path-sensitivity considerations), or smaller (due to slicing). We show that the new graph is not much bigger in practice, if at all. The main result however concerns the quality of the new graph: we show, using a number of third party applications of verification and testing, that the new graph performs substantially better. 1 |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Path-sensitively Sliced Control Flow Graph New Graph Third Party Application Control Flow Graph Multiple Node Key Step Program Point New Intermediate Graph Representation New Graph Performs Main Result Target Variable Infeasible Symbolic Execution Path Path Sensitivity Thirdparty Application Specified Target Variable Traditional Representation Path-sensitivity Consideration |
| Content Type | Text |
| Resource Type | Article |
