Evaluating Lexical Approximation of Program Dependence

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 140
  • Download : 0
Complex dependence analysis typically provides an underpinning approximation of true program dependence. We investigate the effectiveness of using lexical information to approximate such dependence, introducing two new deletion operators to Observation-Based Slicing (ORBS). ORBS provides direct observation of program dependence, computing a slice using iterative, speculative deletion of program parts. Deletions become permanent if they do not affect the slicing criterion, The original ORBS uses a bounded deletion window operator that attempts to delete consecutive lines together. Our new deletion operators attempt to delete multiple, non-contiguous lines that are lexically similar to each other. We evaluate the lexical dependence approximation by exploring the trade-off between the precision and the speed of dependence analysis performed with new deletion operators. The deletion operators are evaluated independently, as well as collectively via a novel generalization of ORBS that exploits multiple deletion operators: Multi-operator Observation-Based Slicing (MOBS). An empirical evaluation using three Java projects, six C projects, and one multi-lingual project written in Python and C finds that the lexical information provides a useful approximation to the underlying dependence. On average. MOBS can delete 69% of lines deleted by the original ORBS, while taking only 36% of the wall clock time required by ORBS. (C) 2019 Elsevier Inc. All rights reserved.
Publisher
ELSEVIER SCIENCE INC
Issue Date
2020-02
Language
English
Article Type
Article
Citation

JOURNAL OF SYSTEMS AND SOFTWARE, v.160

ISSN
0164-1212
DOI
10.1016/j.jss.2019.110459
URI
http://hdl.handle.net/10203/270919
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0