Conference paper Open Access

PathMiner : A Library for Mining of Path-Based Representations of Code

Vladimir Kovalenko; Egor Bogomolov; Timofey Bryksin; Alberto Bacchelli

One recent, significant advance in modeling source code for machine learning algorithms has been the introduction of path-based representation -- an approach consisting in representing a snippet of code as a collection of paths from its syntax tree. Such representation efficiently captures the structure of code, which, in turn, carries its semantics and other information.
Building the path-based representation involves parsing the code and extracting the paths from its syntax tree; these steps build up to a substantial technical job. With no common reusable toolkit existing for this task, the burden of mining diverts the focus of researchers from the essential work and hinders newcomers in the field of machine learning on code.


In this paper, we present PathMiner -- an open-source library for mining path-based representations of code. PathMiner is fast, flexible, well-tested, and easily extensible to support input code in any common programming language. Preprint [https://doi.org/10.5281/zenodo.2595271]; released tool [https://doi.org/10.5281/zenodo.2595257].

Files (514.6 kB)
Name Size
pathminer-preprint.pdf
md5:f1707759e8f38c1e7ec53a4c5fd49462
514.6 kB Download
760
477
views
downloads
All versions This version
Views 760762
Downloads 477477
Data volume 245.5 MB245.5 MB
Unique views 677679
Unique downloads 430430

Share

Cite as