Inductive equivalence in machine-based instruction editing

Abstract

Computer software development has produced many advances within computer science and in most aspects of modern society. Even with modern quality control, bug finding, and other code checking applications, computer software is often less than ideal. A developer may write code that is functionally accurate but lacks security, documentation, speed, storage, reusability, or other element that may make a segment of software code less than ideal. Identifying equivalent code, within a defined hypothesis strength and/or resource limitation, and, when found, replacing it with a vetted equivalent promotes the deployment of software that is more robust, secure, usable and reusable, and/or satisfies performance or other objectives.

1 . A method, comprising:
 retrieving, by a processor from a data repository, a candidate source code, having a candidate function, and comprising a first human-readable machine instruction;   accessing, by the processor from the data repository, a preferred function comprising a second human-readable machine instruction and has been previously identified as an authorized source code;   accessing, by the processor, an equivalence limitation threshold;   automatically determining, by the processor, equivalence between the candidate function and the preferred function wherein the processor executes a plurality of processing operations, comprising the determination of equivalence between the candidate function and the preferred function, until the equivalence limitation threshold is reached;   upon equivalence being determined, automatically providing, by the processor, indicia of equivalence associated with the candidate function and the preferred function;   upon the indicia being provided, automatically transforming, by the processor, the candidate source code comprising replacing the candidate function with the preferred function; and   outputting the transformed candidate source code.   
     
     
         2 - 48 . (canceled)