The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Apr. 01, 2025

Filed:

Mar. 11, 2022
Applicant:

Microsoft Technology Licensing, Llc, Redmond, WA (US);

Inventors:

Rohan Jayesh Bavishi, Berkeley, CA (US);

José Pablo Cambronero Sánchez, New Haven, CT (US);

Anna Fariha, Redmond, WA (US);

Sumit Gulwani, Sammamish, WA (US);

Vu Minh Le, Redmond, WA (US);

Ivan Radicek, Zagreb, HR;

Daniel Galen Simmons, Sammamish, WA (US);

Ashish Tiwari, Sammamish, WA (US);

Assignee:
Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06F 40/211 (2020.01); G06F 8/30 (2018.01); G06F 16/3329 (2025.01); G06F 40/284 (2020.01);
U.S. Cl.
CPC ...
G06F 40/211 (2020.01); G06F 8/31 (2013.01); G06F 16/3329 (2019.01); G06F 40/284 (2020.01);
Abstract

Techniques are described herein that are capable of creating a language-agnostic computer program repair engine generator. A context-free grammar is annotated to identify token(s) that are likely to be included in or excluded from a computer program in a manner that violates the context-free grammar. A language-agnostic computer program repair engine generator is created that is configured to generate a parser. The repair engine generator is configured to create a repair engine that: converts the candidate string into repaired strings that neither violate the context-free grammar nor violate a criterion for a valid computer program; calculates differences between the candidate string and the respective repaired strings; and replaces the candidate string with a designated repaired string based at least in part on the difference between the designated repaired string and the candidate string being less than or equal to a difference threshold.


Find Patent Forward Citations

Loading…