Predicting and/or applying symbolic transformation templates
AssigneeGoogle Inc.
InventorsJoey Hong, Rishabh Singh, Joel Galenson, Jonathan Malmaud, Manzil Zaheer
Life of this patent
Estimating the term…
Loading patent…
AssigneeGoogle Inc.
InventorsJoey Hong, Rishabh Singh, Joel Galenson, Jonathan Malmaud, Manzil Zaheer
Estimating the term…
Implementations are described herein for predicting symbolic transformation templates to automate source code transformations. In various implementations, pair(s) of predecessor and successor source code snippets may be processed using a symbolic transformation template prediction (STTP) model to predict a symbolic transformation template that includes a predecessor portion that matches the predecessor source code snippet(s) of the pair(s) and a successor portion that matches the successor source code snippet(s) of the pair(s). At least one additional predecessor source code snippet may be identified that matches the predecessor portion of the predicted symbolic transformation template. Placeholders of the predecessor portion of the predicted symbolic transformation template may be bound to one or more tokens of the at least one additional predecessor source code snippet to create binding(s). The successor portion of the predicted symbolic transformation template may be applied to the bindings to generate additional successor source code snippet(s).
A method implemented using one or more processors and comprising:
A method for generating a plurality of synthetic source code transformations to train a symbolic transformation template prediction (STTP) model for automation of source code transformations, the method implemented using one or more processors and comprising:
A system comprising one or more processors and memory storing instructions that, in response to execution by the one or more processors, cause the one or more processors to:
Dependencies are inferred from the claim text.