@inproceedings{discovery1470412,
          volume = {15},
            note = {This version is the author accepted manuscript. For information on re-use, please refer to the publisher's terms and conditions.},
         address = {Bremen, Germany},
       booktitle = {Proceedings of the 15th IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM)},
           pages = {1--10},
           month = {September},
          series = {IEEE International Working Conference on Source Code Analysis and Manipulation},
            year = {2015},
           title = {ORBS and the Limits of Static Slicing},
       publisher = {IEEE},
         journal = {2015 IEEE 15TH INTERNATIONAL WORKING CONFERENCE ON SOURCE CODE ANALYSIS AND MANIPULATION (SCAM)},
            issn = {1942-5430},
          author = {Binkley, D and Gold, N and Harman, M and Islam, S and Krinke, J and Yoo, S},
        abstract = {Observation-based slicing is a recently-introduced, language-independent slicing technique based on the dependencies observable from program behaviour. Due to the well-known limits of dynamic analysis, we may only compute an under-approximation of the true observation-based slice. However, because the observation-based slice captures all possible dependence that can be observed, even such approximations can yield insight into the limitations of static slicing. For example, a static slice, S, that is strictly smaller than the corresponding observation based slice is potentially unsafe. We present the results of three sets of experiments on 12 different programs, including benchmarks and larger programs, which investigate the relationship between static and observation-based slicing. We show that, in extreme cases, observation-based slices can find the true minimal static slice, where static techniques cannot. For more typical cases, our results illustrate the potential for observation-based slicing to highlight limitations in static slicers. Finally, we report on the sensitivity of observation-based slicing to test quality.},
             url = {http://dx.doi.org/10.1109/SCAM.2015.7335396},
        keywords = {Science \& Technology, Technology, Computer Science, Information Systems, Computer Science, Interdisciplinary Applications, Engineering, Electrical \& Electronic, Computer Science, Engineering}
}