UCL Discovery
UCL home » Library Services » Electronic resources » UCL Discovery

MOAD: Modeling Observation-based Approximate Dependency

Lee, S; Binkley, D; Feldt, R; Gold, N; Yoo, S; (2019) MOAD: Modeling Observation-based Approximate Dependency. In: Chanchal, Roy, (ed.) Proceedings of 19th International Working Conference on Source Code Analysis and Manipulation (SCAM) - 2019. IEEE: Cleveland, OH, USA.. Green open access

[thumbnail of Gold_MOAD. Modeling Observation-based Approximate Dependency_AAM.pdf]
Preview
Text
Gold_MOAD. Modeling Observation-based Approximate Dependency_AAM.pdf - Accepted Version

Download (329kB) | Preview

Abstract

While dependency analysis is foundational to many applications of program analysis, the static nature of many existing techniques presents challenges such as limited scalability and inability to cope with multi-lingual systems. We present a novel dependency analysis technique that aims to approximate program dependency from a relatively small number of perturbed executions. Our technique, called MOAD (Modeling Observation-based Approximate Dependency), reformulates program dependency as the likelihood that one program element is dependent on another, instead of a more classical Boolean relationship. MOAD generates a set of program variants by deleting parts of the source code, and executes them while observing the impacts of the deletions on various program points. From these observations, MOAD infers a model of program dependency that captures the dependency relationship between the modification and observation points. While MOAD is a purely dynamic dependency analysis technique similar to Observation Based Slicing (ORBS), it does not require iterative deletions. Rather, MOAD makes a much smaller number of multiple, independent observations in parallel and infers dependency relationships for multiple program elements simultaneously, significantly reducing the cost of dynamic dependency analysis. We evaluate MOAD by instantiating program slices from the obtained probabilistic dependency model. Compared to ORBS, MOAD's model construction requires only 18.7% of the observations used by ORBS, while its slices are only 16% larger than the corresponding ORBS slice, on average.

Type: Proceedings paper
Title: MOAD: Modeling Observation-based Approximate Dependency
Event: 19th IEEE International Working Conference on Source Code Analysis and Manipulation
Location: Cleveland, OH
Dates: 30 September 2019 - 01 October 2019
ISBN-13: 978-1-7281-4937-0
Open access status: An open access version is available from UCL Discovery
DOI: 10.1109/SCAM.2019.00011
Publisher version: https://doi.org/10.1109/SCAM.2019.00011
Language: English
Additional information: This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions.
UCL classification: UCL
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science
URI: https://discovery.ucl.ac.uk/id/eprint/10079333
Downloads since deposit
170Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item