Applying multiple rewriting without collision for semi-automatic program rewriting system
US9785422B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 31, 2016 |
| Grant date | Oct 10, 2017 |
| Priority date | — |
| Expiry date | Oct 31, 2036 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F8/433
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A system and method for applying multiple rewritings without contention in a semi-automatic program rewriting system. The method includes: finding dependent ranges of a variable and a modification affecting range of the variable in a target program; determining at least two solutions for target program modification; detecting whether a collision condition exists amongst the one or more solutions; and modifying the program with said one or more solutions if no collision condition exists, while disabling the other solution if a collision condition is detected. A solution includes a rewriting of a segment of a target program code, and there is performed applying one or both of: multiple rewritings in a single solution and multiple rewritings in multiple regions of the target program. When multiple solutions are applied, the second and later solutions are applied to the already rewritten program. The correct application regions of the second and later solutions are identified.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.